Empirical Evaluation of Deterministic and Adaptive Routing with Constant-Area Routers

This paper addresses the issue of how router complexity a ects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube networks. First, the performance of various adaptive routers with constant area are compared. Second, the performance of adaptive and deterministic routers are compared under the same conditions. Finally, it is shown that, under certain conditions, deterministic routers can reach saturation points comparable to adaptive routers.

• Type: Conference
• Year: 1997
• Where: IEEEPACT
• Authors: Dianne Miller, Walid A. Najjar
• Keywords: Adaptive Routers, Deterministic Routers, Distributed And Parallel Computing, IEEEPACT 1997, Various Adaptive Routers