Skip to main content

Performance Evaluation of the Parallel Packet Switch with a Sliding Window Scheme

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3981))

Included in the following conference series:

  • 616 Accesses

Abstract

This study analyzes how parallel packet switching (PPS) performs with a sliding window (SW). The PPS involves numerous packet switches that operate independently and in parallel. The typical PPS dispatch algorithm applies a round-robin method (RR). The class of PPS is characterized by deploying parallel center-stage switches that enable all memory buffers run more slowly than the external line rate. A novel SW packet switching method for PPS, called SW-PPS, is developed. The SW-PPS operates in a pipeline fashion to ensure overall switching. The performance of the RR-PPS and SW-PPS is evaluated for a torus topology. Under identical Bernoulli, the SW-PPS provided considerably outperformed RR-PPS. Furthermore, this investigation proposes a mathematical analytical model for RR-PPS and SW-PPS.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Kumar, S.: The Sliding-Window Packet Switch: A New Class of Packet Switch Architecture with Plural Memory Modules and Decentralized Control. IEEE J. Select. Areas Commun. 21, 656–673 (2003)

    Article  Google Scholar 

  2. Iyer, S.: Analysis of the Parallel Packet Switch Architecture. IEEE Transactions on Networking 11(2), 314–324 (2003)

    Article  MathSciNet  Google Scholar 

  3. Aslam, A., Christensen, K.: Parallel packet switching using multiplexers with virtual input queues. In: IEEE Conference on Local Computer Networks, pp. 270–277 (2002)

    Google Scholar 

  4. Chuang, S., Goel, A., McKeown, N., Prabhakar, B.: Matching output queuing with a combined input/output-queued switch. IEEE J. Select. Areas Commun. 17, 1030–1039 (1999)

    Article  Google Scholar 

  5. Karol, M., Hluchyj, M., Morgan, S.: Input Versus Output Queueing on a Space-Division Packet Switch. IEEE Transactions on Communications 35(12), 1347–1356 (1987)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, CL., Moh, C., Wu, CC., Lin, W. (2006). Performance Evaluation of the Parallel Packet Switch with a Sliding Window Scheme. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_118

Download citation

  • DOI: https://doi.org/10.1007/11751588_118

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34072-0

  • Online ISBN: 978-3-540-34074-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics