An upper bound delay for the virtual-clock service discipline
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 3 (4), 399-408
- https://doi.org/10.1109/90.413214
Abstract
Proves that a connection composed of virtual-clock servers provides an upper bound on delay for leaky bucket constrained sessions, i.e., sessions conforming to a token bucket filter. This upper bound on delay is calculated, and it is the same upper bound on delay given by PGPS. The authors also prove that leaky bucket constrained sessions are the only type of sessions for which an upper bound on delay can be provided by servers with an upper bound on link capacity.Keywords
This publication has 15 references indexed in Scilit:
- Rate-controlled static-priority queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Rate controlled servers for very high-speed networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Comparison of rate-based service disciplinesPublished by Association for Computing Machinery (ACM) ,1991
- VirtualClockACM Transactions on Computer Systems, 1991
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- A stop-and-go queueing framework for congestion managementPublished by Association for Computing Machinery (ACM) ,1990
- A scheme for real-time channel establishment in wide-area networksIEEE Journal on Selected Areas in Communications, 1990