Skip to main content

Cell–by–Cell Round Robin Service Discipline for ATM Networks

  • Conference paper
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2094))

Included in the following conference series:

Abstract

Multimedia applications generate network traffic that requires stringent per-connection performance guarantees, in terms of throughput, delay, jitter and packet loss. To guarantee such performance requirements, the network must maintain two levels of control: connection admission control (CAC) at the connection level and service discipline at the packet level. In this paper we present a new service discipline for statistical, deterministic and best-effort services in ATM networks. This discipline, the Cell-by-Cell Round Robin (CRR), uses the round robin idea to provide fairness among the different users and isolation between them. We show that by guaranteeing a minimum service rate for a connection, its end-to-end delay can be bounded and greatly reduced. Moreover, fixed resources are needed at all nodes in the path from source to destination. This discipline achieves flexibility in supporting different QoS requirements, and provides a policing mechanism for misbehaving users and facilitates the pricing process.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. J. Nagle, “On Packet Switches with Infinite Storage,” RFC 896, 1985.

    Google Scholar 

  2. J. Nagle, “On Packet Switches with Infinite Storage,” IEEE Trans. on Communications, April 1987,Vol. 35(4): p. 435–438.

    Google Scholar 

  3. H. Zhang and D. Ferrari, “Rate-Controlled Static-Priority Queueing,” Proceedings of INFOCOM’93, San Francisco, CA, April 1993.

    Google Scholar 

  4. D. Ferrari and D. C. Verma, “A Scheme for Real-Time Channel Establishment in Wide-area networks,” IEEE Journal on Selected Areas in Communications, Apr. 1990,Vol. 8(3): p. 368–379.

    Google Scholar 

  5. S. J. Golestani, “A Stop-and-Go Queueing Framework for Congestion Management,” In Proceedings of ACM SIGCOMM’90, Philadelphia, Pennsylvania, Sep. 1990: p. 8–18.

    Google Scholar 

  6. A. I. Elwalid and D. Mitra, “Effective Bandwidth of General Markovian Traffic Sources and Admission Control of High Speed Networks,” IEEE/ACM Trans. Networking, June 1993,Vol. 1(3): p. 329–343.

    Google Scholar 

  7. C. Chang and J. A. Thomas, “Effective Bandwidth in High-Speed Digital Networks,” IEEE Journal on Selected Areas in Communications, Aug. 1995,Vol. 13(6): p. 1091–1100.

    Google Scholar 

  8. H. Mokhtar, R. Pereira, and M. Merabti, “Resource Allocation Scheme for Deterministic Services of Video Streams,” accepted for publication in ISCC’01, July 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mokhtar, H.M., Pereira, R., Merabti, M. (2001). Cell–by–Cell Round Robin Service Discipline for ATM Networks. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-47734-9_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42303-4

  • Online ISBN: 978-3-540-47734-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics