Virtual Cut-through Routing

Virtual Cut-Through Routing is a routing algorithm that belongs to the class of store-and-forward routing methods, distinguished by its use of buffer allocation at intermediate nodes only when the next hop is available, thereby reducing latency compared to traditional store-and-forward routing while avoiding the deadlock risks of pure cut-through routing.

44

Publications

3.4K

Citations

121

Authors

47

Institutions

Publications per year

2017–2026

1

Authors

121

  1. JD
    J. Duato

    Universitat Politècnica de València, Spain

    8 publications · 545 citations

    8

    h-index

  2. RB
    R. Beivide

    Universidad de Cantabria, Spain

    4 publications · 181 citations

    4

    h-index

  3. KG
    Kang G. Shin

    University of Michigan, United States

    4 publications · 97 citations

    4

    h-index

  4. JF
    José Flich

    Universitat Politècnica de València, Spain

    3 publications · 42 citations

    3

    h-index

  5. TM
    Timothy M. Pinkston

    University of Southern California, United States

    3 publications · 182 citations

    3

    h-index

1–5 of 121

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 491 citations

    8

    h-index

  2. IEEE Transactions on Computers

    6 publications · 280 citations

    6

    h-index

  3. Journal of Parallel and Distributed Computing

    2 publications · 52 citations

    2

    h-index

  4. 1

    h-index

  5. IEEE Journal of Solid-State Circuits

    1 publications · 390 citations

    1

    h-index

1–5