Using fluid models to prove stability of adversarial queueing networks

@article{Gamarnik2000UsingFM,
  title={Using fluid models to prove stability of adversarial queueing networks},
  author={David Gamarnik},
  journal={IEEE Trans. Autom. Control.},
  year={2000},
  volume={45},
  pages={741-746}
}
  • D. Gamarnik
  • Published 1 April 2000
  • Mathematics, Computer Science
  • IEEE Trans. Autom. Control.
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stags bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is implied by stability of an associated fluid queueing network. 

Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

TLDR
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.

On Delivery Times in Packet Networks under Adversarial Traffic

TLDR
It is shown that delivering all packets while maintaining stability can be done by an offline scheduler whenever the injection of packets is done at rate of at most 1, and that there is no online protocol that can achieve that property against all rate-1 adversaries.

Stability of FIFO networks under adversarial models: State of the art

Packet Scheduling Across Networks of Switches

TLDR
It is shown how coordination over sequential timeslots by algorithms such as those based on a round robin can provide considerable advantages over a randomized scheme.

Instability phenomena in underloaded packet networks with QoS schedulers

TLDR
This paper studies with fluid models and with adversarial queueing theory possible underload instabilities due to strict-priority schedulers and to Generalized Processor Sharing (GPS) Schedulers.

Underload Instabilities in Packet Networks With

TLDR
This paper studies possible underload instabilities due to flow Schedulers in packet networks, focusing on output queued switches with strict priority (SP) schedulers and Generalized Processor Sharing (GPS) schedULers, and results are rather surprising: SP scheduler appear to be more robust than GPS schedulering whenever exact information on the effective average packet flow rates is not available.

Maria Serna's contributions to adversarial queuing theory

Performance Analysis of Queueing Networks via Robust Optimization

TLDR
This paper proposes a new performance analysis method, which is based on the robust optimization, and is able to obtain explicit upper bounds on some steady-state performance measures of queueing networks.

Large bursts do not cause instability

  • B. Hajek
  • Computer Science
    IEEE Trans. Autom. Control.
  • 2000
TLDR
The purpose of this paper is to reduce the question of stability for networks with input traffic satisfying deterministic constraints in the sense of R.I. Cruz (1991) to a question of Stability for a fluid model.

ON DECIDING STABILITY OF MULTICLASS QUEUEING NETWORKS UNDER BUFFER PRIORITY SCHEDULING POLICIES

One of the basic properties of a queueing network is stability. Roughly speaking, it is the property that the total number of jobs in the network remains bounded as a function of time. One of the key

References

SHOWING 1-10 OF 45 REFERENCES

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

TLDR
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 non-adaptive packet routing policies in adversarial queueing networks

TLDR
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.

Adversarial queueing theory

TLDR
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.

Stability of acyclic multiclass queueing networks

TLDR
This paper deduces stability of the network using the tools of ergodic theory and shows that the distributions of the process converge to a unique steady state value and that convergence takes place at a geometric rate under appropriate moment conditions.

A fluid limit model criterion for instability of multiclass queueing networks

This paper studies the instability of multiclass queueing networks. We prove that if a fluid limit model of the queueing network is weakly unstable, then the queueing network is unstable in the sense

Piecewise linear test functions for stability and instability of queueing networks

TLDR
It is found that if an associated LP admits a positive solution, then a Lyapunov function exists, which implies that the fluid limit model is stable and hence that the network model is positive Harris recurrent with a finite polynomial moment.

Universal stability results for greedy contention-resolution protocols

TLDR
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.

A Fluid-limit Model Criterion for Instability of Multiclass Queueing Networks

This paper studies the instability of multiclass queueing networks. We prove that if a uid limit model of the queueing network is weakly unstable, then the queueing network is unstable in the sense

Stability and performance of multiclass queueing networks

TLDR
A new and direct approach for stability analysis based on linear programming is proposed that builds a linear program that provides an upper bound on the duration of the time until the fluid network empties and proves that this criterion for stability is both necessary and sufficient for networks with two stations.

Stability conditions for multiclass fluid queueing networks

TLDR
It is shown that for two-station systems the Lyapunov function approach is equivalent to the authors' and therefore characterizes stability exactly, and new sufficient conditions for the stability of multiclass queueing networks involving any number of stations are found.