SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)
SIAM Journal on Computing
A multiclass network with non-linear, non-convex, non-monotonic stability conditions
Queueing Systems: Theory and Applications
Stability of a three-station fluid network
Queueing Systems: Theory and Applications
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
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Traffic scheduling in packet-switched networks: analysis, design, and implementation
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
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
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adversarial queuing theory with setups
Theoretical Computer Science
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms (TALG)
Adaptive Application Scaling for Improving Fault-Tolerance and Availability in the Cloud
Bell Labs Technical Journal
| Hi-index | 0.00 |
We show that the First-In-First-Out (FIFO) scheduling discipline can be unstable in the (σ,ρ) regulated session model for packet-switched networks. In this model packets are injected into the network in fixed sessions. The total size of the session-i packets injected during the time interval [x, y) is at most σi + ρi(y - x) for some burst parameter σi and rate ρi. The sum of the rates of sessions passing through a server is at most the server speed.Previous work on FIFO stability either allowed for dynamically changing session paths or else assumed that session-i packets are injected at a constant rate. Our result shows that FIFO can be unstable for static paths as long as the injections into a session can be temporarily suspended.