Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering

Published: 01 April 2002 Publication History

Abstract

Motivated by the need for a simple and high performance switch architecture that scales up with the speed of fiber optics, we propose a switch architecture with two-stage switching fabrics and one-stage buffering. The first stage performs load balancing, while the second stage is a Birkhoff-von Neumann input-buffered switch that performs switching for load balanced traffic. Such a switch is called the load balanced Birkhoff-von Neumann switch in this paper. The on-line complexity of the switch is O(1). It is shown that under a mild technical condition on the input traffic, the load balanced Birkhoff-von Neumann switch achieves 100% throughput as an output-buffered switch for both unicast and multicast traffic with fan-out splitting. When input traffic is bursty, we show that load balancing is very effective in reducing delay, and the average delay of the load balanced Birkhoff-von Neumann switch is proven to converge to that of an output-buffered switch under heavy load. Also, by simulations, we demonstrate that load balancing is more effective than the conflict resolution algorithm, i-SLIP, in heavy load. When both the load balanced Birkhoff-von Neumann switch and the corresponding output-buffered switch are allocated with the same finite amount of buffer at each port, we also show that the packet loss probability in the load balanced Birkhoff-von Neumann switch is much smaller than that in an output-buffered switch, when the buffer is large.

References

[1]
Anderson, T., Owicki, S., Saxes, J. and Thacker, C., High speed switch scheduling for local area networks. ACM Trans. Comput. Syst. v11. 319-352.
[2]
Baccelli, F. and Bremaud, P., . 1994. Springer, New York.
[3]
Birkhoff, G., Tres observaciones sobre el algebra lineal. Univ. Nac. Tucumán Rev. Ser. A. v5. 147-151.
[4]
Chang, C.S., . 2000. Springer, London.
[5]
C.S. Chang, W.J. Chen, H.Y. Huang, On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann, IEEE IWQoS'99, London, UK, 1999 (US patent pending), pp. 79-86.
[6]
C.S. Chang, W.J. Chen, H.Y. Huang, Birkhoff-von Neumann input buffered crossbar switches, IEEE INFOCOM2000, Tel Aviv, Israel, 2000, pp. 1614-1623.
[7]
Chang, C.S., Lee, D.S. and Lien, C.M., Load balanced Birkhoff-von Neumann Switches, Part II: multi-stage buffering. Comput. Commun.
[8]
A. Charny, P. Krishna, N. Patel, R. Simcoe, Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup, IEEE IWQoS'98, Napa, CA, 1998, pp. 235-244.
[9]
Long-tail buffer-content distributions in broadband networks. Performance Evaluation. v30. 177-190.
[10]
S.-T. Chuang, A. Goel, N. McKeown, B. Prabhkar, Matching output queueing with a combined input output queued switch, IEEE INFOCOM'99, New York, 1999, pp. 1169-1178.
[11]
C. Diot, personal communication.
[12]
Clos, C., A study of nonblocking switching networks. BSTJ. v32. 406
[13]
A. Demers, S. Keshav, S. Shenkar, Analysis and simulation of a fair queueing algorithm, Proceedings of SIGCOMM'89, Austin, TX, September 1989, pp. 1-12.
[14]
Hui, J., . 1990. Kluwer Academic Publishers, Boston.
[15]
A. Hung, G. Kesidis, N. McKeown, ATM input-buffered switches with guaranteed-rate property, Proceedings of IEEE ISCC'98, Athens, 1998, pp. 331-335.
[16]
Subexponential asymptotics of a Markov-modulated random walk with queueing applications. J. Appl. Prob.
[17]
Leland, W.E., Taqqu, M.S., Willinger, W. and Wilson, D.V., On the self-similar nature of ethernet traffic. IEEE/ACM Trans. Networking. v2. 1-15.
[18]
I. Keslassy, N. McKeown, Maintaining packet order in two-stage switches, preprint, 2001.
[19]
P. Krishna, N.S. Patel, A. Charny, R. Simcoe, On the speedup required for work-conserving crossbar switches, IEEE IWQoS'98, Napa, CA, 1998, pp. 225-234.
[20]
Lee, T.T. and Lam, C.H., Path switching-a quasi-static routing scheme for large scale ATM packet switches. IEEE J. Sel. Areas Commun. v15. 914-924.
[21]
S. Li, N. Ansari, Input-queued switching with QoS guarantees, IEEE INFOCOM'99, New York, 1999, pp. 1152-1159.
[22]
N. McKeown, Scheduling algorithms for input-queued cell switches, PhD Thesis, University of California at Berkeley, 1995.
[23]
N. McKeown, V. Anantharam, J. Walrand, Achieving 100% throughput in an input-queued switch, Proceedings of IEEE INFOCOM'96, 1996, pp. 296-302.
[24]
A. Mekkittikul, N. McKeown, A practical scheduling algorithm to achieve 100% throughput in input-queued switches, Proceedings of IEEE INFOCOM'98.
[25]
Mitra, D. and Cieslak, R.A., Randomized parallel communications on an extension of the omega network. J. Assoc. Comput. Machinery. v34 i4. 802-824.
[26]
Nadkarni, M.G., . 1998. Birkhaüser, Berlin.
[27]
Parekh, A.K. and Gallager, R.G., A generalized processor sharing approach to flow control in integrated service networks: the single-node case. IEEE/ACM Trans. Networking. v1. 344-357.
[28]
Petersen, K., . 1983. Cambridge University Press, Cambridge.
[29]
Schwartz, M., . 1996. Prentice-Hall, Englewood Cliffs, NJ.
[30]
D. Stiliadis, A. Varma, Providing bandwidth guarantees in an input-buffered crossbar switch, Proceedings of IEEE INFOCOM'95, 1995, pp. 960-968.
[31]
I. Stoica, H. Zhang, Exact emulation of an output queueing switch by a combined input output queueing switch, IEEE IWQoS'98, Napa, CA, 1998, pp. 218-224.
[32]
Stoyan, D., . 1983. Wiely, Berlin.
[33]
Valiant, L.G., A scheme for fast parallel communication. SIAM J. Comput. v11 i2. 350-361.
[34]
von Neumann, J., A certain zero-sum two-person game equivalent to the optimal assignment problem. 1953. Contributions to the Theory of Games, 1953.Princeton University Press, Princeton, NJ.

Cited By

View all
  • (2024)Realizing RotorNet: Toward Practical Microsecond Scale Optical NetworkingProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672273(392-414)Online publication date: 4-Aug-2024
  • (2022)Optimal oblivious reconfigurable networksProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520020(1339-1352)Online publication date: 9-Jun-2022
  • (2021)Low-Complexity Switch Scheduling Algorithms: Delay Optimality in Heavy TrafficIEEE/ACM Transactions on Networking10.1109/TNET.2021.311660630:1(464-473)Online publication date: 8-Oct-2021
  • Show More Cited By
  1. Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Computer Communications
    Computer Communications  Volume 25, Issue 6
    April, 2002
    90 pages

    Publisher

    Elsevier Science Publishers B. V.

    Netherlands

    Publication History

    Published: 01 April 2002

    Author Tags

    1. Input-buffered switches
    2. Load balancing
    3. Performance analysis
    4. Scheduling
    5. Stability

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 23 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Realizing RotorNet: Toward Practical Microsecond Scale Optical NetworkingProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672273(392-414)Online publication date: 4-Aug-2024
    • (2022)Optimal oblivious reconfigurable networksProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520020(1339-1352)Online publication date: 9-Jun-2022
    • (2021)Low-Complexity Switch Scheduling Algorithms: Delay Optimality in Heavy TrafficIEEE/ACM Transactions on Networking10.1109/TNET.2021.311660630:1(464-473)Online publication date: 8-Oct-2021
    • (2019)ShoalProceedings of the 16th USENIX Conference on Networked Systems Design and Implementation10.5555/3323234.3323256(255-270)Online publication date: 26-Feb-2019
    • (2019)A Split-Central-Buffered Load-Balancing Clos-Network Switch With In-Order ForwardingIEEE/ACM Transactions on Networking10.1109/TNET.2018.288374727:2(467-476)Online publication date: 1-Apr-2019
    • (2018)Safe Randomized Load-Balanced Switching by Diffusing Extra LoadsACM SIGMETRICS Performance Evaluation Review10.1145/3292040.321967346:1(135-137)Online publication date: 12-Jun-2018
    • (2018)Safe Randomized Load-Balanced Switching by Diffusing Extra LoadsAbstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems10.1145/3219617.3219673(135-137)Online publication date: 12-Jun-2018
    • (2018)An Adaptive Scheduling Algorithm for Multi-Priority Traffic in Load-Balanced SwitchProceedings of the 1st International Conference on Information Science and Systems10.1145/3209914.3226167(200-203)Online publication date: 27-Apr-2018
    • (2018)Global Round RobinIEEE/ACM Transactions on Networking10.1109/TNET.2018.286953226:5(2230-2241)Online publication date: 1-Oct-2018
    • (2017)Safe Randomized Load-Balanced Switching By Diffusing Extra LoadsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31544871:2(1-37)Online publication date: 19-Dec-2017
    • Show More Cited By

    View Options

    View options

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media