Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s11390-008-9164-5 | J. Comput. Sci. Technol. |
Keywords | Field | DocType |
good scalability,complicated scheduling algorithm,routing algorithm,3-d torus topology,exponential growth,direct network,h-torus,router,scalable routers,next-generation scalable,h-torus topology,switch fabric,excellent topological property,centralized switching fabric,limited number,scheduling algorithm,fault tolerant,high throughput,low latency | Convergence (routing),Bottleneck,Computer science,Routing domain,Computer network,Real-time computing,Throughput,Distributed computing,Topology,Line card,Router,Scalability,Routing protocol | Journal |
Volume | Issue | ISSN |
23 | 4 | 1860-4749 |
Citations | PageRank | References |
2 | 0.40 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Youjian Zhao | 1 | 273 | 32.53 |
| Zuhui Yue | 2 | 8 | 1.57 |
| Jianping Wu | 3 | 743 | 121.01 |