LBSR: A Load-Balanced Semiminimal Routing Algorithm in Cellular Routers

  • Zuhui Yue
  • Youjian Zhao
  • Jianping Wu
  • Xiaoping Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3961)


In the Internet, the exponential growth of user traffic is driving routers to run at increasing bit-rates and have a very large number of ports. Traditional routers consist of line cards and centralized switching fabrics. However, in such a router, the centralized switching fabric is becoming the bottleneck for its limited ports and complicated scheduling algorithms. Interconnection networks, such as 3-D Torus topology, have been applied to routers. They show excellent scalability and fault tolerance. Unfortunately its scalability is limited in practice. In this paper, we propose a novel architecture called Cellular Router (CR) and give a simple discussion of this architecture. We introduce a load-balanced semiminimal routing algorithm (LBSR) for CRs. This algorithm makes use of path diversity and shows high throughput on tornado and random traffic patterns. We also discuss some other aspects of this algorithm, such as dropping ratio, effects of queue length and speedup.


Destination Node Queue Length Interconnection Network Edge Node Path Diversity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chiussi, F.M., Francini, A.: Scalable Electronic Packet Switches. IEEE Journal on Selected Areas in Communications 21(4), 486–499 (2003)CrossRefGoogle Scholar
  2. 2.
    Marcus, M.: The Theory of Connecting Networks and Their Complexity: a Review. IEEE Proceedings 65(9), 1263–1271 (1977)CrossRefGoogle Scholar
  3. 3.
    Wu, C.-L., Feng, T.-Y.: On a Class of Multistage Interconnection Networks. IEEE Trans. On Computers 29(8), 694–702 (1980)MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Benes, V.: Optimal Rearrangeable Multistage Connecting Networks. Bell Systems Technical Journal 43(7), 1641–1656 (1964)MATHMathSciNetGoogle Scholar
  5. 5.
    Clos, C.: A Study of Non-blocking Switching Networks. Bell System Technical Journal 32(2), 406–424 (1953)Google Scholar
  6. 6.
    Jajszczyk, A.: Nonblocking, Repackable, and Rearrangeable Clos Networks: Fifty Years of the Theory Evolution. IEEE Communications Magazine 41(10), 28–33 (2003)CrossRefGoogle Scholar
  7. 7.
    Chang, C.-S., Lee, D.-S., Jou, Y.-S.: Load balanced Birkhoff-von Neumann switches, Part I: one-stage buffering. Computer Comm. 25, 611–622 (2002)CrossRefGoogle Scholar
  8. 8.
    Keslassy, I., Chuang, S.-T., Yu, K., Miller, D., Horowitz, M., Solgaard, O., McKeown, N.: Scaling Internet Routers Using Optics. In: ACM SIGCOMM, Karlsruhe, Germany (August 2003)Google Scholar
  9. 9.
    McKeown, N.W., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. IEEE Trans. Comm. 47(8), 1260–1267 (1999)CrossRefGoogle Scholar
  10. 10.
    Mekkittikul, A., McKeown, N.W.: A Starvation-free Algorithm for Achieving 100% Throughput in an Input-Queued Switch. In: Proc. ICCCN 1996, October 1996, pp. 226–231 (1996)Google Scholar
  11. 11.
    Scott, S., Thorson, G.: The cray t3e network: adaptive routing in a high performance 3d torus. In: Proceedings of Hot Interconnects Symposium IV (August 1996)Google Scholar
  12. 12.
    Pfister, G.: An Introduction to the InfiniBand Arechitecture. IEEE Press, Los Alamitos (2001), Google Scholar
  13. 13.
    Dally, W.J.: Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers 39(6), 775–785 (1990)CrossRefGoogle Scholar
  14. 14.
    Dally, W., Carvey, P., Dennison, L.: Architecture of the avici terabit switch/router. In: Proceedings of Hot Interconnects Symposium VI, August 1998, pp. 41–50 (1998)Google Scholar
  15. 15.
  16. 16.
    Yue, Z., Zhao, Y., Wu, J., Zhang, X.: Designing Scalable Routers with a New Switching Architecture. In: Joint International Conference, ICAS-ICNS 2005, October 23-28, p. 1 (2005)Google Scholar
  17. 17.
    Sullivan, H., Bashkow, T.R.: A large scale, homogeneous, fully distributed parallel machine. In: Proc. of the International Symposium on Computer Architecture, pp. 105–117 (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zuhui Yue
    • 1
  • Youjian Zhao
    • 1
  • Jianping Wu
    • 1
  • Xiaoping Zhang
    • 1
  1. 1.Department of Computer ScienceTsinghua UniversityBeijingP.R. China

Personalised recommendations