Skip to main content
SpringerLink
Log in

Fair Scheduling for Input Buffered Switches

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Input buffered switch architecture has become attractive for implementing high performance switches for workstation clusters. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative Fair Scheduling (iFS) scheme for input buffered switches that supports fair bandwidth distribution among the flows and achieves asymptotically 100% throughput. We then apply the idea of fair scheduling to switches with multicasting capability and propose an mFS scheme which allocates bandwidth to various flows according to their reservations. We show that mFS produces throughput comparable to the existing schemes while distributing the bandwidth as per the given reservations. Extensive simulation results are presented to validate the effectiveness of our proposed schemes.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T.E. Anderson, S.S. Owicki, J.B. Saxe and C.P. Thacker, High speed switch scheduling for local area networks, ACM Transactions on Computer Systems 11(4) (November 1993) 319–352.

    Google Scholar 

  2. J. Bennett and H. Zhang, WF2Q: Worst-case fair weighted fair queueing, in: Proceedings of IEEE INFOCOM'96, San Francisco, CA, March 1996, pp. 120–128.

  3. A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, Journal of Internetworking Research and Experience 1(1) (September 1990) 3–26.

    Google Scholar 

  4. J. Ding and L.N. Bhuyan, Evaluation of multi-queue buffered multistage interconnection networks under uniform and non-uniform traffic patterns, International Journal of Systems Science 28(11) (1997) 1115–1128.

    Google Scholar 

  5. S.J. Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proceedings of IEEE INFOCOM'94, Toronto, Canada, June 1994, pp. 636–646.

  6. M.W. Goudreau, S.G. Kolliopoulos and S.B. Rao, Scheduling algorithms for input-queued switches: Randomized techniques and experimental evaluation, in: Proceedings of IEEE INFOCOM'00, Tel Aviv, Israel, Vol. 3, March 2000, pp. 1634–1643.

    Google Scholar 

  7. P. Goyan, H. Vin and H. Chen, Start-time fair queueing: A scheduling algorithm for integrated services, in: ACM SIGCOMM, Palo Alto, CA, August 1996, pp. 157–168.

  8. P. Gupta and N. McKeown, Design and implmentation of a fast crossbar scheduler, IEEE Micro (January/February 1999) 20–28.

  9. J.F. Hayes, R. Breault and M.K. Mehmet-Ali, Performance analysis of a multicast switch, IEEE Transactions on Communications 39 (April 1991) 581–587.

    Google Scholar 

  10. M.J. Karol, M.G. Hluchyj and S.P. Morgan, Input versus output queueing on a space-division packet switch, IEEE Transactions on Communications 35(12) (1987) 1347–1356.

    Google Scholar 

  11. S. Li and N. Ansari, Input-queued switching with QoS guarantees, in: Proceedings of IEEE INFOCOM'99, New York, March 1999, pp. 1152–1159.

  12. S. Lu, V. Bharghavan and R. Srikant, Fair scheduling in wireless packet networks, IEEE/ACM Transactions on Networking 7(4) 473–489 (August 1999).

    Google Scholar 

  13. N. McKeown, The iSLIP scheduling algorithm for input-queued switches, IEEE/ACM Transactions on Networking 7(2) (April 1999) 188–201.

    Google Scholar 

  14. N. McKeown, V. Anantharam and J. Walrand, Achieving 100% throughput in an input-queued switch, in: Proceedings of IEEE INFOCOM'96, San Francisco, CA, March 1996, pp. 296–302.

  15. N. McKeown, M. Izzard, A. Mekkittikul, W. Ellersick and M. Horowitz, Tiny tera: A packet switch core, IEEE Micro (January/ February 1997) 26–33.

  16. M.K. Mehmet-Ali and S. Yang, Performance analysis of a random packet selection policy for multicast switching, IEEE Transactions on Communications 44(3) (1996) 388–398.

    Google Scholar 

  17. A. Parekh and R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Transactions on Networking 1(3) (June 1993) 344–357.

    Google Scholar 

  18. C. Partridge, P.P. Carvey, E. Burgess, I. Castineyra, T. Clarke, L. Graham, M. Hathaway, P. Herman, A. King, S. Kohalmi, T. Ma and J. Mcallen, A 50-Gb/s IP router, IEEE/ACM Transactions on Networking 6(3) (June 1998) 237–248.

    Google Scholar 

  19. L.L. Peterson and B.S. Davie, Computer Networks–A System Approach (Morgan Kaufmann, San Francisco, CA, 2000).

    Google Scholar 

  20. M. Pirvu, N. Ni and L.N. Bhuyan, Exploring the switch design space in a CC-NUMA multiprocessor environment, in: Proceedings of International Parallel and Distributed Processing Symposium, Cancun, Mexico, May 2000, pp. 703–710.

  21. B. Prabhakar, N. McKeown and R. Ahuja, Multicast scheduling for input-queued switches, IEEE Journal on Selected Areas in Communications 15(15) (June 1997) 855–866.

    Google Scholar 

  22. D. Serpanos and P. Antoniadis, FIRM: A class of distributed scheduling algorithm for high-speed ATMswitches with multiple input queues, in: Proceedings of IEEE INFOCOM'00, Tel Aviv, Israel, Vol. 2, March 2000, pp. 548–555.

    Google Scholar 

  23. D.C. Stephens and H. Zhang, Implementing distributed packet fair queueing in scalable switch architecture, in: Proceedings of IEEE INFOCOM'98, San Francisco, CA, March 1998, pp. 282–290.

  24. D. Stiliadis and A. Varma, Providing bandwidth guarantees in an input-buffered crosbar switch, in: Proceedings of IEEE INFOCOM'95, Boston, MA, April 1995, pp. 960–968.

  25. H. Zhang, Service displines for guaranteed performance service in packet-switching networks, Proceedings of the IEEE 83 (October 1995) 1374–1396.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Corporation, Austin, TX, 78758, USA

    Nan Ni

  2. Computer Science and Engineering, University of California, Riverside, CA, 92521, USA

    Laxmi N. Bhuyan

Authors
  1. Nan Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laxmi N. Bhuyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nan Ni.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ni, N., Bhuyan, L.N. Fair Scheduling for Input Buffered Switches. Cluster Computing 6, 105–114 (2003). https://doi.org/10.1023/A:1022848304724

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022848304724

Search

Navigation