DMR: A Novel Routing Algorithm in 3D Torus Switching Fabric

  • Guan J
  • Lu X
  • Sun Z
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years 3-D Torus network is widely considered in implementing large scale switching fabrics. Based on analysis of several problems faced in packets routing in 3-D Torus switching fabrics, a novel routing algorithm called DMR (Dimension-order-based Multi-path Routing) is proposed. The DMR algorithm is discussed in detail and it is proved that DMR can achieve high throughput by balancing traffic loads on multiple equivalent paths while maintaining packets order in one TCP flow. The performance of DMR routing algorithm is evaluated using a simulation approach and it is compared with two other representative routing algorithms: e-cube routing and random routing. The simulation results and the analysis are shown afterwards. At last a conclusion is given.

Cite

CITATION STYLE

APA

Guan, J., Lu, X., & Sun, Z. (2005). DMR: A Novel Routing Algorithm in 3D Torus Switching Fabric. In Current Trends in High Performance Computing and Its Applications (pp. 299–303). Springer-Verlag. https://doi.org/10.1007/3-540-27912-1_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free