Quality of service guarantees in virtual circuit switched networks
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 13 (6), 1048-1056
- https://doi.org/10.1109/49.400660
Abstract
We review some recent results regarding the problem of providing deterministic quality of service guarantees in slot-based virtual circuit switched networks. The concept of a service curve is used to partially characterize the service that virtual circuit connections receive. We find that service curves provide a convenient framework for managing the allocation of performance guarantees. In particular, bounds on end-to-end performance measures can be simply obtained in terms of service curves and burstiness constraints on arriving traffic. Service curves can be allocated to the connections, and we consider scheduling algorithms that can support the allocated service curves. Such an approach provides the required degree of isolation between the connections in order to support performance guarantees, without precluding statistical multiplexing. Finally, we examine the problem of enforcing burstiness constraints in slot-based networksKeywords
This publication has 18 references indexed in Scilit:
- Stability, queue length, and delay of deterministic and stochastic queueing networksIEEE Transactions on Automatic Control, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- Sample Path Analysis of Token RingsPublished by Elsevier ,1994
- Input buffer requirements for round robin polling systemsPerformance Evaluation, 1993
- Performance and stability of communication networks via robust exponential boundsIEEE/ACM Transactions on Networking, 1993
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- On computing per-session performance bounds in high-speed multi-hop computer networksACM SIGMETRICS Performance Evaluation Review, 1992
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 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