Advertisement

Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches

  • Claus Bauer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3405)

Abstract

The choice of the scheduling algorithm is a major design criteria for internet switches and routers. Research on scheduling algorithms has mainly focused on maximum weight matching scheduling algorithms, which are computationally very complex and on the computationally less complex maximal weight matching algorithms which require a speedup of two to guarantee the stability of the switch. For practical purposes, neither a high computational complexity nor a speedup is desirable. In this paper, we propose a specific maximal weight matching algorithm that guarantees the stability of a single switch without a speedup.

Whereas initial research has only focused on scheduling algorithms that guarantee the stability of a single switch, it is known that scheduling algorithms that guarantee the stability of individual switches do not necessarily stabilize networks of switches. Recent work has shown how scheduling algorithms for single switches can be modified in order to design scheduling algorithms that stabilize networks of input-queued switches. We apply those results to the design of the maximal weight matching algorithm proposed in this paper and show that the algorithm does not only stabilize a single switch, but also networks of input-queued switches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ajmone, M., Giaccone, P., Leonardi, E., Mellia, M., Neri, F.: Local scheduling policies in networks of packet switches with input queues. In: Proc. of Infocom 2003, San Francisco (April 2003)Google Scholar
  2. 2.
    Ajmone, M., Leonardi, E., Mellia, M., Neri, F.: On the throughput achievable by isolated and interconnected input-queued switches under multicalss traffic. In: Proc. of Infocom 2002, New York City (June 2002)Google Scholar
  3. 3.
    Andrews, M., Zhang, L.: Achieving stability in networks of input queued switches. In: Proc. of Infocom 2001, Anchorage, Alaska (April 2001)Google Scholar
  4. 4.
    Benson, K.: Throughput of crossbar switches using maximal weight matching algorithms. In: Proc. of IEEE ICC 2002, New York City (2002)Google Scholar
  5. 5.
    Dai, J.G., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proc. of IEEE Infocom 2000, Tel Aviv (2000)Google Scholar
  6. 6.
    Keslassy, I., McKeown, N.: Achieving 100% throughput in an input queued switch. IEEE Transactions on Communications 47(8), 1260–1272 (1999)CrossRefGoogle Scholar
  7. 7.
    Shah, D., Kopikare, M.: Delay bounds for approximate maximum weight matching algorithms for input queued switches. In: Proc. of IEEE Infocom 2002, New York City (June 2002)Google Scholar
  8. 8.
    Shah, D.: Stable Algorithms for input queued switches. In: Proc. 39th Annual Allerton Conference on Communication, Control and Computing (October 2001) Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Claus Bauer
    • 1
  1. 1.Dolby LaboratoriesSan FranciscoUSA

Personalised recommendations