Skip to main content

A Balanced Scheduling Algorithm for High-Speed ATM Switch

  • Conference paper
  • First Online:
Information Networking: Wired Communications and Management (ICOIN 2002)

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

Included in the following conference series:

Abstract

As far as asynchronous transfer mode (ATM) is concerned, virtual output queue (VOQ) is an efficient architecture of high throughput performance. ATM is primarily applied in the backbone, and it is necessary to schedule data in an efficient way. In this paper, we will propose balanced scheduling VOQ algorithm (B-VOQ) to resolve the complicated problem of cell scheduling. By utilizing B-VOQ, we can obtain the optimal average delay comparing with other proposed algorithms.

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

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. Karol, M.; Hluchyj, M.; and Morgan, S.; “Input output queuing on a space division switch,” IEEE Trans. Communications, vol. 35, no. 12, pp. 1347–1356, 1988.

    Article  Google Scholar 

  2. Ajmone Marsan, M.G; Bianco, A.; and Leonardi E.;” RPA: A Simple, Efficient, and Flexible Policy for Input buffered switch,” IEEE Communication Letters, 193-:83–86, May 1997.

    Google Scholar 

  3. Andeson, T.; Owicki, S.; Saxe, J.; and Thacker, C; “High Speed Switch Scheduling for Local Area Network,” ACM Trans, on Computer System, pp. 319–352. November 1993.

    Google Scholar 

  4. McKeown, N; Anantharam, V; and Walrand, J; “ Achieving 100% Throughput in an Input-Queued Switch,” Proc. of IEEE’ 96, San Francisco, March 1996.

    Google Scholar 

  5. McKeown, N;” Switching Algorithm for Input-Queued Cell Switches,” PhD Thesis, University of California at Berkeley, 1995.

    Google Scholar 

  6. N. McKeown, “The iSlip Scheduling Algorithm for Input-queues Switches,” IEEE Trans, on Networking, Vol. 7, No. 2, pp. 188–201, April 1999.

    Article  Google Scholar 

  7. Wenzhe Cui, Hanseok Ko and Sunshin, ”A Threshold Based scheduling Algorithm for Input Queue Switch,” Dept. of Electronic Engineering, Korea University, Seoul, Korea, ICOIN 15, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sheu, ST., Lee, BH., Tseng, HW., Ko, CY., Liang, WZ. (2002). A Balanced Scheduling Algorithm for High-Speed ATM Switch. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45803-4_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44256-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics