The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...

A number of new Clos data center networking fabrics have been proposed recently by using commodity offthe-shelf hardware. In Clos networks, randomized routing is typically used to achieve load balance. However, with typical communication patterns, pure randomized routing design cannot fully exploit bandwidth provided by Clos topologies. This paper strives to evaluate the performance of both ran...

Because of the energy load imbalance of cluster nodes in wireless sensor networks, this causes cluster heads tend to die earlier in the case of more tasks and routing problem such as larger energy loss, so an adaptive energy optimization clustering routing algorithm is proposed. The node residual energy and distance are taken into full consideration by the measure coefficient on the cluster-hea...

The explosive growth and heterogeneous nature of Internet demands \smart" tools to automate the connguration and management process. Online simulation is our approach to provide such a tool. The goal is to apply online simulation to tune routing protocol parameters, that is, to set parameters in the link cost function to values that achieve improved performance and stability. Simulation results...

We address the problem of routing connectionless traff i c i n an ATM network and propose an adaptive multipath routing scheme that enhances the routing methods employed at the Inter-Working Units (IWUs). We present a scheme that distributes packets among multiple Virtual Paths (VPs) according t o the utilization of the links of these VPs. The utalzsation o f the V P s as determined b y a feedb...

Wireless mobile ad hoc networks (MANETS) are self configuring, dynamic networks in which nodes are free to move. In mobile ad hoc networks, the major performance constraint comes from path loss and channel fading. This project implements a channel adaptive routing protocol which extends the Ad hoc On-Demand multipath Distance vector (AOMDV) Routing protocol to accommodate channel fading. This c...

One critical issue of MANET is to improve packet delivery in presence of network dynamics. Proactive MANET routing protocols tend to provide smaller route discovery latency than ondemand protocols because they maintain route information to all the nodes in the network at all time. However, the downside for such protocols is the excessive routing control overhead generated by disseminating perio...

Six runs were submitted for the Adaptive Filtering track, four on the adaptive filtering task (ok11af??), and two on the routing task (msPUM?). The adaptive filtering system has been somewhat modified from the one used for TREC–10, largely for efficiency and flexibility reasons; the basic filtering algorithms remain similar to those used in recent TRECs. For the routing task, a completely new s...

We address the problem of routing connectionless traf c in an ATM network and propose an adaptive mul tipath routing scheme that enhances the routing meth ods employed at the Inter Working Units IWUs We present a scheme that distributes packets among mul tiple Virtual Paths VPs according to the utilization of the links of these VPs The utilization of the VPs is determined by a feedback mechanis...

Different routing strategies may result in different behaviors of traffic in internet. We review the routing strategies developed recently in the field of physics and show that the traffic can be significantly improved by the adaptive routing approaches. Comparing with the shortest path approach, the adaptive routing approaches can reduce the over-loading of hub nodes and thus increase the capa...