Skip to main content
SpringerLink
Log in

Optimal scaling of average queue sizes in an input-queued switch: an open problem

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We review some known results and state a few versions of an open problem related to the scaling of the total queue size (in steady state) in an n×n input-queued switch, as a function of the port number n and the load factor ρ. Loosely speaking, the question is whether the total number of packets in queue, under either the maximum weight policy or under an optimal policy, scales (ignoring any logarithmic factors) as O(n/(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

  1. Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucumán. Rev, Ser. A 5, 147–151 (1946)

    Google Scholar 

  2. Hajek, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Trans. Inf. Theory 34(5), 910–917 (1988)

    Article  Google Scholar 

  3. Harrison, J. Michael: Brownian models of open processing networks: canonical representation of workload. Ann. Appl. Probab. 10, 75–103 (2000)

    Article  Google Scholar 

  4. McKeown, N., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. In: Proceedings of IEEE Infocom, pp. 296–302 (1996)

    Google Scholar 

  5. Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, New York (1993)

    Google Scholar 

  6. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    Google Scholar 

  7. Neely, M., Modiano, E., Cheng, Y.-S.: Logarithmic delay for n×n packet switches under the cross-bar constraint. IEEE/ACM Trans. Netw. 15(3) (2007)

  8. Shah, D., Tsitsiklis, J.N.: Bin packing with queues. J. Appl. Probab. 45, 922–939 (2008)

    Article  Google Scholar 

  9. Shah, D., Wischik, D.J.: Optimal scheduling algorithms for input-queued switches. In: Proceedings of IEEE Infocom (2006)

    Google Scholar 

  10. Shah, D., Wischik, D.J.: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. (2011, to appear)

  11. Tassiulas, L., Ephremides, A.: Stability properties of constrained queuing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37, 1936–1948 (1992)

    Article  Google Scholar 

  12. von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. Contrib. Theory Games 2, 5–12 (1953)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Devavrat Shah, John N. Tsitsiklis & Yuan Zhong

Authors
  1. Devavrat Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John N. Tsitsiklis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuan Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Devavrat Shah.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shah, D., Tsitsiklis, J.N. & Zhong, Y. Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Syst 68, 375–384 (2011). https://doi.org/10.1007/s11134-011-9234-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-011-9234-1

Keywords

Mathematics Subject Classification (2000)

Search

Navigation