SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
The Tenet real-time protocol suite: design, implementation, and experiences
IEEE/ACM Transactions on Networking (TON)
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)
FOCS '97 Proceedings of the 38th 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
Generalized Guaranteed Rate Scheduling Algorithms: A Framework
Generalized Guaranteed Rate Scheduling Algorithms: A Framework
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
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
| Hi-index | 0.00 |
We study the problem of providing end-to-end delay guarantees in connection-oriented networks. In this environment, multiple-hop sessions coexist and interfere with one another.Parekh and Gallager showed that the Weighted Fair Queueing (WFQ) scheduling discipline provides a worst-case delay guarantee comparable to (1/ρi) × Ki for a session with rate ρi and Ki hops. Such delays can occur since a session-i packet can wait for time 1/ρi at every hop.We describe a randomized work-conserving scheme that guarantees, with high probability, an additive delay bound of approximately 1/ρi + Ki. This bound is smaller than the multiplicative bound (1/ρi) × Ki of WFQ, especially when the hop count Ki is large. We call our scheme COORDINATED-EARLIEST-DEADLINE-FIRST (CEDF) since it uses an earliest-deadline-first approach in which simple coordination is applied to the deadlines for consecutive hops of a session. The key to the bound is that once a packet has passed through its first server, it can pass through all its subsequent servers quickly.We conduct simulations to compare the delays actually produced by the two scheduling disciplines. In many cases, these actual delays are comparable to their analytical worst-case bounds, implying that CEDF outperforms WFQ.