A Characterization of Universal Stability in the Adversarial Queuing Model

  title={A Characterization of Universal Stability in the Adversarial Queuing Model},
  author={Carme {\`A}lvarez and Maria J. Blesa and Maria J. Serna},
  journal={SIAM J. Comput.},
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… 

Figures and Tables from this paper

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

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

  • M. Blesa
  • Computer Science, Mathematics
  • 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.

Adversarial Queueing Model for Continuous Network Dynamics

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.

The impact of dynamic link slowdowns on network stability

  • D. Koukopoulos
  • 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.

Optimal Algorithms for Detecting Network Stability

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.

Adversarial queuing theory with setups

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

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.

Universal Routing in Multi-hop Radio Networks

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.

An Adversarial Construction of Instability Bounds in LIS Networks

It is shown that a network that uses the LIS protocol for contention-resolution may result in dropping its instability bound at injection rates ρ > 0 when the network size and the high slowdown D take large values, which is the best ever known instability lower bound for LIS networks.



Universal stability results for greedy contention-resolution protocols

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.

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

This work gives a complete and simple characterization of all networks that are universally stable in this model of adversarial queueing theory for packet routing and shows that a specific greedy protocol, SIS (Shortest in System), is stable against 0/1 stochastic adversaries.

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

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.

Stability and non-stability of the FIFO protocol

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.

New stability results for adversarial queuing

We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. [6]. We show that the scheduling protocol First-In-First-Out (FIFO) can be unstable at any

Adversarial queueing theory

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.

Adversarial models for priority‐based networks

This article proposes several variations of the adversarial queueing model, and provides a characterization of the networks that are stable under first‐in‐first‐out (FIFO) and LIS in the failure model (and therefore in the reliable and priority models), and shows that the stability problem under FIFO and L IS in theFailure model can be solved in polynomial time.

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

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.

Instability of FIFO at arbitrarily low rates in the adversarial queuing model

It is proved that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queuing delays, at arbitrarily low injection rates, using a network of size polynomial in 1/r.

A Note on Models for Non-Probabilistic Analysis of Packet-Switching Networks

The relation between two models commonly used in the literature to model adversarial injection of packets into a packet switching network are established and the set of sequences of packets that allow stability is established.