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.

Method of routing packets in a packet network

Abstract: A method of routing packets in a packet network is disclosed The packet network includes a chain of packet nodes, the chain comprising a first and second access node for communicating with one or more mobile nodes and one or more intermediate packet nodes providing a path interconnecting the first and second access nodes Previous methods are inefficient and lead to additional overhead The method comprises the steps of: installing, in said intermediate packet nodes, first routing data defining a first routing path in one direction along said chain to a mobile node via said first access node and second routing data defining a second routing path in the opposite direction along said chain to said mobile node via said second access node; operating each of said intermediate packet nodes to: determine, on receipt of a packet destined for said mobile node, whether said packet is from another node on said chain or not; and a) if the packet is determined to be from a node not on said chain, copying the packet and routing said copy along one of said routing paths and routing said packet along the other of said routing paths; and b) if the packet is determined to be from another node on said chain, route said packet along said chain only in the direction in which it is currently travelling

Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks

Abstract: Routing in wireless communication systems such as ad hoc networks remains a challenging problem given the limited wireless bandwidth, users' mobility, and potentially large scale. Recently, a thrust of research has addressed these problems-the on- demand routing, geographical routing, and virtual coordinates. In this paper, we focus on geographical routing that has been shown to achieve good scalability without flooding; however, this usually requires the availability of location information and can suffer from poor routing performance and severe dead end problems, especially in sparse networks. Specifically, we propose a new Hop ID routing scheme, which is a virtual coordinate-based routing protocol and does not require any location information. This achieves excellent routing performance comparable with that obtained by the shortest path routing schemes. In addition, we design efficient algorithms for setting up the system and adapt to the node mobility quickly and can effectively route out of dead ends. Extensive analysis and simulation show that the Hop ID-based routing achieves efficient routing for mobile ad hoc networks with various density, irregular topologies, and obstacles.

Combining Multipath Routing and Congestion Control for Robustness

Abstract: Flexible routing schemes mitigate some of the problems associated with uncertain traffic patterns and workloads by making the exact location of capacity less important: if there is available capacity the routing scheme will find it. In this paper we propose a combined multipath routing and congestion control architecture that can provide performance improvements to the end user and simplifies network dimensioning for operators. We describe a flow-level model, able to handle streaming and file transfer traffic, with stochastic arrivals, and look at a fluid limit. We describe a congestion controller and path selection algorithm that automatically balances traffic across the lowest cost paths, and we suggest ways in which just two paths may be used, with a random selection policy. A notable feature of a multipath congestion controller is that it cannot be tuned to a single RTT, hence it differs from standard TCP with respect to RTT bias. We show that under certain conditions the allocation of flows to paths is optimal and independent of the flow control algorithm used. Scalability of the architecture results from implementing the algorithms at end-systems. We illustrate by examples how such an approach can halve response times and double the load that a network can carry.

Flood-and-forward routing for broadcast packets in packet switching networks

Abstract: A routing algorithm for broadcast packets in packet switching networks, utilizing a "flood-and-forward" technique. In such networks, data are often transmitted in grat quantities from a sensor node to all other nodes in the network, or in a subnetwork, over point-to-point links. Existing broadcast routing algorithms, including multidestination addressing, constrained flooding, minimum spanning tree forwarding, and reverse path forwarding, suffer from an excessive use of bandwidth, a poor choice of routes, or a costly need for memory or computing power. In flood-and-forward routing, periodically a data packet is designated as a Scout packet and is transmitted in a constrained flood broadcast transmission. The Scout packet is identified by a Source Id and a Scout Label. Each receiving node sends a Ack Scout packet to the node from which it first receives a particular Scout packet, acknowledging receipt of that packet. Each relaying node keeps a log of nodes from which it has received Ack Scout packets and sends subsequent, non-scout packets to those same nodes. This flood-and-forward broadcast routing algorithm thus offers the best selection of routes, as in constrained flooding, and the least consumption of bandwidth, as in minimum spanning tree forwarding, while keeping the overhead cost of storage and processing to a low level. With the support of a reliable link service, the algorithm performs well in delivering critical data to all reachable destinations despite to-be-expected losses of packets, links, or nodes.

REER: Robust and Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks

Abstract: Wireless Sensor Networks (WSNs) are subject to node failures because of energy constraints, as well nodes can be added to or removed from the network upon application demands, resulting in unpredictable topology changes. Furthermore, due to limited transmission range of wireless sensor nodes, multiple hops are usually needed for a node to exchange information with other nodes or sink node(s). This makes the design of routing protocols in such networks a challenging task. In all proposed single path routing schemes a periodic low-rate flooding of data is required to recover from path failures, which causes consumption of scarce resources of the sensor node. Thus multipath routing schemes is an optimal alternative to maximize the network lifetime. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path, which spreads consumed energy evenly across the nodes within the network, potentially resulting in longer lifetimes. In this paper, we propose a robust and energy efficient multipath routing protocol (shortly abbreviated as REER). REER uses the residual energy, node available buffer size, and Signal-to-Noise Ratio (SNR) to predict the best next hop through the paths construction phase. REER examines two methods of traffic allocation; the first method uses a single path among the discovered paths to transfer the data message, when this path cost falls bellow a certain threshold, it then switches to the next alternative path. The second method is to split up the transmitted message into number of segments of equal size, add XOR-based error correction codes, and then transmit it across multiple paths simultaneously to increase the probability that an essential portion of the packet is received at the destination without incurring excessive delay. Through computer simulation, we evaluate and study the performance of our routing protocol and compare it with other protocols. Simulation results show that our protocol achieves more energy savings, lower average delay and higher packet delivery ratio than other protocols.