Telecommunication Systems

, Volume 34, Issue 1–2, pp 37–49 | Cite as

Degree-sequenced matching algorithms for input-queued switches

  • Madhusudan Hosaagrahara
  • Harish Sethu


This paper presents a class of algorithms for scheduling packets in input-queued switches. As opposed to previously known algorithms that focus only on achieving high throughput, these algorithms seek to achieve low average delay without compromising the throughput achieved.

Packet scheduling in input-queued switches based on the virtual-output-queued architecture is a bipartite graph matching problem wherein ports are represented by vertices and the traffic flows by the edges. The set of matched edges determine the packets that are to be transferred from the input ports to the output ports. Current matching algorithms implicitly prioritize high-degree vertices, i.e., ports with a large number of flows, causing longer delays at ports with a smaller number of flows. Motivated by this observation, we present three matching algorithms based on explicitly prioritizing low-degree vertices and the edges through them. Using both real gateway traffic traces as well as synthetically generated traffic, we present simulation results showing that this class of algorithms achieves a low average delay as compared to other scheduling algorithms of equivalent complexity while still achieving similar throughput. We also show that these algorithms determine the maximum size matching in almost all cases.


Input-queued switches Scheduling and matching algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T.E. Anderson, S.S. Owicki, J.B. Saxe and C.P. Thacker, High-speed switch scheduling for local-area networks. ACM Trans. Comput. Syst. 11(4) (1993) 319–352.CrossRefGoogle Scholar
  2. 2.
    D. Angluin and L.G. Valiant, Fast probabilistic algorithms for hamiltonian circuits and matchings, in: ACM STOC, Boulder, CO, USA (1977), pp. 30–41. ACM Press.Google Scholar
  3. 3.
    A. Charny, P. Krishna, N. Patel and R. Simcoe, Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup. in: Proc. 6-th Int’l Wksp. on Quality-of-Service (IWQoS 98), Napa, CA, USA (1998) pp. 235–244.Google Scholar
  4. 4.
    N. Gura and H. Eberle, The least choice first (lcf) scheduling method for high-speed network switches, in: Proc. IEEE Intl. Parallel and Distributed Processing Symposium, Ft. Lauderdale, FL, USA (2002) pp. 51–60.Google Scholar
  5. 5.
    Hopcroft and Karp, An \(n^\frac52\) algorithm for maximum matchings in bipartite graphs. SIAM J. on Computing 2(4) (1973) 225.Google Scholar
  6. 6.
    T. Javidi, R. Magill and T. Hrabik, A high-throughput scheduling algorithm for a buffered crossbar switch fabric. in: Proc. IEEE Int’l Conf. Communications, Vol. 5, Helsinki, Finland (2001) pp. 1586–1591.Google Scholar
  7. 7.
    A. Kam and K.-Y. Siu, Linear complexity algorithms for QoS support in input-queued switches with no speedup. IEEE J. Select. Areas Commun. 17(6) (1999) 1040–1056.CrossRefGoogle Scholar
  8. 8.
    M. Karol, M. Hluchyj and S. Morgan, Input verses output queueing on a space division packet switch. IEEE Trans. Commun. COM-35 (1987) 1347–1356.Google Scholar
  9. 9.
    I. Keslassy, R. Zhang-Shen and N. McKeown, Maximum size matching is unstable for any packet switch. IEEE Commun. Lett. 7(10) (2003) 496–498.CrossRefGoogle Scholar
  10. 10.
    E. Leonardi, F. Neri and B. Yener, Algorithms for virtual output queued switching, in: Proc. IEEE GLOBECOM, Vol. 2, Rio de Janeiro, Brasil (1999) pp. 1203–1210.Google Scholar
  11. 11.
    N. McKeown, iSLIP: A scheduling algorithm for input-queued switches. IEEE/ACM Trans. Networking 7(2) (1999) 188–201.Google Scholar
  12. 12.
    N. McKeown, A. Mekkittikul, V. Anantharam and J. Walrand, Achieving 100% throughput in an input-queued switch. IEEE Trans. Commun. 47(8) (1999) 1260–1267.CrossRefGoogle Scholar
  13. 13.
    N. Ni and L.N. Bhuyan, Fair scheduling in internet routers. IEEE Trans. on Comput., Special Issue on Quality of Service Issues in Internet Web Services 51(6) (2002) 686–701.Google Scholar
  14. 14.
    NLANR Colorado State University OC3c tap (2003, Nov.). COS-1069192584-1.tsh.gz. NLANR Colorado State University OC3c tap. [Available on Request.].Google Scholar
  15. 15.
    M. Shreedhar and G. Varghese, Efficient fair queueing using deficit round-robin. IEEE/ACM Trans. on Networking 4(3) (1996) pp. 275–285.Google Scholar
  16. 16.
    Y. Tamir and G.L. Frazier, High-performance multi-queue buffers for vlsi communications switches, in: Proc. 15-th Annual Int’l Symp. on Comp. Arch. (ISCA), Honolulu, Hawaii, USA (1988) pp. 343–354.Google Scholar
  17. 17.
    X. Zhang and L. Bhuyan, Deficit round robin scheduling for input queued switches. IEEE J. Select. Areas Commun., Special Issue on High Performance Optical/Electronic Switches/Routers for High Speed Internet 21(4) (2003) 584–594.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.Computer Communications Laboratory, Department of Electrical and Computer EngineeringDrexel UniversityPhiladelphiaUSA

Personalised recommendations