Disjoint Path Routing

Disjoint Path Routing is a routing methodology in torus networks that establishes multiple communication paths between source and destination nodes such that no two paths share any common link or node, thereby enhancing fault tolerance and communication reliability.

88

Publications

4.1K

Citations

210

Authors

97

Institutions

Publications per year

2017–2026

5

Authors

210

  1. SR
    Srinivasan Ramasubramanian

    University of Arizona, United States

    7 publications · 195 citations

    7

    h-index

  2. EM
    Eytan Modiano

    Massachusetts Institute of Technology, United States

    6 publications · 442 citations

    6

    h-index

  3. AB
    Antoine Bossard

    Tokyo University of Agriculture and Technology, Japan

    5 publications · 82 citations

    5

    h-index

  4. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    4 publications · 71 citations

    4

    h-index

  5. TG
    Teresa Gomes

    University of Coimbra, Portugal

    4 publications · 63 citations

    4

    h-index

1–5 of 210

Venues

  1. IEEE/ACM Transactions on Networking

    TON · 5 publications · 436 citations

    5

    h-index

  2. Journal of Network and Computer Applications

    JNCA · 4 publications · 235 citations

    4

    h-index

  3. The Computer Journal

    3 publications · 58 citations

    3

    h-index

  4. 3

    h-index

  5. Journal of Optical Communications and Networking

    JOCN · 2 publications · 24 citations

    2

    h-index

1–5