# A Characterization of Universal Stability in the Adversarial Queuing Model

@article{lvarez2004ACO, title={A Characterization of Universal Stability in the Adversarial Queuing Model}, author={C. {\`A}lvarez and M. Blesa and M. Serna}, journal={SIAM J. Comput.}, year={2004}, volume={34}, pages={41-66} }

We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before leaving the system. Restrictions on the allowed packet trajectory provide a way to analyze stability under different packet trajectories. We consider five packet trajectories, two for directed graphs and three for undirected graphs, and provide polynomial time algorithms for… Expand

#### 44 Citations

The complexity of deciding stability under FFS in the Adversarial Queueing model

- Mathematics, Computer Science
- Inf. Process. Lett.
- 2004

We address the problem of deciding whether a given network is stable in the Adversarial Queueing Model when considering farthest-from-source (FFS) as the queueing policy to schedule the packets… Expand

Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time ,

- Mathematics, Computer Science
- DISC
- 2005

It is shown that the property of stability under fifo is decidable in polynomial time and provides a family of network topologies that, under the fifo protocol, can be made unstable by some adversarial traffic pattern. Expand

Adversarial Queueing Model for Continuous Network Dynamics

- Computer Science, Mathematics
- Theory of Computing Systems
- 2007

The generalization of the Adversarial Queueing Theory (aqt) model is initiated to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore, and it turns out that the property of universal stability of networks is decidable in polynomial time. Expand

The impact of dynamic link slowdowns on network stability

- Computer Science
- 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
- 2005

This work presents involved combinatorial constructions of executions that improve the state-of-the-art instability bound induced by certain known forbidden subgraphs on networks running a certain greedy protocol. Expand

Optimal Algorithms for Detecting Network Stability

- Mathematics, Computer Science
- WALCOM
- 2008

This work presents optimal algorithms for detecting the universal stability of a network and describes an algorithm which decides in constant time whether the addition of a link in a universally stable network leads it to instability. Expand

Adversarial queuing theory with setups

- Computer Science
- Theor. Comput. Sci.
- 2009

The model is robust in the sense that under some mild conditions universal stability of work conserving packet routing protocols is preserved for natural variants of the underlying model and the model's equivalence to so called token networks is established. Expand

Universal stability in multi-hop radio networks

- Computer Science
- J. Comput. Syst. Sci.
- 2020

It is proved that networks in which there is at least one node with an out-degree greater than 1 are unstable when using reactive hearing control, but all directed acyclic networks are universally stable, regardless of their out- Degree, if using proactive hearing control. Expand

Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks

- Computer Science
- SIROCCO
- 2020

This paper introduces a new family of combinatorial structures, which they call universally strong selectors, that are used to provide a set of transmission schedules and proposes a packet-oblivious routing algorithm which is working without using any global topological information, and guarantees stability for certain injection rates. Expand

Performance and stability bounds for dynamic networks

- Mathematics, Computer Science
- J. Parallel Distributed Comput.
- 2007

It is proved that every queueing network running a greedy contention-resolution protocol is stable for a rate not exceeding a particular stability threshold, depending on C and the length of the longest path in the network. Expand

Universal Routing in Multi-hop Radio Networks

- Computer Science
- ArXiv
- 2016

A new model to study stability in multi-hop wireless networks in the framework of adversarial queueing is introduced and it is shown that any scheduling policy that is unstable in the classical wireline adversarial model remains stable in themulti-hop radio network model, even in scenarios free of inter- ferences. Expand

#### References

SHOWING 1-10 OF 24 REFERENCES

Universal stability results for greedy contention-resolution protocols

- Computer Science
- Proceedings of 37th Conference on Foundations of Computer Science
- 1996

This paper focuses on a basic adversarial model of packet generation and path determination for which the time-averaged injection rate of packets requiring the use of any edge is limited to be less than 1, and shows that there exist simple greedy protocols that are stable for all networks. Expand

Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks

- Computer Science, Mathematics
- SIAM J. Comput.
- 2003

A simple and checkable network flow-type load condition is formulated for adaptive adversarial queueing networks, and a policy is proposed which achieves stability under this new load condition. Expand

Stability and non-stability of the FIFO protocol

- Computer Science
- SPAA '01
- 2001

This paper shows a graph for which FIFO is stable for any adversary with injection rate r ≰ 0.1428 and generalizes this results to show upper bound for stability of any network under FIFo protocol, answering partially an open question. Expand

Adversarial queueing theory

- Computer Science
- STOC '96
- 1996

A new approach to the study of dynamic (or continuous) packet routing, where packets are being continuously injected into a network, is introduced, based on the adversarial generation of packets, so that the results are more robust in that they do not hinge upon particular probabilistic assumptions. Expand

Stability of adversarial queues via fluid models

- Computer Science
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

It is shown how stability of a queueing network can be determined by considering an associated fluid models, and the main result is that the stability of the fluid model implies the Stability of an underlying adversarial queueingnetwork. Expand

Stability of networks and protocols in the adversarial queueing model for packet routing

- Computer Science
- SODA '99
- 1999

A complete and simple characterization of all networks that are universally stable in this model is given and it is shown that a specific greedy protocol, SIS (Shortest In System), is stable against a large class of stochastic adversaries. Expand

New stability results for adversarial queuing

- Computer Science
- SIAM J. Comput.
- 2004

The model of "adversarial queuing theory" for packet networks introduced by Borodin et al. is considered and it is shown that the scheduling protocol first-in-first-out (FIFO) can be unstable at any injection rate larger than 1/2 and that it is always stable if the injection rate is less than1/d. Expand

Adversarial Models for Priority-Based Networks

- Computer Science
- MFCS
- 2003

The problem of deciding stability of a given network under a fixed protocol can be solved in polynomial time and a characterization of the networks that are stable under fifo and lis in the failure model is provided. Expand

Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

- Mathematics, Computer Science
- SIAM J. Comput.
- 2004

It is proved that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queueing delays, at arbitrarily low injection rates, in the adversarial queueing model. Expand

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols

- Computer Science
- DISC
- 2002

This work focuses on a basic adversarial model for packet arrival and path determination for which the time-averaged arrival rate of packets requiring a single edge is no more than 1, and discovers that the composition of any two protocols among SIS, NTS and FTG is universally stable. Expand