Nothing Special   »   [go: up one dir, main page]

Skip to main content

FPCF Input–Queued Packet Switch for Variable-Size Packets

  • 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

The existing forward planning conflict-free (FPCF) packet switches are designed for fixed-size packets and synchronous operation mode. In this paper an asynchronous FPCF packet switch for variable-size packets is proposed. The key problem of efficient packet insertion procedure was solved by introduction of a so-called quasi-synchronous record array arrangement. A performance evaluation based on simulations is provided in terms of throughput, delay and loss probability. The limited maximum switch throughput is a deficiency of the presented asynchronous FPCF packet switch. In most cases, utilization of over 90% can be achieved by using multiple traffic flows, while preserving proper packet order. Maximum packet delays are comparable to those produced by output-queued packet switches. By comparing FPCF and virtual-output-queued packet switches a conclusion is drawn that FPCF switch produces both, lower maximum packet delays and lower packet delay variations.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Nong, G., Hamdi, M.: On the Provision of Quality-of-Service Guarantees for Input Queued Switches. IEEE Commun. Mag. 12 (2000) 62–69

    Google Scholar 

  2. Krishna, P., Patel, N.S., Charny, A., Simcoe, R.J.: On the Speedup Required for Work-Conserving Crossbar Switches. IEEE J. Select. Areas Commun. 6 (1999) 1057–1065

    Article  Google Scholar 

  3. McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. IEEE Trans. Commun. 8 (1999) 1260–1267

    Article  Google Scholar 

  4. Yau, V., Pawlikowski, K.: An Algorithm That Uses Forward Planning to Expedite Conflict-Free Traffic Assignment in Time-Multiplex Switching systems. IEEE Trans. Commun. 11 (1999) 1757–1765

    Google Scholar 

  5. Akimaru, H., Kawashima, K.: Teletraffic: Theory and Applications. 2nd edn. Springer-Verlag, Berlin Heidelberg New York (1999)

    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

Homan, P., Bester, J. (2001). FPCF Input–Queued Packet Switch for Variable-Size Packets. 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_35

Download citation

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

  • 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