Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...

In order to use WDM networks efficiently and effectively, a lightpath is dynamically established upon the arrival of a connection request. The dynamic routing algorithms are usually classified into adaptive and alternative schemes based on whether the chosen routes are predetermined or not. In this work, we propose a new weighted function for link cost assignments. The purpose of the cost funct...

An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that can be used for any adaptive or nonadaptive routing algorithm for wormhole routing, as long as on...

| Chaotic routers are randomizing, non-minimal adaptive packet routers designed for use in the communication networks of parallel computers. Chaotic routers combine the exibility found in adaptive routing with a design simple enough to be competitive with the most streamlined oblivious routers. We review chaotic routing and compare it with other contemporary network routing approaches, includin...

in a mobile ad hoc network, there are some features such as the ability to exploit multipath effect for information exchange with high reliability and low error rate. dealing with the aggressors and discovering the path in data transmission are of importance. approaching these goals ends in network promotion and efficiency. in this paper, the designed protocol is able to discover multipath fo...

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

We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...

In this paper, we propose an adaptive geographic routing protocol, which is composed of two routing protocols. According to the topology of the network, the adaptive geographic routing protocol can select a suitable protocol to route a packet around a hole in the sensor network. Experimental results show that the adaptive geographic routing protocol can route a packet in a suitable path and sho...

Adaptive routing is widely regarded as a promising approach to improving interconnection network performance. Many designers of adaptive routing algorithms have used synthetic communication patterns, such as uniform and transpose traffic, to compare the performance of various adaptive routing algorithms with each other and with oblivious routing. These comparisons have shown that the average me...