Development of wormhole routing tech niques so far has been largely independent of the re sults available for store and forward routing in litera ture In this paper we provide a general result which enables us to design deadlock free wormhole routing algorithms from store and forward routing algorithms that satisfy certain criteria We illustrate this re sult by developing fully adaptive deadloc...

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 additiona...

In mobile ad hoc networks, most of the present routing protocols are designed to have congestion aware, but not congestion adaptive. The way in which the congestion is handled results in longer delay and more packets to be lost for streaming multimedia. When a new route is needed, the routing protocols require a significant overhead in finding it. Mobile Ad hoc Networks shows unexpected behavio...

The Tori-connected mESH (TESH) Network is a k-ary n-cube networks of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level k-ary n-cube networks. Many adaptive routing algorithms for k-ary n-cube networks have already been proposed. Thus, those algorithms can also be applied to TESH network. We have proposed three adaptiv...

Increasing size, complexity, and dynamics of networks require adaptive routing mechanisms. This paper proposes initial concepts towards a learning and generalization mechanism to support adaptive real-time routing. An ASOCS learning model is employed as the basic adaptive router. Generalization of routing is based not only on source/destination address, but also on such factors as packet size, ...

Improvement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms are compared with the well-known e-cube algorithm for uniform, hotspot, and local traac patterns. Our simulations indicate that the partially ad...