A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
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
Statistical Delay Guarantee of Virtual Clock
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
WF2Q: worst-case fair weighted fair queueing
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
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Bandwidth allocation for multiple qualities of service using generalized processor sharing
IEEE Transactions on Information Theory
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
Statistical analysis of the generalized processor sharing scheduling discipline
IEEE Journal on Selected Areas in Communications
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
Bandwidth constrained smoothing for multimedia streaming with scheduling support
Journal of Systems Architecture: the EUROMICRO Journal
Enabling large-scale wireless broadband: the case for TAPs
ACM SIGCOMM Computer Communication Review
Schedulability criterion and performance analysis of coordinated schedulers
IEEE/ACM Transactions on Networking (TON)
Statistical admission control for real-time services under earliest deadline first scheduling
Computer Networks and ISDN Systems
Balancing distance and lifetime in delay constrained ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
ACM SIGMETRICS Performance Evaluation Review
An analytical QoS service model for delay-based differentiation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced bulk scheduling for supporting delay sensitive streaming applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Statistical admission control for real-time services under earliest deadline first scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Dynamic end-to-end capacity in IEEE 802.16 wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quantifying bandwidth gain of triage QoS protocol and mobility effects
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
An analytical model for all-optical packet switching networks with finite FDL buffers
Photonic Network Communications
| Hi-index | 0.00 |
In multihop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets incur low delays at upstream nodes, downstream nodes can reduce priority and schedule other packets first. The goal of this paper is to define a framework for design and analysis of coordinated multihop scheduling (CMS) which exploit such internode coordination. We first provide a general CMS definition which enables us to classify a number of schedulers from the literature, including G-EDF, FIFO+, CEDF, and work-conserving CJVC as examples of CMS schedulers. We then develop a distributed theory of traffic envelopes which enables us to derive end-to-end statistical admission control conditions for CMS schedulers. We show that CMS schedulers are able to limit traffic distortion to within a narrow range resulting in improved end-to-end performance and more efficient resource utilization. Consequently, our technique exploits statistical resource sharing among flows, classes, and nodes, and our results provide the first statistical multinode multiclass admission control algorithm for networks of work conserving servers.