Skip to main content

Service Separation and QoS in ATM Networks: The RCC+ Multiplexer

  • Conference paper
Kommunikation in Verteilten Systemen (KiVS)

Part of the book series: Informatik aktuell ((INFORMAT))

  • 89 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anujan Varma and Dimitrios Stiliadis, “Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks,” in IEEE Communications Magazine, 1997.

    Google Scholar 

  2. A. Parekh, A generalized processor sharing approach to flow control in integrated services networks., 1992.

    Google Scholar 

  3. A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” in Proceedings ACM SIGCOM ’89, 1989, pp. 3–12.

    Google Scholar 

  4. Jon C.R. Bennett and Hui Zhang, “WF2Q: Worst-case fair weighted fair queueing,” in Proceedings of INFOCOM ’96, 1996.

    Google Scholar 

  5. Sašo Stojanovsky, Traffic management over APON and superPON access networks, 1999.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. Jon C.R. Bennett and Hui Zhang, “Why WFQ is not good enough for integrated services networks,” in Proceedings of NOSSDAV ’96, 1996.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Dimitrios Stiliadis and Anujan Varma, “Efficient fair-queueing algorithms for ATM and packet networks,” Tech. Rep., 1995.

    Google Scholar 

  10. Dimitrios Stiliadis and Anujan Varma, “A general methodology for designing efficient traffic scheduling and shaping algorithms,” in Proceedings of IEEE IN- FOCOM ’97, 1997.

    Google Scholar 

  11. Dimitrios Stiliadis, Traffic scheduling in packet-switched networks: analysis, design, and implementation, 1996.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. S. Golestani, “A self-clocked fair queueing scheme for broadband applications,” in Proceedings of IEEE INFOCOM ’94, 1994, pp. 636-646.

    Google Scholar 

  16. Berkeley, University of California, The Almagest - Volume I, Ptolemy 0.7 Users Manual, 1997.

    Google Scholar 

  17. Berkeley, University of California, The Almagest - Volume II, Ptolemy 0.7 Programmers Manual, 1997.

    Google Scholar 

  18. Berkeley, University of California, The Almagest - Volume III, Ptolemy 0.7 Kernel Manual, 1997.

    Google Scholar 

  19. Dimitrios Stiliadis and Anujan Varma, Frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks, 1995.

    Google Scholar 

  20. 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics