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
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
Service disciplines for packet-switching integrated services networks
Service disciplines for packet-switching integrated services networks
A measurement-based admission control algorithm for integrated services packet networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The Tenet real-time protocol suite: design, implementation, and experiences
IEEE/ACM Transactions on Networking (TON)
A measurement-based admission control algorithm for integrated service packet networks
IEEE/ACM Transactions on Networking (TON)
Second moment resource allocation in multi-service networks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
RED-VBR: a renegotiation-based approach to support delay-sensitive VBR video
Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Parametric Design Synthesis of Distributed Embedded Systems
IEEE Transactions on Computers
Real-Time Transport of MPEG Video with a Statistically Guaranteed Loss Ratio in ATM Networks
IEEE Transactions on Parallel and Distributed Systems
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)
Statistical Real-Time Communication over Ethernet
IEEE Transactions on Parallel and Distributed Systems
An admission control scheme for end-to-end statistical QoS provision in IP networks
Journal of Computer Science and Technology
The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
An estimator of regulator parameters in a stochastic setting
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Mobile Computing
Slack allocation techniques for intra-path load balancing
Journal of High Speed Networks
FISTE: A black box approach for end-to-end QoS management
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Pricing-based call admission control for wireless MPEG-4 traffic
Computer Communications
The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
An approximation of the end-to-end delay distribution
IWQoS'03 Proceedings of the 11th international conference on Quality of service
H-BIND: a new approach to providing statistical performance guarantees to VBR traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Hi-index | 0.01 |
This paper demonstrates a new, efficient, and general approach for providing end-to-end performance guarantees in integrated services networks. This is achieved by modeling a traffic source with a family of bounding interval-dependent (BIND) random variables and by using a rate-controlled service discipline inside the network. The traffic model stochastically bounds the number of bits sent over time intervals of different length. The model captures different source behavior over different time scales by making the bounding distribution an explicit function of the interval length. The service discipline, RCSP, has the priority queueing mechanisms necessary to provide performance guarantees in integrated services networks. In addition, RCSP provides the means for efficiently extending the results from a single switch to a network of arbitrary topology. These techniques are derived analytically and then demonstrated with numerical examples.