Skip to main content

Using Split Queues to Improve the Performance of Parallel Switch

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2003)

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

Included in the following conference series:

  • 541 Accesses

Abstract

Parallel switch scales well with the growth of port density and line rate. PSIQC (Parallel Switch based on Input-Queued Crossbar) is a parallel switch that is scalable and simple to implement. But it needs large capacity high-speed memories to store cells, and the average cell latency is high under heavy load. This paper presents a revised version of PSIQC based on split queues that is initialed as SQ-PSIQC (Split Queued Parallel Switch based on Input-Queued Crossbar), and its scheduling algorithm SQ-RRDS (Split Queued Round Robin and Deterministic Sequence). SQ-PSIQC not only has all of the original characteristics, but also solves the two above-mentioned problems. In SQ-PSIQC the memory buffers are required to operate only at 1/m of the line rate, where m is the number of the middle switches. The simulation results show that SQ-PSIQC performs better than PSIQC in the average latency and throughput under any load, especially heavy load.

Supported by: (1) the National Natural Science Foundation of China (No. 90104001); (2) the National High Technology Research and Development Plan of China (No. 2001AA112120).

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. McKeown, N.: A fast switched backplane for a gigabit switched router. Business Communications Review (December 1997)

    Google Scholar 

  2. McKeown, N., Izzard, M., Mekkittikul, A., Ellersick, W., Horowitz, M.: Tiny Tera: a packet switch core. IEEE Micro 17(1), 26–33 (1997)

    Article  Google Scholar 

  3. Partidge, C., Carvey, P., Burgess, E., et al.: A 50Gb/s IP router. IEEE/ACM Transactions on Networking 6(3), 237–248 (1998)

    Article  Google Scholar 

  4. Arpaci, M., Copeland, J.: Buffer Management for Shared-Memory ATM Switches. IEEE Communications Surveys, 1Q (2000)

    Google Scholar 

  5. Semeria, C.: Internet backbone routers and evolving Internet design. White paper, http://www.juniper.com

  6. Iyer, S., Zhang, R., McKeown, N.: Routers with a Single Stage of Buffering. In: Proc. of ACM SIGCOMM 2002, Pittsburgh (September 2002)

    Google Scholar 

  7. Iyer, S., Awadallah, A., McKeown, N.: Analysis of a packet switch with memories running slower than the line rate. In: Proc. of IEEE Infocom 2000, Tel-Aviv, Israel (March 2000)

    Google Scholar 

  8. Iyer, S., McKeown, N.: Making Parallel Packet Switches Practical. In: Proc. of IEEE Infocom 2001, Alaska (April 2001)

    Google Scholar 

  9. Wang, W., Dong, L., Wolf, W.: A Distributed Switch Architecture with Dynamic Loadbalancing and Parallel Input-Queued Crossbars for Terabit Switch Fabrics. In: Proc. Of IEEE Infocom 2002, New York (June 2002)

    Google Scholar 

  10. Keslassy, I., McKeown, N.: Maintaining Packet Order in Two-Stage Switches. In: Proc. of IEEE Infocom 2002, New York (June 2002)

    Google Scholar 

  11. Chiussi, F., Khotimsky, D., Krishnan, S.: Generalized Inverse Multiplexing of Switched ATM Connections. In: Proc. of IEEE Globecom 1998, Sydney, Australia (November 1998)

    Google Scholar 

  12. Bennett, J., Partridge, C., Shectman, N.: Packet Reordering is not Pathological Network Behavior. IEEE/ACM Transactions on Networking 7(6), 789–798 (1999)

    Article  Google Scholar 

  13. McKeown, N.: iSLIP: a scheduling algorithm for input-queued switches. IEEE/ACM Transactions on Networking 7(2), 188–201 (1999)

    Article  Google Scholar 

  14. Zhigang, S., Jinshu, S., Xicheng, L.: ISP: a high performance crossbar arbitrating algorithm. Journal of Computer Research and Development (In Chinese) 23(10), 1078–1082 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, X., Sun, Z., Lu, X., Su, J. (2003). Using Split Queues to Improve the Performance of Parallel Switch. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39425-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20054-3

  • Online ISBN: 978-3-540-39425-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics