Service guarantees for joint scheduling and flow control
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (01912216) , 1804-1809
- https://doi.org/10.1109/cdc.1997.657824
Abstract
We consider a general mesh network with multiple traffic streams subject to window flow control on a per hop, per stream basis. Scheduling at each server is governed by "service curve" requirements. We establish lower bounds on the window sizes such that each stream receives pre-specified service guarantees.Keywords
This publication has 11 references indexed in Scilit:
- Latency-rate servers: a general model for analysis of traffic scheduling algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On deterministic traffic regulation and service guarantees: a systematic approach by filteringIEEE Transactions on Information Theory, 1998
- Efficient network QoS provisioning based on per node traffic shapingIEEE/ACM Transactions on Networking, 1996
- Bandwidth scheduling for wide-area ATM networks using virtual finishing timesIEEE/ACM Transactions on Networking, 1996
- 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
- Credit-based flow control for ATM networksPublished by Association for Computing Machinery (ACM) ,1994
- Rate-Controlled Service DisciplinesJournal of High Speed Networks, 1994
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- New directions in communications (or which way to the information age?)IEEE Communications Magazine, 1986