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.

Datagram routing for internet multicasting

Abstract: We present a solution to the problem of multidestination routing in internetworks. The component subnets of these internets share a common datagram internet layer, and the gateways and hosts can determine the next gateway en route to a foreign net. Our datagram routing offers high resilience to network failures, major reductions in network traffic, and no changes whatsoever to the subnetwork routing. The routing follows “shortest” paths as defined by the distance criteria of an internet. We intend to use the algorithm as an option of the DoD Internet Protocol with only minor changes to IP while preserving interoperability with IP modules not supporting multidestination.

Randomized 3D Geographic Routing

Abstract: We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing decision solely on its local view of the network, nodes do not store any message state, and the message itself can only carry information about O(1) nodes. In geographic routing schemes, each network node is assumed to know the coordinates of itself and all adjacent nodes, and each message carries the coordinates of its target. Whereas many of the aspects of geographic routing have already been solved for 2D networks, little is known about higher-dimensional networks. It has been shown only recently that there is in fact no local memoryless routing algorithm for 3D networks that delivers messages deterministically. In this paper, we show that a cubic routing stretch constitutes a lower bound for any local memoryless routing algorithm, and propose and analyze several randomized geographic routing algorithms which work well for 3D network topologies. For unit ball graphs, we present a technique to locally capture the surface of holes in the network, which leads to 3D routing algorithms similar to the greedy-face-greedy approach for 2D networks.

A New Cluster Based Routing Protocol for VANET

Abstract: With the development of vehicles and mobile Ad Hoc network technology, the Vehicle Ad hoc Network (VANET) has become an emerging field of study It is a challenging problem for searching and maintaining an effective route for transporting some data information In this paper the authors designed a new routing protocol for VANET based on the former results, called CBR (Cluster Based Routing) Compared with other routing protocols, the new one has obvious improvement in the average routing overhead and small average end to end delay jitter with the increase of vehicles number The real-time traffic applications require data transmission delay time to be relatively stable, small average end to end delay jitter with the increase of vehicles number just meets the real-time application needs