Transition time asymptotics of queue-based activation protocols in random-access networks

DOI10.1016/j.spa.2020.08.004zbMath1454.60140arXiv1807.05851OpenAlexW2884279866MaRDI QIDQ2229694

Francesca R. Nardi, Matteo Sfragara, W. Th. F. den Hollander, Sem C. Borst

Publication date: 18 February 2021

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05851

zbMATH Keywords

metastabilitytransition timeactivation protocolsrandom-access networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (4)

Adding edge dynamics to bipartite random-access networks ⋮ On the transition times in a loss model of wireless networks ⋮ On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency ⋮ Crossover times in bipartite networks with activity constraints and time-varying switching rates

Cites Work

• Unnamed Item
• Unnamed Item
• Hitting time asymptotics for hard-core interactions on grids
• Delay performance in random-access networks
• Metastability of hard-core dynamics on bipartite graphs
• Randomized scheduling algorithm for queueing networks
• Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues
• Distributed Random Access Algorithm: Scheduling and Congestion Control

This page was built for publication: Transition time asymptotics of queue-based activation protocols in random-access networks