作者: W. A. Najjar , D. R. Miller
关键词:
摘要: This paper addresses the issue of how router complexity affects overall performance in deterministic and adaptive routing under virtual cut-through switching k-ary n-cube networks. First, various routers with constant area are compared. Second, compared same conditions. Finally, it is shown that, certain conditions, can reach saturation points comparable to routers.