Skip to main content

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

  • Conference paper
Information Networking. Advances in Data Communications and Wireless Networks (ICOIN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3961))

Included in the following conference series:

Abstract

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.

This work was supported in part by grants 863-2005AA112132 and 973-2003CB314801.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chiussi, F.M., Francini, A.: Scalable Electronic Packet Switches. IEEE Journal on Selected Areas in Communications 21(4), 486–499 (2003)

    Article  Google Scholar 

  2. Marcus, M.: The Theory of Connecting Networks and Their Complexity: a Review. IEEE Proceedings 65(9), 1263–1271 (1977)

    Article  Google Scholar 

  3. Wu, C.-L., Feng, T.-Y.: On a Class of Multistage Interconnection Networks. IEEE Trans. On Computers 29(8), 694–702 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Benes, V.: Optimal Rearrangeable Multistage Connecting Networks. Bell Systems Technical Journal 43(7), 1641–1656 (1964)

    MATH  MathSciNet  Google Scholar 

  5. Clos, C.: A Study of Non-blocking Switching Networks. Bell System Technical Journal 32(2), 406–424 (1953)

    Google Scholar 

  6. Jajszczyk, A.: Nonblocking, Repackable, and Rearrangeable Clos Networks: Fifty Years of the Theory Evolution. IEEE Communications Magazine 41(10), 28–33 (2003)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. McKeown, N.W., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. IEEE Trans. Comm. 47(8), 1260–1267 (1999)

    Article  Google Scholar 

  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. 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. Pfister, G.: An Introduction to the InfiniBand Arechitecture. IEEE Press, Los Alamitos (2001), http://www.infinibadta.org

    Google Scholar 

  13. Dally, W.J.: Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers 39(6), 775–785 (1990)

    Article  Google Scholar 

  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. Available at: http://www.avici.com/products/tsr.shtml

  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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yue, Z., Zhao, Y., Wu, J., Zhang, X. (2006). LBSR: A Load-Balanced Semiminimal Routing Algorithm in Cellular Routers. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_42

Download citation

  • DOI: https://doi.org/10.1007/11919568_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48563-6

  • Online ISBN: 978-3-540-48564-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics