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

Authors:
Matthew Andrews
Affiliations:
Bell Laboratories, Murray Hill, NJ
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 17
Cited 1

Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service

IEEE/ACM Transactions on Networking (TON)
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
New stability results for adversarial queuing

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)

SIAM Journal on Computing
Stability of Adversarial Queues via Fluid Models

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Near-Optimal Packet Scheduler for QoS Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Fundamental Trade-offs in Aggregate Packet Scheduling

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Traffic scheduling in packet-switched networks: analysis, design, and implementation

Traffic scheduling in packet-switched networks: analysis, design, and implementation
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
Network calculus: a theory of deterministic queuing systems for the internet

Network calculus: a theory of deterministic queuing systems for the internet
Efficient network QoS provisioning based on per node traffic shaping

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal multiplexing on a single link: delay and buffer requirements

IEEE Transactions on Information Theory

Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for any r 0, there is a network of First-In-First-Out servers and a fixed set of sessions such that: —The network load is r with respect to the permanent sessions model with bounded arrivals. —The network can be made unstable.