https://arxiv.org/abs/2305.10672

Skip to main content
Cornell University
We are hiring

We gratefully acknowledge support from the Simons Foundation, member
institutions, and all contributors. Donate
 
arxiv logo > cs > arXiv:2305.10672
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv logo
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Distributed, Parallel, and Cluster Computing

arXiv:2305.10672 (cs)
[Submitted on 18 May 2023]

Title:Relay Mining: Verifiable Multi-Tenant Distributed Rate Limiting

Authors:Daniel Olshansky, Ramiro Rodriguez Colmeiro
Download a PDF of the paper titled Relay Mining: Verifiable
Multi-Tenant Distributed Rate Limiting, by Daniel Olshansky and
Ramiro Rodr\'iguez Colmeiro
Download PDF

    Abstract: Relay Mining presents a scalable solution employing
    probabilistic mechanisms and crypto-economic incentives to
    estimate RPC volume usage, facilitating decentralized
    multi-tenant rate limiting. Network traffic from individual
    applications can be concurrently serviced by multiple RPC service
    providers, with costs, rewards, and rate limiting governed by a
    native cryptocurrency on a distributed ledger. Building upon
    established research in token bucket algorithms and distributed
    rate-limiting penalty models, our approach harnesses a feedback
    loop control mechanism to adjust the difficulty of mining relay
    rewards, dynamically scaling with network usage growth. By
    leveraging crypto-economic incentives, we reduce coordination
    overhead costs and introduce a mechanism for providing RPC
    services that are both geopolitically and geographically
    distributed.

Comments: 13 pages, 4 tables, 5 figures, 2 appendices with 8 figures
          Distributed, Parallel, and Cluster Computing (cs.DC);
Subjects: Cryptography and Security (cs.CR); Systems and Control
          (eess.SY)
Cite as:  arXiv:2305.10672 [cs.DC]
          (or arXiv:2305.10672v1 [cs.DC] for this version)
          https://doi.org/10.48550/arXiv.2305.10672
          Focus to learn more
          arXiv-issued DOI via DataCite

Submission history

From: Daniel Olshansky [view email]
[v1] Thu, 18 May 2023 03:23:41 UTC (1,713 KB)
Full-text links:

Download:

  * Download a PDF of the paper titled Relay Mining: Verifiable
    Multi-Tenant Distributed Rate Limiting, by Daniel Olshansky and
    Ramiro Rodr\'iguez Colmeiro
    PDF
  * Other formats

(license)
Current browse context:
cs.DC
< prev   |   next >
new | recent | 2305
Change to browse by:
cs
cs.CR
cs.SY
eess
eess.SY

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

a export BibTeX citation Loading...

BibTeX formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Reddit logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
[ ] Litmaps Toggle
Litmaps (What is Litmaps?)
[ ] scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
( ) Code, Data, Media

Code, Data and Media Associated with this Article

[ ] Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
[ ] DagsHub Toggle
DagsHub (What is DagsHub?)
[ ] Links to Code Toggle
Papers with Code (What is Papers with Code?)
[ ] ScienceCast Toggle
ScienceCast (What is ScienceCast?)
( ) Demos

Demos

[ ] Replicate Toggle
Replicate (What is Replicate?)
[ ] Spaces Toggle
Hugging Face Spaces (What is Spaces?)
( ) Related Papers

Recommenders and Search Tools

[ ] Link to Influence Flower
Influence Flower (What are Influence Flowers?)
[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)

  * Author
  * Venue
  * Institution
  * Topic

( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack