Skip to main content
SpringerLink
Log in

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

  • Conference paper
Current Trends in High Performance Computing and Its Applications

  • 1134 Accesses

Summary

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coffman, A.G., and A.M. Odlyzko. “Growth of the Internet.” Optical Fiber Telecommunications IV Journal. July 2001

    Google Scholar 

  2. William J. Dally, “Scalable Switching Fabrics for Internet Routers”, http://www.avici.com/technology/whitepapers/TSRfabric-WhitePaper.pdf

    Google Scholar 

  3. Zhigang Sun and Lei Jia “Using MPP Interconnection Network In terabit RouterDesign”, Computer Engineering and Science, June. 2002

    Google Scholar 

  4. J. Bennett, C. Partridge, and N. Shectman. “Packet Reordering is not Pathological Network Behavior”, IEEE/ACM Trans. on Networking, 1999, vol 7, No.6: 789–798

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, National University of Defense Technology, Changsha, 410073, China

    Jianbo Guan, Xicheng Lu & Zhigang Sun

Authors
  1. Jianbo Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xicheng Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhigang Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Engineering and Science, Shanghai University, 200072, Shanghai, People’s Republic of China

    Wu Zhang  & Weiqin Tong  & 

  2. Department of Mathematics, Southern Methodist University, 75275-0156, Dallas, TX, USA

    Zhangxin Chen

  3. Department of Mathematics, University of Houston, 77204-3476, Houston, TX, USA

    Roland Glowinski

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guan, J., Lu, X., Sun, Z. (2005). DMR: A Novel Routing Algorithm in 3D Torus Switching Fabric. In: Zhang, W., Tong, W., Chen, Z., Glowinski, R. (eds) Current Trends in High Performance Computing and Its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27912-1_35

Download citation

Publish with us

Policies and ethics

Search

Navigation