Journal of Computer Science and Technology

, Volume 23, Issue 4, pp 684–693 | Cite as

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

  • You-Jian ZhaoEmail author
  • Zu-Hui Yue
  • Jian-Ping Wu
Short Paper


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.


router switch fabric direct network H-Torus routing algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2008_9164_MOESM1_ESM.pdf (79 kb)
(PDF 78.9 kb)


  1. [1]
    Chiussi F M, Francini A. Scalable electronic packet switches. IEEE Journal on Selected Areas in Communications, 2003, 21(4): 486–500.CrossRefGoogle Scholar
  2. [2]
    Marcus M J. The theory of connecting networks and their complexity: A review. IEEE Proceedings, 1977, 65(9): 1263–1271.CrossRefGoogle Scholar
  3. [3]
    Narasimha M J. The Batcher-Banyan self-routing network: Universality and simplification. IEEE Transactions on Communications, 1988, 36(10): 1175–1178.CrossRefGoogle Scholar
  4. [4]
    Benes V. Optimal rearrangeable multistage connecting networks. Bell Systems Technical Journal, 1964, 43(7): 1641–1656.zbMATHMathSciNetGoogle Scholar
  5. [5]
    Charles Clos. A study of non-blocking switching networks. Bell System Technical Journal, 1953, 32(2): 406–424.Google Scholar
  6. [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.CrossRefGoogle Scholar
  7. [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.Google Scholar
  8. [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.CrossRefGoogle Scholar
  9. [9]
    Dally W J. Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers, 1990, 39(6): 775–785.CrossRefGoogle Scholar
  10. [10]
    Dally W J. Scalable Switching Fabrics for Internet Routers.
  11. [11]
    M M Hafizur Rahman, Yasushi Inoguchi, Susumu Horiguchi. Modified hierarchical 3D-torus network. IEICE Transactions, 2005, 88-D(2): 177–186.CrossRefGoogle Scholar
  12. [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.Google Scholar
  13. [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.Google Scholar
  14. [14]
    Zuhui Yue, Youjian Zhao, Jianping Wu. CR: Scalable routers based on a new architecture. Journal of Software, October 2007, 18(10): 2624–2634.CrossRefGoogle Scholar
  15. [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.CrossRefGoogle Scholar
  16. [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.Google Scholar
  17. [17]
    Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.zbMATHGoogle Scholar
  18. [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.Google Scholar
  19. [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.Google Scholar

Copyright information

© Springer 2008

Authors and Affiliations

  1. 1.Department of Computer ScienceTsinghua UniversityBeijingChina

Personalised recommendations