The IBM RS 6000 SP is one of the most successful commercially available multicomputers. SP owes its success partially to the scalable, high bandwidth, low latency network. This paper describes the architecture of Switch2 switch chip, the recently developed third generation switching element which future IBM RS 6000 SP systems may be based on. Switch2 offers significant enhancements over the exi...

We study adaptive route hoi e models that expli itly apture travelers' route hoi e adjustments a ording to information on realized network onditions in sto hasti time-dependent networks. Two types of adaptive route hoi e models are explored: an adaptive path model where a sequen e of path hoi e models are applied at intermediate de ision nodes; and a routing poli y hoi e model where the alterna...

Recently we have seen an emergent trend of self adaptive routing in both Internet and wireless ad hoc networks. Although there are previous methods for computing the traffic equilibria of self adaptive routing (e.g., selfish routing), these methods use computationally demanding algorithms and require that a precise analytical model of the network be given. Also, it remains an open question how ...

Because of several constraints in ad hoc networks, an adaptive ad hoc routing protocol is increasingly required. In this paper, we propose a synopsis of an adaptation process for an adaptive ad hoc routing protocol. Next, we put into practice the analysis of the process of adaptation to mobility by realizing an adaptive routing protocol: CSR (Cluster Source Routing) which is an extension of a w...

In ad-hoc networks, routing is one of the most important issues, and various protocols are proposed. However, as situations and topologies of an ad-hoc network are various and dynamic, it is difficult for a single fixed protocol to perform well for all occasions. Therefore, some dynamic and adaptive mechanism in routing protocols is necessary. In this paper, we propose an adaptive routing syste...

In this paper, we presented a routing strategy for requests in unstructured peer-to-peer networks. The strategy is based on the adaptive routing Q-routing. The strategy uses reinforcement learning to estimate the cost of routing a request. Such a strategy is scalable only if the routing indices are of reasonable size. We proposed and comparatively evaluated three methods for the pruning for the...

Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present a new selection policy that can be coupled to any adaptive routing algorithm to improve the performance in terms of average delay. The proposed approach introduce the concept of Neighbors-on-Path to exploit the situations of indecision occurring when the routing function returns seve...

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low-dimensional meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is bas...