Skip to main content
Log in

Research on Next-Generation Scalable Routers Implemented with H-Torus Topology

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The exponential growth of user traffic has been driving routers to run at higher capacity. In a traditional router, the centralized switching fabric is becoming the bottleneck for its limited number of ports and complicated scheduling algorithms. Direct networks, such as 3-D Torus topology, have been successfully applied to the design of scalable routers. They show good scalability and fault tolerance. Unfortunately, its scalability is limited in practice. In this paper, we introduce another type of direct network, called H-Torus. This network shows excellent topological properties. On its basis, the designs of line card and routing algorithms are introduced. Extensive simulations show that the routing algorithm is very important in such a system and results in low latency with high throughput.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chiussi F M, Francini A. Scalable electronic packet switches. IEEE Journal on Selected Areas in Communications, 2003, 21(4): 486–500.

    Article  Google Scholar 

  2. Marcus M J. The theory of connecting networks and their complexity: A review. IEEE Proceedings, 1977, 65(9): 1263–1271.

    Article  Google Scholar 

  3. Narasimha M J. The Batcher-Banyan self-routing network: Universality and simplification. IEEE Transactions on Communications, 1988, 36(10): 1175–1178.

    Article  Google Scholar 

  4. Benes V. Optimal rearrangeable multistage connecting networks. Bell Systems Technical Journal, 1964, 43(7): 1641–1656.

    MATH  MathSciNet  Google Scholar 

  5. Charles Clos. A study of non-blocking switching networks. Bell System Technical Journal, 1953, 32(2): 406–424.

    Google Scholar 

  6. Chang C S, Lee D S, Jou Y S. Load balanced Birkhoff-Von Neumann switches, part I: One-stage buffering. Computer Communications, 2002, 25(6): 611–622.

    Article  Google Scholar 

  7. Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, David Miller, Mark Horowitz, Olav Solgaard, Nick McKeown. Scaling Internet routers using optics. In Proc. the Special Interest Group on Data Communication (SIGCOMM), ACM Press, 2003, pp.189–200.

  8. McKeown N, Mekkittikul A, Anantharam V, Walrand J. Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications, 1999, 47(8): 1260–1267.

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Dally W J. Scalable Switching Fabrics for Internet Routers. http://www.avici.com/technology/whitepapers/TSRfabric-WhitePaper.pdf.

  11. M M Hafizur Rahman, Yasushi Inoguchi, Susumu Horiguchi. Modified hierarchical 3D-torus network. IEICE Transactions, 2005, 88-D(2): 177–186.

    Article  Google Scholar 

  12. Horiguchi S, Ooki T. Hierarchical 3D-torus interconnection network. In Proc. ISPAN’2000, Richardson, TX, USA, IEEE CS Press, Dec. 2000, pp.50–56.

  13. Zuhui Yue, Youjian Zhao, Jianping Wu, Xiaoping Zhang. LBSR: A load-balanced semiminimal routing algorithm in cellular routers. Lecture Notes in Computer Science, 2006, pp.419–428.

  14. Zuhui Yue, Youjian Zhao, Jianping Wu. CR: Scalable routers based on a new architecture. Journal of Software, October 2007, 18(10): 2624–2634.

    Article  Google Scholar 

  15. Chen M S, Shin K G, Kandlur D D. Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Transactions on Computers, 1990, 39(1): 10–18.

    Article  Google Scholar 

  16. Youjian Zhao, Zuhui Yue, Jianping Wu, Xiaoping Zhang. Topological properties and routing algorithms in cellular router. In Proc. International Conference on Networking and Services, Silicon Valley, CA, USA, 2006, p.101.

  17. Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.

    MATH  Google Scholar 

  18. Sullivan H, Bashkow T R. A large scale, homogeneous, fully distributed parallel machine, I. In Proc. the 4th Annual Symposium on Computer Architecture, Los Alamitos, CA, USA, 1977, pp.105–117.

  19. Valiant L G, Brebner G J. Universal schemes for parallel communication. In Proc. the ACM Symposium on the Theory of Computing, Milwaukee, MN, 1981, pp.263–277.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to You-Jian Zhao.

Additional information

Supported by the National Natural Science Foundation of China under Grant Nos. 90604029 and 60773150, and the National Grand Fundamental Research 973 Program of China under Grant No.2003CB314801.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 78.9 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, YJ., Yue, ZH. & Wu, JP. Research on Next-Generation Scalable Routers Implemented with H-Torus Topology. J. Comput. Sci. Technol. 23, 684–693 (2008). https://doi.org/10.1007/s11390-008-9164-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9164-5

Keywords

Navigation