Fat-tree Networks

Fat-Tree Networks is a hierarchical, scalable interconnection network topology that belongs to the class of tree-based network architectures and is distinguished by its provision of increasing bandwidth in higher-level links to prevent congestion, thereby emulating a full-tree bisection bandwidth while maintaining cost-effectiveness.

250

Publications

10.8K

Citations

671

Authors

238

Institutions

Publications per year

2017–2026

62

Authors

671

  1. AB
    Abhinav Bhatelé

    Lawrence Livermore National Laboratory, United States

    9 publications · 228 citations

    9

    h-index

  2. NJ
    Nikhil Jain

    Lawrence Livermore National Laboratory, United States

    8 publications · 212 citations

    8

    h-index

  3. YY
    Yuanyuan Yang

    Stony Brook University, United States

    7 publications · 195 citations

    7

    h-index

  4. CM
    Cyriel Minkenberg

    IBM Research - Zurich, Switzerland

    7 publications · 158 citations

    7

    h-index

  5. JD
    J. Duato

    Universitat Politècnica de València, Spain

    7 publications · 293 citations

    7

    h-index

1–5 of 671

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 11 publications · 216 citations

    11

    h-index

  2. arXiv (Cornell University)

    Repository · 6 publications · 472 citations

    6

    h-index

  3. Journal of Optical Communications and Networking

    JOCN · 5 publications · 167 citations

    5

    h-index

  4. ACM SIGMETRICS Performance Evaluation Review

    PER · 4 publications · 45 citations

    4

    h-index

  5. IEEE Transactions on Computers

    4 publications · 1.4K citations

    4

    h-index

1–5