Advertisement

The New Packet Scheduling Algorithms for VOQ Switches

  • A. Baranowska
  • W. Kabaciński
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3124)

Abstract

We present two new scheduling algorithms, the Maximal Matching with Random Selection (MMRS) and the Maximal Matching with Round-Robin Selection (MMRRS). These algorithms provide high throughput and fair access in a packet switch that uses multiple input queues. They are based on finding a maximal matching between input and output ports without iterations. Simulations performed show that for large load these algorithms perform better than other iterative algorithms.

Keywords

Time Slot Schedule Algorithm Output Port Input Port Maximal Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Karol, M.K., Hluchyj, M., Morgan, S.: Input versus output queuing on a spacedivision packet switch. IEEE Trans. Commun. 35, 1347–1356 (1987)CrossRefGoogle Scholar
  2. 2.
    Anderson, T., et al.: High-speed switch scheduling for local-area networks. ACM Trans. Comp. Syst. 11, 319–352 (1993)CrossRefGoogle Scholar
  3. 3.
    Chao, H.J., Lam, C.H., Oki, E.: Broadband Packet Switching Technologies: A Practical Guide to ATM Switches in IP Routers. Willey, New York (2001)Google Scholar
  4. 4.
    Chao, H.J.: Next generation routers. Proc. of the IEEE 90, 1510–1558 (2002)CrossRefGoogle Scholar
  5. 5.
    McKeown, N., Varaiya, P., Warland, J.: Scheduling cells in an input-queued switch. IEE Electronics Letters 29, 2174–2175 (1993)CrossRefGoogle Scholar
  6. 6.
    McKeown, N.: The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Network. 7, 188–200 (1999)CrossRefGoogle Scholar
  7. 7.
    Chao, H.J.: Saturn: A terabit packet switch using dual round-robin. IEEE Commun. Mag. 38, 78–84 (2002)CrossRefGoogle Scholar
  8. 8.
    Yoshigoe, K., Christensen, K.J.: An evolution to crossbar switches with virtual ouptut queuing and buffered cross points. IEEE Network 17, 48–56 (2003)CrossRefGoogle Scholar
  9. 9.
    McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in input-queued switches. IEEE Trans. Commun. 47, 1260–1267 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • A. Baranowska
    • 1
  • W. Kabaciński
    • 1
  1. 1.Institute of Electronics and TelecommunicationsPoznań University of TechnologyPoznańPoland

Personalised recommendations