Skip to Main content Skip to Navigation
Journal articles

Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms

Abstract : We examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a complete interference graph, which turns out to be highly nonstandard in two respects: (1) the scaling depends on some parameter of the algorithm and is not the N/N2 scaling usually found in functional central limit theorems; (2) the heavy traffic limit is deterministic. We discuss how this nonstandard behavior arises from the idleness induced by the distributed nature of the algorithm. In order to prove our main result, we developed a new method for obtaining a fully coupled stochastic averaging principle.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03203131
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Tuesday, April 20, 2021 - 3:37:44 PM
Last modification on : Wednesday, June 9, 2021 - 10:00:35 AM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2021-09-30

Please log in to resquest access to the document

Identifiers

Collections

Citation

Eyal Castiel, Sem Borst, Laurent Miclo, Florian Simatos, Phil Whiting. Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms. Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2021, 31 (2), pp.941-971. ⟨10.1214/20-AAP1609⟩. ⟨hal-03203131⟩

Share

Metrics

Record views

8