Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the output selection function (routing policy) affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for a fully adaptive mesh routing algori...

Adaptive Routing is the progression of locating a clear path from a source point to a destination point across a network of nodes that could amend at any point. Mostly, Adaptive Routing algorithms make sure that data packets can move from one point in the network to another, even if one or more nodes in between are unavailable. To overcome the poor delay performance and complexities arise while...

Second generation multicomputers use wormhole routing, allowing a very low channel setup time and drastically reducing the dependency between network latency and internode distance. The network routing can be deterministic or adaptive. In this paper, we present the development and implementation of a fully adaptive routing algorithm. Our work is carried out in a multicomputer with the C104 rout...

This paper describes and evaluates the Confidence-based Dual Reinforcement Q-Routing algorithm (CDRQ-Routing) for adaptive packet routing in communication networks. CDRQ-Routing is based on the Qlearning framework of Q-Routing. The main contribution of this work is the increased quantity and improved quality of exploration in CDRQ-Routing, which lead to faster adaptation and better routing poli...

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

This paper is concerned with Store and Forward deadlocks (DL) arising in interprocessor network systems with buffered packet switched communications. Algorithms which implement DL free routing use adaptive or not adaptive routing modality. Not adaptive algorithms underuse the interconnection network bandwidth because they impose restrictions to the routing paths; adaptive algorithms are DL free...

Network on Chip (NoC) has been proposed as a good solution to achieve better performance and higher efficiency in today's complex systems on chip. Routing in the NoC is a most important challenge. Final performance of NoC largely depends on the underlying routing scheme. In this paper we evaluate three most efficient routing algorithm namely XY, odd-even and DyAD in 2Dmesh network by different ...

InfiniBand is a new standard for communication between processing nodes and I/O devices as well as for interprocessor communication. The InfiniBand Architecture (IBA) supports distributed routing. However, routing in IBA is deterministic because forwarding tables store a single output port per destination ID. This prevents packets from using alternative paths when the requested output port is b...

Chaotic routing [4, 13, 14] is a randomized, nonminimal adaptive routing algorithm for multicomputers. An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around \hot spots." Minimal adaptive routing algorithms have the addition...

InfiniBand is a new standard for communication between processing nodes and I/O devices as well as for interprocessor communication. The InfiniBand Architecture (IBA) supports distributed deterministic routing because forwarding tables store a single output port per destination ID. This prevents packets from using alternative paths when the requested output port is busy. Despite the fact that a...