Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.

A Comprehensive Performance Analysis of Proactive, Reactive and Hybrid MANETs Routing Protocols

Abstract: A mobile Ad-hoc network (MANET) is a dynamic multi hop wireless network established by a group of nodes in which there is no central administration. Due to mobility of nodes and dynamic network topology, the routing is one of the most important challenges in ad-hoc networks. Several routing algorithms for MANETs have been proposed by the researchers which have been classified into various categories, however, the most prominent categories are proactive, reactive and hybrid. The performance comparison of routing protocols for MANETs has been presented by other researcher also, however, none of these works considers proactive, reactive and hybrid protocols together. In this paper, the performance of proactive (DSDV), reactive (DSR and AODV) and hybrid (ZRP) routing protocols has been compared. The performance differentials are analyzed on the basis of throughput, average delay, routing overhead and number of packets dropped with a variation of number of nodes, pause time and mobility.

The Message Flow Model for Routing in Wormhole-Routed Networks

Abstract: In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. We first establish the necessary and sufficient condition for deadlock-free routing based on the analysis of the message flow on each channel. We then show how to use the model to prove that a given adaptive routing algorithm is deadlock-free. Finally, we use the method to de? velop new, efficient adaptive routing algorithms for 2D meshes and hypercubes.

Dynamic routing for shared path protection in multidomain optical mesh networks

Abstract: The routing problem for shared path protection in multidomain optical mesh networks is more difficult than that in single-domain mesh networks due to the lack of complete and global knowledge of the network topology and bandwidth allocation. To overcome this difficulty, we propose an aggregated network modeling by underestimation with a two-step routing strategy. In the first step, a rough routing solution is sketched in a virtual network that is the topology aggregation of the multidomain network. A complete routing is then determined by solving routing problems within the original single-domain networks. The first step can be solved by either using an exact mathematical program or a heuristic, whereas the second step is always solved by heuristics. Computational results show the relevance of the aggregated network modeling. They also prove the scalability of the proposed routing for multidomain networks and its efficiency in comparison with the optimal solution obtained by use of the complete information scenario. In addition, we believe that short working paths lead to a higher possibility of sharing backup resources between backup paths. Our mathematical program model minimizes the total requested resources and at the same time provides a short working path, resulting in a further overall saving of resources.

Shortest path first with emergency exits

Abstract: Under heavy and dynamic traffic, the SPF routing algorithm often suffers from wild oscillation and severe congestion, and results in degradation of the network performance. In this paper, we present a new routing algorithm (SPF-EE) which attempts to eliminate the problems associated with the SPF algorithm by providing alternate paths as emergency exits. With the SPF-EE algorithm, traffic is routed along the shortest-paths under normal condition. However, in the presence of congestion and resource failures, the traffic can be dispersed temporarily to alternate paths without route re-computation. Simulation experiments show that the SPF-EE algorithm achieves grater throughput, higher responsiveness, better congestion control and fault tolerance, and substantially improves the performance of routing in a dynamic environment.

Deadlock-free multicast wormhole routing in multicomputer networks

Abstract: Efficient routing of messages is the key to the performance of multicomputers. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2D-mesh and hypercube topologies. The dual-path routing algorithm requires less system resource, while the multipath routing algorithm creates less traffic. More import antly, both routing algorithms are deadlock-free, which is essential to wormhole networks.