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.

Improving the efficiency of adaptive routing in networks with irregular topology

Abstract: Networks of workstations are emerging as a cost-effective alternative to parallel computers. The interconnection between workstations usually relies on switch-based networks with irregular topologies. This irregularity makes routing and deadlock avoidance quite complicated. Current proposals avoid deadlock by removing cyclic dependencies between channels and therefore, many messages are routed along non-minimal paths, increasing latency and wasting resources. We propose a general methodology for the design of adaptive routing algorithms for networks with irregular topology that improves a previously proposed one by reducing the probability of routing over non-minimal paths. The resulting routing algorithms allow messages to follow minimal paths in most cases, reducing message latency and increasing network throughput. As an example of application, we propose an improved adaptive routing algorithm for Autonet.

Energy efficient thermal and power aware (ETPA) routing in Body Area Networks

Abstract: Research on routing in a network of intelligent, lightweight, micro and nano-technology sensors deployed in or around the body, namely Body Area Network (BAN), has gained great interest in the recent years. In this paper, we present an energy efficient, thermal and power aware routing algorithm for BANs named Energy Efficient Thermal and Power Aware routing (ETPA). ETPA considers a node's temperature, energy level and received power from adjacent nodes in the cost function calculation. An optimization problem is also defined in order to minimize average temperature rise in the network. Our analysis demonstrates that ETPA can significantly decrease temperature rise and power consumption as well as providing a more efficient usage of the available resources compared to the most efficient routing protocol proposed so far in BANs, namely PRPLC. Also, ETPA has a considerably higher depletion time that guarantees a longer lasting communication among nodes.

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

Abstract: A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (caching and multiple path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.

High-performance routing at the nanometer scale

Abstract: In this work we describe significant improvements to core routing technologies and outperform the best results from the ISPD '07 Global Routing Contest, as well as previous literature, in terms of route completion, runtime and total wirelength. In particular, our router, FGR, improves upon wirelengths produced by BoxRouter and MaizeRouter in March 2007 by 9.9% and 8.4%, respectively. Additionally, we reveal the mathematical basis of negotiated-congestion routing, offer comprehensive analysis of existing routing techniques and discuss several applications at the nanometer scale.