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

Borst, Sem; Hollander, Frank den; Nardi, Francesca R.; Sfragara, Matteo

doi:10.1016/j.spa.2020.08.004

Cited by 7 publications

(28 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We focus on queue-based activation rates, in line with the models and the results in [3] and [4]. This leads to two level of complexity, driven by the queue dependences of the activation rates and by the edge dynamics.…”

Section: Motivation and Backgroundmentioning

confidence: 99%

“…We consider the bipartite graph G = ((U, V ), E), where U ∪ V is the set of nodes and E is the set of bonds that connect a node in U to a node in V , and vice versa (bonds are undirected). We recall some definitions and basic facts from [3] and [4].…”

Section: Mathematical Modelmentioning

confidence: 99%

“…Not much is known in the literature for random-access protocols with dynamic interference graph, even for models with fixed activation rates. In this section we adapt the theory built in [3] and [4] to study the effects of the dynamics on these type of models. Assume that the activation rates are of the form…”

Section: The Graph Evolutionmentioning

confidence: 99%

“…The present paper is a continuation of [3] and [4]. We introduce an edge dynamics on the bipartite interference graph by allowing edges to appear and disappear over time.…”

Section: Introductionmentioning

confidence: 99%

“…In Section 1.1 we motivate our interest in adding edge dynamics to random-access network models. A more extended motivation for studying (queue-based) random-access protocols is provided in [3,Section 1.1], where also relevant references to the literature are included. In Section 1.2 we describe the setting and the mathematical model of interest in this paper by specifying edge dynamics.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Adding edge dynamics to bipartite random-access networks

Sfragara¹

2021

Preprint

View full text Add to dashboard Cite

We consider random-access networks with nodes representing servers with queues. The nodes can be either active or inactive: a node deactivates at unit rate, while it activates a rate that depends on its queue length, provided none of its neighbors is active.In order to model the effects of user mobility in wireless networks, we analyze dynamic interference graphs where the edges are allowed to appear and disappear over time. We focus on bipartite graphs, and study the transition time between the two states where one half of the network is active and the other half is inactive, in the limit as the queues become large. Depending on the speed of the dynamics, we are able to obtain a rough classification of the effects of the dynamics on the transition time.

show abstract

Section: Motivation and Backgroundmentioning

confidence: 99%

Section: Mathematical Modelmentioning

confidence: 99%

Section: The Graph Evolutionmentioning

confidence: 99%

“…The present paper is a continuation of [3] and [4]. We introduce an edge dynamics on the bipartite interference graph by allowing edges to appear and disappear over time.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Adding edge dynamics to bipartite random-access networks

Sfragara¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

Wireless random‐access networks with bipartite interference graphs

Borst,

den Hollander,

Nardi

et al. 2023

Random Struct Algorithms

View full text Add to dashboard Cite

We consider random‐access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its neighbors is active. We consider arbitrary bipartite graphs in the limit as the initial queue lengths become large and identify the transition time between the two states where one half of the network is active and the other half is inactive. The transition path is decomposed into a succession of transitions on complete bipartite subgraphs. We formulate a randomized greedy algorithm that takes the graph as input and gives as output the set of transition paths the network is most likely to follow. Along each path we determine the mean transition time and its law on the scale of its mean. Depending on the activation rates, we identify three regimes of behavior.

show abstract

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

Dimitriou

2021

Queueing Syst

View full text Add to dashboard Cite

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

Cited by 7 publications

References 18 publications

Adding edge dynamics to bipartite random-access networks

Adding edge dynamics to bipartite random-access networks

Wireless random‐access networks with bipartite interference graphs

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

Contact Info

Product

Resources

About