Routing table

About: Routing table is a research topic. Over the lifetime, 16589 publications have been published within this topic receiving 336842 citations. The topic is also known as: routing information base & RIB.

Back-pressure-based packet-by-packet adaptive routing in communication networks

Abstract: Back-pressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff.

TO-GO: TOpology-assist geo-opportunistic routing in urban vehicular grids

Abstract: Road topology information has recently been used to assist geo-routing, thereby improving the overall performance. However, the unreliable wireless channel nature in urban vehicular grids (due to motion, obstructions, etc) still creates problems with the basic greedy forwarding. In this paper, we propose TO-GO (TOpology-assisted Geo-Opportunistic Routing), a geo-routing protocol that exploits topology knowledge acquired via 2-hop beaconing to select the best target forwarder and incorporates opportunistic forwarding with the best chance to reach it. The forwarder selection takes into account of wireless channel quality, thus significantly improving performance in error and interference situations. Extensive simulations confirm TO-GO superior robustness to errors/losses as compared to conventional topology-assisted geographic routing.

Fast routing table construction using small messages: extended abstract

Abstract: We describe a distributed randomized algorithm to construct routing tables. Given 0< e <= 1/2, the algorithm runs in time ~O(n1/2+e + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted length of the produced routes is at most O(e-1log e-1) times the optimal weighted length. This is the first algorithm to break the Omega(n) complexity barrier for computing weighted shortest paths even for a single source. Moreover, the algorithm nearly meets the ~Omega(n1/2 + HD) lower bound for distributed computation of routing tables and approximate distances (with optimality, up to polylog factors, for e=1/log n). The presented techniques have many applications, including improved distributed approximation algorithms for Generalized Steiner Forest, all-pairs distance estimation, and estimation of the weighted diameter.

Adaptive topology discovery in communication networks

Abstract: A topology discovery process is used to discover all of the links in an ad hoc network and thereby ascertain the topology of the entire network. One of the nodes of the network, referred to as the coordinator, receives the topology information which can then be used to, for example, distribute a routing table to each other node of the network. The process has a Diffusion phase in which a k-resilient mesh, k>1, is created by propagating a topology request message through the network. Through this process, the nodes obtain information from which they are able to discern their local neighbor information. In a subsequent, Gathering phase, the local neighbor information is reported upstream from a node to its parents in the mesh and thence to the parents' parents and so forth back to the coordinator. The robustness of the Diffusion phase is enhanced by allowing a node to have more than one parent as well as by a number of techniques, including use of a so-called diffusion acknowledgement message. The robustness of the Gathering phase is enhanced by a number of techniques including the use of timeouts that ensure that a node will report its neighbor information upstream even if it never receives neighbor information from one or more downstream neighbors and the use of a panic mode that enhances the probability that a node will get its neighbor information, and its descendents' neighbor information, reported upstream even if that node has lost connectivity with all of its parents.

PSO-based approach for energy-efficient and energy-balanced routing and clustering in wireless sensor networks

Abstract: Many schemes have been proposed for energy-efficient routing in wireless sensor networks (WSNs). However, most of these algorithms focus only on energy efficiency in which each node finds a shortest path to the base station (BS), but remain silent about energy balancing which is equally important to prolong the network lifetime. In this paper, we propose particle swarm optimization-based routing and clustering algorithms for WSNs. The routing algorithm builds a trade-off between energy efficiency and energy balancing, whereas the clustering algorithm takes care of the energy consumption of gateways as well as sensor nodes. We develop an efficient particle-encoding scheme and derive a multi-objective fitness function for each of the proposed routing and clustering algorithms. The algorithms are also capable of tolerating the failure of cluster heads. We perform extensive simulations on the proposed schemes and the results are compared with the existing algorithms to demonstrate their superiority in terms of various performance metrics.