Abstract
The design of traffic management schemes for multimedia applications is a challenge for the future Internet. The main problem is the high burstiness of the multimedia traffic. Most of the traffic management schemes try to minimize the to-tal bandwidth required to serve multimedia applications. However, these schemes typically suffer from a poor scalability. Rather than minimizing the burstiness of the multimedia sessions, we present an approach that tries to benefit from high variability of multimedia sessions to maximize the bandwidth offered to the best-effort traffic. The proposed scheme, called DSS, is based on shaping of the flows and on the use of the GPS scheduling policy in the routers. We show that DSS is highly scalable and that its bandwidth requirement for multimedia sessions remains reasonable, in particular smaller than the bandwidth requirement of RPPS.
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
Zhang, H.: Service discipline for guaranteed performance service in packet-switching networks. Proceedings of the IEEE 83 (1995) 1374–1396
Chlamtac, I., Farago, A., Zhang, H.: A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks. Transactions on Networking (1998) 422–431
Charny, A., Le Boudec, J.Y.: Delay bounds in a network with aggregate scheduling. In: Quality of Future Internet Services. Volume 1922 of Lecture Notes in Computer Science., Berlin, Germany, Springer (2000) 1–13
Bennett, J., Benson, K., Charny, A., Courtney, W.F., Le Boudec, J.Y.: Delay jitter and packet scale rate guarantee for expedited forwarding. In: Proceedings of Infocom, Anchorage, Alaska (2001)
Reisslein, M., Ross, K., Rajagopal, S.: Guaranteeing statistical QoS to regulated traffic: The single node case. In: Proceedings of IEEE Infocom, New York (1999)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Transactions on Networking 2(1994) 137–150
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Transactions on Networking 1 (1993) 344–357
Golestani, S.J.: A self-clocked fair queueing scheme for broadband applications. In: Proc. of IEEE INFOCOM’94, Toronto, Canada (1994) 636–646
Bennett, J.C.R., Zhang, H.: WF2Q: worst-case fair weighted fair queueing. In: Proceedings of IEEE Infocom, San Fransisco, California (1996) 120–128
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. ACM Computer Communication Review 25 (1995) 231–242
Le Boudec, J.Y: An application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory 44 (1998)
Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications 13 (1995) 1048–1056
Boyer, P., Guillemin, F., Servel, M.: The spacer-controller: An efficient upc/npc for atm networks. In: ISS’92. (1992)
Blake, S., Black, D., Carlson, M., Davies, E., Z. Wang, Weiss, W.: An architecture for differentiated services. IETF RFC 2475 (1998)
Bennett, J., Benson, K., Charny, A., Courtney, W.F., Le Boudec, J.Y., Shiu, A., Kalmanek, C., Stiliadis, D., Fioriru, V., Ramakrishnam, K.K.: An expedited forwarding phb. (Technical Reportdraft-ietf-diffserv-rfc2598bis-00.txt)
Reisslein, M., Ross, K., Rajagopal, S.: Guaranteeing statistical QoS to regulated traffic: The multiple node case. In: 37th IEEE Conference on Decision and Control (CDC), Tampa, Florida (1998)
Zhang, Z.L., Liu, Z., Towsley, D.: Closed-form deterministic performance bounds for the generalized processor sharing scheduling discipline. Journal of Combinatorial Optimization, Special Issue on Scheduling 1 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urvoy-Keller, G., Biersack, E.W. (2001). DSS: A Deterministic and Scalable QoS Provisioning Scheme. In: Smirnov, M.I., Crowcroft, J., Roberts, J., Boavida, F. (eds) Quality of Future Internet Services. QofIS 2001. Lecture Notes in Computer Science, vol 2156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45412-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-45412-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42602-8
Online ISBN: 978-3-540-45412-0
eBook Packages: Springer Book Archive