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

Authors:
Vicent Cholvi;Juan Echagüe
Affiliations:
Universitat Jaume I, Campus del Riu sec, 12071 Castellón, Spain;Universitat Jaume I, Campus del Riu sec, 12071 Castellón, Spain
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 32
Cited 4

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors. IV. Tree-width and well-quasi-ordering

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Any work-conserving policy stabilizes the ring with spatial re-use

IEEE/ACM Transactions on Networking (TON)
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks

IEEE/ACM Transactions on Networking (TON)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Comments on “a deterministic approach to the end-to-end analysis of packet flows in connection oriented networks”

IEEE/ACM Transactions on Networking (TON)
Adaptive packet routing for bursty adversarial traffic

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Stability and non-stability of the FIFO protocol

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A note on models for non-probabilistic analysis of packet switching networks

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

SIAM Journal on Computing
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Application of network calculus to general topologies using turn-prohibition

IEEE/ACM Transactions on Networking (TON)
New Stability Results for Adversarial Queuing

SIAM Journal on Computing
Instability of FIFO in session-oriented networks

Journal of Algorithms - Special issue: SODA 2000
A Characterization of Universal Stability in the Adversarial Queuing Model

SIAM Journal on Computing
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

SIAM Journal on Computing
Adversarial models for priority-based networks

Networks
The Impact of Network Structure on the Stability of Greedy Protocols

Theory of Computing Systems
Source routing and scheduling in packet networks

Journal of the ACM (JACM)
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Fundamental Trade-Offs in Aggregate Packet Scheduling

IEEE Transactions on Parallel and Distributed Systems
Performance and stability bounds for dynamic networks

Journal of Parallel and Distributed Computing
Jobshop-Like Queueing Systems

Management Science
Instability of FIFO in the permanent sessions model at arbitrarily small network loads

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Deciding the FIFO stability of networks in polynomial time

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Deciding stability in packet-switched FIFO networks under the adversarial queuing model in polynomial time

DISC'05 Proceedings of the 19th international conference on Distributed Computing
A calculus for network delay. I. Network elements in isolation

IEEE Transactions on Information Theory
Autonet: a high-speed, self-configuring local area network using point-to-point links

IEEE Journal on Selected Areas in Communications

The Effects of Local Randomness in the Adversarial Queueing Model

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On Scheduling Policies for Streams of Structured Jobs

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Adversarial queuing theory with setups

Theoretical Computer Science
Instability of FIFO in a simple queueing system with arbitrarily low loads

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs for an arbitrarily length of time, no server will suffer an unbounded queue buildup. Over the last few years, much research has been carried out to gain an understanding of the factors that affect the stability of packet-switched networks. In this paper, we attempt to review the most noteworthy results in this area. We will focus on networks where the scheduling policy is of the FIFO type, which is, by far, the most widely adopted policy. We gather these results and present them in an organized manner. Furthermore, we also identify some directions open to future research.