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.

System and method for packet level distributed routing in fiber optic rings

Abstract: An apparatus and a method for transporting IP user traffic over a fiber optic ring network that includes a plurality of fiber optic ring network nodes. One ring is for conducting the user traffic on a working path and the other ring is for conducting the same user traffic on a protection path in the event of a failure in a communication link in the first ring on a protection path. A central node is coupled to a plurality of nodes to provide forwarding tables and updates to the nodes. As a result, IP traffic may be routed through the fiber optic ring network in a manner that provides fast switching from a working path to a protection path to minimize lost data packets whenever a communication link in the working path fails. Additionally, this capability is provided without requiring each node to have full IP routing capability. The forwarding tables for the protection and working paths provide for path routes and forwarding for the packets on a packet by packet basis. Accordingly, a ring may serve as both a working path and a protection path according to the origin and destination of the data packets traveling thereon. Additionally, the central node is adapted to generate multiple forwarding tables to accommodate packet by packet forwarding in a network created to support virtual private networks. The forwarding tables also are set up to support multicast transmissions of data packets.

System and method for routing, mobility, application services, discovery, and sensing in a vehicular network environment

Abstract: A method includes selecting a path for routing a data packet from a source node to a destination node in a vehicular ad hoc network, storing the data packet if the selected path is identified as a dead end, and establishing a communication link with a first node. The method also includes forwarding the data packet to the first node if a first distance between the first node and the destination node is less than a second distance between the source node and the destination node. More specific embodiments include sending a query for location information of the destination node, receiving the location information including two or more available paths from the source node to the destination node, and determining the path for routing the data packet is an optimal path of the two or more available paths.

Localization and routing in sensor networks by local angle information

Abstract: Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measurements in a sensor network. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance 1 away. Despite the negative results, however, one can find a planar spanner of a unit disk graph by using only local angles. The planar spanner can be used to generate a set of virtual coordinates that enable efficient and local routing schemes such as geographical routing or approximate shortest path routing. We also proposed a practical anchor-free embedding scheme by solving a linear program. We show by simulation that not only does it give very good local embedding, i.e., neighboring nodes are close and non-neighboring nodes are far away, but it also gives a quite accurate global view such that geographical routing and approximate shortest path routing on the embedded graph are almost identical to those on the original (true) embedding. The embedding algorithm can be adapted to other models of wireless sensor networks and is robust to measurement noise.

SPROUT: P2P routing with social networks

Abstract: In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks.We propose SPROUT, a DHT routing algorithm that, by using social links, significantly increases the number of query results and reduces query delays.We discuss further optimization and design choices for both the model and the routing algorithm Finally, we evaluate our model versus regular DHT routing and Gnutella-like flooding.

Distributed asynchronous optimal routing in data networks

Abstract: In this paper we study the performance of a class of distributed optimal routing algorithms of the gradient projection type under weaker and more realistic assumptions than those considered thus far. In particular, we show convergence to an optimal routing without assuming synchronization of computation at all nodes and measurement of link lengths at all links, while taking into account the possibility of link flow transients caused by routing updates. This demonstrates the robustness of these algorithms in a realistic distributed operating environment.