Castiel, Eyal, Borst, Sem, Miclo, Laurent, Simatos, Florian and Whiting, Phil (2021) Induced idleness leads to deterministicheavy traffic limits for queue-basedrandom-access algorithms. Annals of Applied Probability, vol. 31 (n°2). pp. 941-971.

This is the latest version of this item.

[thumbnail of csma.pdf]
Download (488kB) | Preview
Identification Number : 10.1214/20-AAP1609


We examine a queue-based random-access algorithm where ac-tivation 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 nonstandard in two respects: (1) the scaling dependson some parameter of the algorithm and is not theN/N2scaling usuallyfound in functional central limit theorems; (2) the heavy traffic limit isdeterministic. We discuss how this nonstandard behavior arises from theidleness induced by the distributed nature of the algorithm. In order toprove our main result, we develop a new method for obtaining a fully cou-pled stochastic averaging principle.

Item Type: Article
Language: English
Date: April 2021
Refereed: Yes
Place of Publication: Hayward, Cal.
Divisions: Institut de mathématiques de Toulouse, TSE-R (Toulouse)
Site: UT1
Date Deposited: 25 Mar 2021 10:19
Last Modified: 23 Jul 2021 13:17
OAI Identifier:

Available Versions of this Item

View Item


Downloads per month over past year