Several studies have shown that the performance advantages of adaptive routing over deterministic routing are reduced when the traffic contains strong degree of communication locality. This paper proposes a new analytical model of an adaptive routing algorithm proposed by Duato in [Dua94]. The main feature of this algorithm is the use of a time-out selection function for assigning virtual chann...

Swarm intelligence forms the core of a new class of algorithms inspired by the social behavior of insects that live in swarms. Its attractive features include adaptation, robustness and a distributed, decentralized nature, rendering swarm-based algorithms well-suited for routing in wireless or satellite networks, where it is difficult it implement centralized network control. We propose one suc...

Several unicast routing protocols have been presented for unicast traffic in MPSoCs. Exploiting the unicast routing algorithms for multicast traffic increases the likelihood of deadlock and congestion. In order to avoid deadlock for multicast traffic, the Hamiltonian path strategy was introduced. The traditional Hamiltonian path routing protocols supporting both unicast and multicast traffic ar...

This paper proposes a metric self-adaptive routing scheme for Mobile Ad Hoc Networks (MANET). By applying the proposed model, each node is able to detect whether the mobility states of the network is relatively static or mobile without the support of the Global Positioning System (GPS). The mobility state detection model is designed based on an indicator named MSI (for proactive routing) or GMS...

A new adaptive RWA (Routing and Wavelength Assignment) algorithm is proposed, which may be used in photonic networks with no wavelength conversion. The problem we address is how to increase the utilization of WDM network resources by taking account of future demand efficiently. In the proposed method, blocking probability is minimized by taking account of future path establishment, using a meth...

In this paper we study the performance of several routing algorithms for optical burst switching network. The main aim is to find ways for performing dynamic load balancing and reduce congestion situation. In our analysis, we consider a common network scenario and, as a performance reference, we use the simple shortest path routing giving results of both analytical and simulation models. Theref...

Deterministic and adaptive distributed routing algorithms have been advocated in all the current NoC architectural proposals. In this paper we make a case for the use of source routing for NoCs, especially for regular topologies like mesh. The advantages of source routing include in-order packet delivery; faster and simpler router design; and possibility of mixing non-minimal paths in a mainly ...

Fire fighters often work in dangerous and dynamic environments, which results in frequent change of network topologies and routing requirements. While the existing routing protocols are not able to cope with such a changeable environment, this paper proposes a self adaptive hybrid routing algorithm. This routing algorithm can switch between the proactive routing algorithm and reactive routing a...

We describe and evaluate an energy-efficient protocol for routing traffic in frequency-hop (FH) store-and-forward packet radio networks that employ an adaptive transmission protocol. The adaptive transmission protocol allows the radios to adjust the power in the transmitted signal and the rate of a Reed-Solomon code to respond to variations in partial-band interference and propagation loss. Rou...

In adaptive query processing, query plans are improved at runtime by means of feedback. In the very flexible approach based on so-called eddies, query execution is treated as a process of routing tuples to the query operators that combine to compute a query. This makes it possible to alter query plans at the granularity of tuples. Further, the complex task of searching the query plan space for ...