IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-27912-9_35.html
   My bibliography  Save this book chapter

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

In: Current Trends in High Performance Computing and Its Applications

Author

Listed:
  • Jianbo Guan

    (National University of Defense Technology, School of Computer Science)

  • Xicheng Lu

    (National University of Defense Technology, School of Computer Science)

  • Zhigang Sun

    (National University of Defense Technology, School of Computer Science)

Abstract

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.

Suggested Citation

  • Jianbo Guan & Xicheng Lu & Zhigang Sun, 2005. "DMR: A Novel Routing Algorithm in 3D Torus Switching Fabric," Springer Books, in: Wu Zhang & Weiqin Tong & Zhangxin Chen & Roland Glowinski (ed.), Current Trends in High Performance Computing and Its Applications, pages 299-303, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-27912-9_35
    DOI: 10.1007/3-540-27912-1_35
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-27912-9_35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.