Abstract
Providing service separation and quality of service guarantees requires the use of scheduling algorithms in the switches and network interfaces. We present the RCC+ Mux, a hardware efficient Rate Controlled Cell Multiplexer that has the capablity to provide explicit bandwidth reservation guarantees and thereby an excellent service separation. The RCC+ Multiplexer is simulated in the presence of self-similar traffic and compared to the FIFO queue, the Worst-case Fair Weighted Fair Queueing plus (WF2Q+) scheduler, and the already existing RCC Multiplexer. Moreover we point out the most favourable and critical characteristics of the RCC+ Multiplexer.
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
Anujan Varma and Dimitrios Stiliadis, “Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks,” in IEEE Communications Magazine, 1997.
A. Parekh, A generalized processor sharing approach to flow control in integrated services networks., 1992.
A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” in Proceedings ACM SIGCOM ’89, 1989, pp. 3–12.
Jon C.R. Bennett and Hui Zhang, “WF2Q: Worst-case fair weighted fair queueing,” in Proceedings of INFOCOM ’96, 1996.
Sašo Stojanovsky, Traffic management over APON and superPON access networks, 1999.
Donpaul C. Stephens, Jon C.R. Bennett, and Hui Zhang, “Implementing scheduling algorithms in high-speed networks,” in IEEE JSAC Special Issue on High Performance Switches/Routers, 1999.
Jon C.R. Bennett and Hui Zhang, “Why WFQ is not good enough for integrated services networks,” in Proceedings of NOSSDAV ’96, 1996.
Jon C.R. Bennett, Donpaul C. Stephens, and Hui Zhang, “High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks,” in Proceedings of ICNP ’97, 1997.
Dimitrios Stiliadis and Anujan Varma, “Efficient fair-queueing algorithms for ATM and packet networks,” Tech. Rep., 1995.
Dimitrios Stiliadis and Anujan Varma, “A general methodology for designing efficient traffic scheduling and shaping algorithms,” in Proceedings of IEEE IN- FOCOM ’97, 1997.
Dimitrios Stiliadis, Traffic scheduling in packet-switched networks: analysis, design, and implementation, 1996.
Dimitrios Stiliadis and Anujan Varma, “Latency-rate servers:a general model for analysis of traffic scheduling algorithms,” in Proceedings of IEEE INFOCOM ’96, 1996, pp. 111-119.
Koohong Kang, Bart Steyaert, and Cheeha Kim, “Service separation in ATM networks using a hardware efficient rate-controlled cell multiplexer,” in Proceedings of the International Teletraffic Congress ITC-16, 1999, vol. 3a.
Dirk Abendroth, “Untersuchung der Leistungsfhigkeit von WFQ-algorithmen zur Sicherung von Service-Separation und QoS-Garantien in ATM-Netzen,” Diploma thesis, Communication Networks TU Hamburg-Harburg, 2000.
S. Golestani, “A self-clocked fair queueing scheme for broadband applications,” in Proceedings of IEEE INFOCOM ’94, 1994, pp. 636-646.
Berkeley, University of California, The Almagest - Volume I, Ptolemy 0.7 Users Manual, 1997.
Berkeley, University of California, The Almagest - Volume II, Ptolemy 0.7 Programmers Manual, 1997.
Berkeley, University of California, The Almagest - Volume III, Ptolemy 0.7 Kernel Manual, 1997.
Dimitrios Stiliadis and Anujan Varma, Frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks, 1995.
James W. Roberts and Jorma T. Virtamo, “The superposition of periodic cell arrival streams in an ATM multiplexer,” in IEEE transactions on communication, february 1991, vol. 39, pp. 298-303.
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
Abendroth, D. (2001). Service Separation and QoS in ATM Networks: The RCC+ Multiplexer. In: Killat, U., Lamersdorf, W. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56675-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-56675-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41645-6
Online ISBN: 978-3-642-56675-2
eBook Packages: Springer Book Archive