Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Annals of Applied Probability Année : 2021

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

Résumé

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.

Domaines

Autre
Fichier principal
Vignette du fichier
Castiel_27121..pdf (457.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03203131 , version 1 (20-04-2021)

Identifiants

Citer

Eyal Castiel, Sem Borst, Laurent Miclo, Florian Simatos, Phil Whiting. Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms. The Annals of Applied Probability, 2021, 31 (2), pp.941-971. ⟨10.1214/20-AAP1609⟩. ⟨hal-03203131⟩
19 Consultations
18 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More