Delay Bounds in a Network with Aggregate Scheduling
Authors:
- Jean-Yves Le BoudecJBJean-Yves Le Boudec
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 1-13
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Universal stability results for greedy contention-resolution protocols2002
- Comments on "A deterministic approach to the end-to-end analysis of packet flows in connection oriented networks"IEEE/ACM Transactions on Networking, 2000
- Delay Bounds in a Network with Aggregate Scheduling2000
- An Expedited Forwarding PHB1999
- Performance bounds for flow control protocolsIEEE/ACM Transactions on Networking, 1999
- A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networksIEEE/ACM Transactions on Networking, 1998
- Specification of Guaranteed Quality of Service1997
- Quality of service guarantees in virtual circuit switched networksIEEE Journal on Selected Areas in Communications, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994