Abstract
The future high-speed networks will need to support diverse traffic and provide services to flows with Quality of Service (QoS) requirements as well as to best effort flows. In this paper we analyze the coexistence of the QoS and best effort flows from the routing and scheduling point of view. We concentrate in our routing and scheduling analysis on the network bandwidth resource. We present two sets of source routing algorithms: (1) the bandwidth-constrained routing with imprecise state information for QoS flows, and (2) the maxmin fair routing for best effort flows. Furthermore, we discuss two level hierarchical scheduling which is tailored towards the needs raised by the coexistence of QoS and best effort flows.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch and Y. Shavitt. Converging to approximated max-min flow fairness in logarithmic time, accepted for Infocom’98, San-Francisco, CA, April 1998.
J. Bennett, H. Zhang. Hierarchical packet fair queueing algorithms. ACM SIGCOMM’96, 1996
D. Bertsekas, R. Gallager. Data networks. Prentice Hall, Englwood Cliffs, N.J., 1992.
S. Chen, K. Nahrstedt. Distributed qos routing with imprecise state information. IEEE Seventh International Conference on Computer, Communication and Networks, 1998.
S. Chen, K. Nahrstedt. Maxmin fair routing in connection-oriented networks. Proceedings of IASTED European Conference on Parallel and Distributed Systems, Vienna, Austria, July 1998.
A. Demers, S. Keshav, S. Shenker. Analysis and simulation of a fair queueing algorithm. ACM SIGCOMM’89, pages 3–12, 1989.
JM Faffe . Bottleneck flow control. IEEE Transactions on Communications, COM–29(7):954–962, July 1981.
ATM Forum. Private network network interface (pnni) v1.0 specifications. may 1996.
M. Garey, D. Johnson. Computers and Intractability: A Guide to the Theory of NP—Completeness. New York: W.H. Freeman, Co., 1979.
R. Guerin, A. Orda. Qos—based routing in networks with inaccurate information: Theory and algorithms. Infocom’97,Japan,April 1997.
D. H. Lorenz, A. Orda. Qos routing in networks with uncertain parameters. Infocom’98, March 1998.
Q. Ma, P. Steenkiste, H. Zhang. Routing high-bandwidth traffic in maxmin fair share networks. Proceedings of SIGCOMM’96, August 1996.
J. Mosley. Asynchronous distributed flow control algorithms. Ph.D. thesis, MIT, Dept. of Electrical Engineering, Computer Science, Cambridge, MA, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London Limited
About this paper
Cite this paper
Nahrstedt, K., Chen, S. (1999). Coexistence of QoS and Best-Effort Flows. In: De Natale, F., Pupolin, S. (eds) Multimedia Communications. Springer, London. https://doi.org/10.1007/978-1-4471-0859-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0859-7_14
Publisher Name: Springer, London
Print ISBN: 978-1-85233-135-1
Online ISBN: 978-1-4471-0859-7
eBook Packages: Springer Book Archive