Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & 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 '93 Conference proceedings on Communications architectures, protocols and applications
Open issues and challenges in providing quality of service guarantees in high-speed networks
ACM SIGCOMM Computer Communication Review
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
Client requirements for real-time communication services
IEEE Communications Magazine
New directions in communications (or which way to the information age?)
IEEE Communications Magazine
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
A router architecture for real-time point-to-point networks
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
A Router Architecture for Real-Time Communication in Multicomputer Networks
IEEE Transactions on Computers
Parametric Design Synthesis of Distributed Embedded Systems
IEEE Transactions on Computers
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
Coordinated multihop scheduling: a framework for end-to-end services
IEEE/ACM Transactions on Networking (TON)
Performance Impact of Coarse Timer Granularities on QoS Guarantees in Unix-Based Systems
IEEE Transactions on Computers
A Simplified Guaranteed Service for the Internet
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Scalable Architecture for Fair Leaky-Bucket Shaping
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A network architecture for providing per-flow delay guarantees with scalable core
Journal of High Speed Networks
Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted
Computers and Operations Research
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks
IEEE Transactions on Parallel and Distributed Systems
Research: Design and analysis of delay control for CBR services in ATM networks
Computer Communications
Hi-index | 0.25 |
A non-work-conserving server is one that may be idle even when there are packets available to be sent. Since they do not provide the optimal average performance, non-work-conserving disciplines were seldom studied in the past. For the guaranteed performance service class in integrated services networks, the main performance index is the end-to-end delay bound, instead of the average delay. Providing end-to-end delay bounds in a networking environment is difficult. While bounding delay in any server requires a bound on the input traffic, complex interactions among traffic streams usually distort the traffic pattern, so that traffic inside the network is different from the source traffic. Previous techniques of bounding end-to-end delay in a networking environment usually start from the source traffic characterizations and iteratively 'push' the traffic characterizations through the network. This not only requires non-trivial analysis, but also has several important limitations. In this paper, we show that non-work-conserving disciplines greatly simplify the analysis in a networking environment, and overcome most of the limitations of previous work by controlling traffic distortion inside the network, thus allowing a single node analysis to be extended to arbitrary topology networks.