AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (6.9 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Publishing Language: Chinese | Open Access

Survey on topology of high-performance interconnection networks

Dezun DONG( )Ziyu WANGFei LEI
College of Computer Science and Technology, National University of Defense Technology, Changsha 410073, China
Show Author Information

Abstract

Significance

In recent years, HPC (high-performance computing) has continued to develop rapidly, entering the post-exascale era and steadily advancing toward zettascale computing. With the rapid growth in intelligent computing demand driven by large language model applications, the scale of artificial intelligence data centers has expanded dramatically. High-performance interconnection networks are a key determinant of the scalability of both supercomputing and intelligent computing systems. The interconnection network topology, which defines the connection relationships among nodes, routers, and links, serves as the core of scalability-oriented design. The scalability design of a topology must simultaneously consider cost-effectiveness, high bandwidth, and low network diameter. The Fat-tree topology is the de facto standard in current interconnection networks, providing non-blocking bandwidth under arbitrary traffic patterns and delivering excellent overall performance. However, cost has always been a major constraint in interconnection network design. For zettascale computing and interconnecting systems involving over one hundred thousand accelerators, a non-blocking Fat-tree structure would incur interconnection costs of several billion dollars, which has motivated ongoing exploration in both academia and industry for more cost-efficient network topologies. Topology design is not only constrained by cost, but also by a variety of factors such as router chip architecture, physical packaging density, routing algorithm characteristics, power consumption limits, and fault tolerance. For example, when domestic router chips have limited port counts, constructing a topology that achieves high bandwidth, good scalability, and cost control presents a significant challenge. When the number of virtual channels is limited, implementing adaptive routing algorithms that are easy to deploy, accurate, and provide abundant path diversity is equally difficult. Furthermore, achieving fault tolerance in the face of link or switch failures is also a critical issue. These overlapping engineering constraints significantly increase the complexity of topology design.

Progress

According to their primary application scenarios, topologies can be categorized into three main classes: topologies for distributed data centers, topologies for high-performance parallel computing, and topologies for intelligent computing. Network topologies for distributed data centers mainly include the Fat-tree and its variants, DCell, BCube, and Jellyfish networks, all of which feature high bandwidth, scalability, and strong fault tolerance. Topologies for high-performance parallel computing are primarily high-dimensional Mesh/Torus networks based on low-radix routers, which have smaller bisection bandwidth and lower cost compared with Fat-trees, but suffer from larger network diameter and communication latency. In contrast, high-radix routers, under the constraint of a fixed total router chip bandwidth, can be designed to include a greater number of ports with lower per-port bandwidth. As network scale increases, adopting high-radix routers can significantly reduce network diameter, thereby lowering message transmission latency. Multiple topologies for HPC based on high-radix routers have been proposed, including Flattened Butterfly, Dragonfly, Dragonfly+, the Mesh-Tree topology in China’s Tianhe exascale prototype, Slim Fly, Galaxyfly, Bundlefly, Polarfly, and Polarstar. These topologies are often hierarchical and intra-dimensionally fully connected or constructed based on combinatorial or algebraic graph theory. They exhibit higher Moore-bound efficiency, smaller bisection bandwidth, and lower cost compared with Fat-tree networks, but rely heavily on efficient adaptive routing algorithms to realize their full performance potential — a key factor that limits their large-scale deployment. Topologies for intelligent computing mainly include HammingMesh, Google TPU, Rail-Only, HPN7.0, Zcube, and Zettafly. These networks are characterized by custom structural designs derived from the communication patterns of target applications, achieving optimized performance-to-cost ratios. This paper further summarizes the issues faced by current adaptive routing algorithms in high-radix networks dominated by Dragonfly, including indirect routing inefficiencies, phantom congestion, and asymmetric traffic patterns. It also provides a comprehensive comparison of different topologies in terms of network diameter, scalability, bisection bandwidth, and the size of the non-blocking region. Based on publicly available pricing information, this study models each topology’s per-endpoint copper/optical cable count, port count, cost, and power consumption, ultimately recommending the use of Zcube, Fat-tree, and Zettafly for building small-, medium-, and large-scale interconnection systems, respectively. The paper summarizes the main challenges in topology design, including cost optimization, routing efficiency, scalability, and achieving low network diameter.

Conclusions and Prospects

Finally, the paper outlines future development trends in topology design. These include designing cost-optimal network topologies tailored to specific application characteristics; coordinating topology design with facility-level power delivery constraints; and the unification of intra-node network protocols together with the continual increase in supernode scale, leading to co-designed intra-node and inter-node topologies. In summary, network topology design is an engineering art of balance and compromise. It requires finding optimal solutions among multiple interdependent constraints, such as construction cost, power capacity, router port resource limitations, virtual channel constraints, efficient adaptive routing, and fault tolerance. Neither the lowest-cost topology nor the highest-performance, high-cost topology necessarily represents the optimal choice. The ideal topology should be highly aligned with the characteristics of its running applications, combining cost efficiency with sound design principles while maintaining simplicity in understanding, packaging, and deployment, and ensuring high manageability, stability, and reliability at the operational level.

CLC number: TP303 Document code: A Article ID: 1001-2486(2026)02-266-18

References

【1】
【1】
 
 
Journal of National University of Defense Technology
Pages 266-283

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
DONG D, WANG Z, LEI F. Survey on topology of high-performance interconnection networks. Journal of National University of Defense Technology, 2026, 48(2): 266-283. https://doi.org/10.11887/j.issn.1001-2486.25110046

526

Views

12

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 25 November 2025
Published: 01 April 2026
© 2026 Journal of National University of Defense Technology

This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).