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.

LAP LAMBERT Academic Publishing, Germany

Abstract: A fault-tolerant communication scheme that facilitates optimal routing in mesh embedded hypercube interconnection networks subject to node failures in parallel computing. It is shown that by only using feasible paths routing can be substantially simplified. An efficient routing algorithm has been proposed that uses local information from every processor can route a message from a source node to the destination in presence of fault free or of single/multiple faulty nodes in mesh embedded hypercube interconnection networks.

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

Abstract: Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.

Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM Networks

Abstract: Optical dense wavelength division multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider routing and wavelength assignment in a wide area wavelength routed backbone network that employs circuit-switching. When a session request is received by the network, the routing and wavelength assignment (RWA) task is to establish a lightpath between the source and destination. That is, determine a suitable path and assign a set of wavelengths for the links on this path. We consider a link state protocol approach and use Dijkstra’s shortest path algorithm, suitably modified for DWDM networks, for computing the shortest paths. In [1] we proposed WDM aware weight functions that included factors such as available wavelengths per link, total wavelengths per link. In this paper, we present new weight functions that exploit the strong correlation between blocking probability and number of hops involved in connection setup to increase the performance of the network. We also consider alternate path routing that computes the alternate paths based on WDM aware weight functions. The impact of the weight functions on the blocking probability and delay is studied through discrete event simulation. The system parameters varied include number of network nodes, wavelengths, degree of wavelength conversion, and load. The results show that the weight function that incorporates both hop count and available wavelength provides the best performance in terms of blocking probability.

A Reliability-oriented Transmission Service in Wireless Sensor Networks

Abstract: Reliable transmission service is in dire need for many applications in wireless sensor networks (WSNs). Most existing routing protocols however, seriously suffer from low end-to-end success rates in real deployments. Through extensive experiments on a test-bed of Mica2 nodes, we identify three key problems that hinder the reliable packet delivery. In order to address these problems and therefore to provide a reliability-oriented transmission service, we propose a novel in-middle recovery mechanism that fills the gap between the traditional per-hop recovery and end-to-end recovery mechanisms. To realize such an idea, we design and implement proliferation routing that leverages randomized dispersity and reproduction. The distinctive feature of proliferation routing is its great flexibility. Not only can it be applied with any medium access control (MAC) protocol and routing metric, but also a desired service quality can be effectively derived by controlling the system parameters. Such a feature is revealed by theoretical analysis and confirmed by implementation and simulation experiments. In a specific experiment setup, proliferation routing can increase the end-to-end transmission success rate up to 70% compared with the well-known hop-based routing and flooding.

Compact routing on power law graphs with additive stretch

Abstract: We present a universal routing scheme for unweighted, undirected networks that always routes a packet along a path whose length is at most an additive factor of d more than OPT (where OPT is the length of an optimal path), using O(e log2 n)-bit local routing tables and packet addresses, with d and e parameters of the network topology. For power-law random graphs, we demonstrate experimentally that d and e take on small values. The Thorup-Zwick universal multiplicative stretch 3 scheme has recently been suggested for routing on the Internet inter-AS graph; we argue, based on the results in this paper, that it is possible to improve worst-case performance on this graph by directly exploiting its power-law topology.