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

DOI10.1016/J.SPA.2020.08.004MaRDI QIDQ2229694zbMATH OpenOpenAlexFDO

Authors Francesca Romana Nardi, Matteo Sfragara, Sem Borst, F. den Hollander

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

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

Abstract: We consider networks where each node represents a server with a queue. An active node deactivates at unit rate. An inactive node activates at a rate that depends on its queue length, provided none of its neighbors is active. For complete bipartite networks, in the limit as the queues become large, we compute the average transition time between the two states where one half of the network is active and the other half is inactive. We show that the law of the transition time divided by its mean exhibits a trichotomy, depending on the activation rate functions.

Recommendations

• On queueing problems in random-access communications
• Asymptotic analysis of the values of queues in multiple access computer networks.
• Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
• Slow transitions and starvation in dense random-access networks
• Probabilistic-time characteristics of bistable random access networks
• Exact transient expectations for queueing networks
• Queueing networks with instantaneous sequential transitions
• scientific article; zbMATH DE number 610378
• Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates

Cites work

• scientific article; zbMATH DE number 3951995 (Why is no real title available?)
• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• Delay performance in random-access networks
• Distributed Random Access Algorithm: Scheduling and Congestion Control
• Hitting time asymptotics for hard-core interactions on grids
• Metastability of hard-core dynamics on bipartite graphs
• Queue-based random-access algorithms: fluid limits and stability issues
• Randomized scheduling algorithm for queueing networks

Cited in

(5)

• Slow transitions and starvation in dense random-access networks
• Crossover times in bipartite networks with activity constraints and time-varying switching rates
• 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
• On the transition times in a loss model of wireless networks
• Adding edge dynamics to bipartite random-access networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229694)