This paper proposes a new analytical model to predict message latency in k-ary n-cubes with compressionless routing, a fully adaptive algorithm that uses ...

As mentioned earlier, adaptive routing algorithms obtain better performance in congested networks due to using alternative routing paths [22] [23] . This can be ...

Khonsari, A. and Ould-Khaoua, M. (2006) A performance model of compressionless routing in k-ary n-cube networks. Performance Evaluation, 63, pp. 423-440.

This paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good ...

A performance model of compressionless routing in k-ary n-cube networks. Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/pe/KhonsariO06.

Flash Routing provides an efficient strategy to significantly reduce End-to-End Delays in k-ary n-cubes. The algorithm is based on the observation that, in such ...

The new algorithm, called rHALB (r Hop Aware Load-Balanced) routing algorithm, can efficiently balance traffic loads in k-ary n-cube networks. It is based on ...

Compression/ess. Routing. (CR), is a new adaptive routing framework which supports both adaptive and fault-tolerant routing for a wide variety of network.

A description of the routing algorithms, implementation complexity, and performance is presented. The advantages of Compressionless Routing are: Deadlock-free ...

The results show that rHALB achieves a better performance (latency and throughput) under various traffic patterns than dimension order routing and Duato's ...