Today's Internet routing protocols either provide a single path between each source-destination pair, or multiple paths of equal length. Furthermore, the paths provided by RIP and OSPF are not free of loops during times of network transition. Single-path routing algorithms are inherently slow in responding to congestion and temporary traffic bursts; consequently, the delays experienced by packets in these networks are far from optimal. Recently, we developed a framework for designing routing algorithms that offer "near-optimal" delays; a key component in this framework consists of using a fast responsive routing protocol that builds multipaths for each destination in the computer network, such that they are loop-free at all times. This paper studies the performance of MPATH (multipath routing algorithm) by simulation and compares it against the performance of other state-ofthe -art routing algorithms.

this document is organized as follows:

this paper is to survey fundamental issues and advances in the area of adaptive shortestpath routing for packet-switched networks, and examine them within the context of large, highly-dynamic, and reconfigurable environments. The fundamental question is whether or not the shortest-path paradigm remains desirable or even feasible in such environments.

The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, single-path routing exhibits oscillatory behavior and becomes unstable as traffic loads increase. On the other hand, minimum-delay routing approaches can minimize delays only when traffic is stationary or very slowly changing.

The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Internet. As required of any interdomain protocol, BGP allows policy-based metrics to override distance-based metrics and enables each autonomous system to independently define its routing policies with little or no global coordination. Varadhan et al. [11] have shown that there are collections of routing policies that together are not safe in the sense that they can cause BGP to diverge. That is, an unsafe collection of routing policies can result in some autonomous systems exchanging BGP routing messages indefinitely, without ever converging to a set of stable routes. In this paper we present sufficient conditions on routing policies that guarantee BGP safety. We use a new formalism, called the Simple Path Vector Protocol (SPVP), that is designed to capture the underlying semantics of any path vector protocol such as BGP. We identify a certain circular set of relationships between rou...

Routing protocols have to deal with a known problem: the count-to-infinity. Counting to infinity can occur when a link breaks in the network, and the algorithm in the routing protocol tries to calculate new shortest paths. In this paper I survey the past and present solutions to the this problem.

According to International Technology Roadmap for Semiconductors (ITRS), before the end of this decade we will be entering the era of a billion transistors on a single chip. However, it has been observed that as the system grows, so does the complexity of integrating various components on a chip. The major threat toward the achievement of a billion transistor chip is poor scalability of current interconnect structure of today's SoCs . In order to cope with growing interconnect infrastructure, the "Network on chip (NoC)" concept was introduced. With network methodologies coming on-chip, various characteristics of traditional networks come into play. So far, failures that are common in regular networks were hardly considered on-chip; this paper introduces ideas of dynamic routing and congestion control in the context of NoCs and explains how they could be applied to cope with adverse physical effects of deep submicron technology.

Architecture for content sharing