Skip to main content
SpringerLink
Log in

Scheduling Protocols for Switches with Large Envelopes

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Traditionally, switches make scheduling decisions on the granularity of a packet. However, this is becoming increasingly difficult since network bandwidth is growing rapidly whereas packet sizes remain largely unchanged. Therefore the service time of an individual packet is decreasing rapidly. In this paper we study switches that make scheduling decisions on the granularity of an envelope which can be much larger than a packet in size.

For an output-queued switch with envelope size E, each output chooses one input every E time steps and transmits packets from this chosen input during the next E steps. For an input-queued switch with envelope size E, one matching from the inputs to the outputs is computed every E steps and only the input–output pairs that are defined by this matching are allowed to transmit packets during the next E steps. Traditional switches correspond to envelope size E = 1 and almost all previous scheduling work deals with this case exclusively.

We first show how some stable protocols for scheduling networks of output-queued switches with E = 1 fail for arbitrary E when these protocols are generalized in the most straightforward manner. We then present an extremely simple protocol that does guarantee network stability for output-queued switches for any E ≥ 1.

For input-queued switches we first present a max-weight matching protocol that is stable for a single switch with arbitrary E. We then present a more complex protocol that achieves stability for a network of input-queued switches for any E ≥ 1.

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

  • Anderson, T. E., S. S. Owicki, J. B. Saxe, and C. P. Thacker, “High-speed switch scheduling for local-area networks,” ACM Trans. Comput. Syst., 11(4), 319–352 (1993).

    Article  Google Scholar 

  • Andrews, M. and L. Zhang, “Stability results for networks with input and output blocking,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, May 1998, pp. 369–377.

  • Andrews, M. and L. Zhang, “Achieving stability in networks of input-queued switches,” in Proceedings of IEEE INFOCOM '01, Anchorage, Alaska, April 2001.

  • Andrews, M., B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu, “Universal stability results and performance bounds for greedy contention-resolution protocols,” J. ACM, 48(1), 39–69 (2001).

    Article  Google Scholar 

  • Birkhoff, G., “Tres observaciones sobre el algebra lineal,” Univ. Nac. Tucumán Rev. Ser. A5, 147–150 (1946).

    Google Scholar 

  • Borodin, A., J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson, “Adversarial queueing theory,” J. ACM, 48(1), 13–38 (2001).

    Article  Google Scholar 

  • Chuang, S., A. Goel, N. W. McKeown, and B. Prabhakar, “Matching output queueing with a combined input output queued switch,” in Proceedings of IEEE INFOCOM '99, New York, NY, March 1999, pp. 1169–1178.

  • Kahale, N. and P. E. Wright, “Dynamic global packet routing in wireless networks,” in Proceedings of IEEE INFOCOM '97, Kobe, Japan, April 1997.

  • Kar, K., T. V. Lakshman, D. Stiliadis, and L. Tassiulas, “Reduced complexity input buffered switches,” in Proceedings of HOT Interconnects VIII, Stanford University, Stanford, CA, August 2000.

    Google Scholar 

  • McKeown, N. W., 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.

  • McKeown, N. W., P. Varaiya, and J. Walrand, “Scheduling cells in an input-queued switch,” Electron. Lett. 29(25), 2174–2175 (1993).

    Article  Google Scholar 

  • Mekkittikul A. and N. W. McKeown, “A practical algorithm to achieve 100% throughput in input-queued switches,” in Proceedings of IEEE INFOCOM '98, San Francisco, CA, March 1998.

  • National Laboratory for Applied Network Research, Passive measurement and analysis. http://moat.nlanr.net/PMA/.

  • Stoica I. and H. Zhang, “Exact emulation of an output queueing switch by a combined input output queueing switch,” in Proceedings of the 6th International Workshop on Quality of Service, Napa, CA, 1998, pp. 218–224.

Download references

Author information

Authors and Affiliations

  1. Bell Labs, 600 Mountain Avenue, Murray Hill, NJ, 07974

    Matthew Andrews & Lisa Zhang

Authors
  1. Matthew Andrews
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lisa Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthew Andrews.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andrews, M., Zhang, L. Scheduling Protocols for Switches with Large Envelopes. J Sched 7, 171–186 (2004). https://doi.org/10.1023/B:JOSH.0000019679.68869.e8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOSH.0000019679.68869.e8

Search

Navigation