Skip to main content

Effect of Unbalanced Bursty Traffic on Memory-Sharing Schemes for Internet Switching Architecture

  • Conference paper
  • 440 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3420))

Abstract

Shared-memory based packet switches are increasingly being used for high-performance Internet switches and routers. The shared-memory switches are known to provide better throughput and packet-loss performance for bursty data traffic in high-speed networks and Internets compared with other buffering strategies under conditions of identical memory resource deployed in the shared-memory switch. The scheme to share the common memory resource among various broadband lines has direct impact on the throughput and packet-loss performance of the switch. In this paper, we compare the effect of unbalanced bursty traffic on commonly used memory-sharing schemes, namely the individual-static threshold based, global-static threshold based, dynamic threshold based and SMDA based memory-sharing schemes.

Authors are with the Networking Research Lab (NRL) at UTPA. The research work of Dr. Kumar is supported in part by fundings from CITeC, FRC, FDC, and OBRR.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Irland, M.I.: Buffer management in a packet switch. IEEE Transactions of Communications 26, 328–337 (1978)

    Article  MATH  Google Scholar 

  2. Kamoun, F., Kleinrock, L.: Analysis of shared finite storage in a computer node environment under general traffic conditions. IEEE Transactions of Communications 28, 992–1003 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Choudhury, A.K., Hahne, E.L.: Dynamic queue length thresholds for shared-memory packet switches. IEEE/ACM Transactions of Networking 6(2), 130–140 (1998)

    Article  Google Scholar 

  4. Kumar, S.: The Sliding-Window Packet Switch: A new class of packet switch architecture with plural memory modules and decentralized control. IEEE Journal on Selected Areas in Communications 21(4), 656–673 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Munoz, A., Kumar, S. (2005). Effect of Unbalanced Bursty Traffic on Memory-Sharing Schemes for Internet Switching Architecture. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_98

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31956-6_98

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25339-6

  • Online ISBN: 978-3-540-31956-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics