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.

A Review of Routing Protocols for Mobile Ad Hoc Networks

Abstract: There are significant differences between wire networks and MANETs.MANETs have nodes with high mobility,limited bandwidth resources,and variable topology.Therefore,there is a need for new routing protocols,which solves all these drawbacks.Most routing protocols for MANETs do not take fairness into account.They tend to have a heavy burden on the hosts along the shortest path from a source to a destination.As a result,heavily loaded hosts may deplete power energy quickly,which will lead to network disconnections and failure of application sessions.There have been some methods of multipath routing to solve the question.In this paper,the progress of the multipath routing technique is surveyed,and various routing protocols are described and evaluated,which cover most types of multipath routing protocols,and then provide a comparison and discussion of their respective merits and drawbacks.Finally,the future research directions are outlined.

Methods and systems to perform traffic engineering in a metric-routed network

Abstract: A system (10), to migrate a shortest-path-first (SPF) routed network from a first routing state to a second routing state, includes a changeover module (135) to generate a sequence of intermediate network plans, each of which modifies a preceding network state according to a preceding network plan, such that a routing of at least one demand in the network changes. The sequence of intermediate network plans migrates the network from the first routing state to the second routing state. A network controller (105) sequentially configures the network according to the sequence of intermediate network plans to migrate the network from the first routing state to the second routing state. Each intermediate network plan of the sequence configures the network to operate within at least one predetermined constraint.

A measurement framework for pin-pointing routing changes

Abstract: Changes in the end-to-end path between two hosts can lead to sudden changes in the round-trip time and available bandwidth, or even the complete loss of connectivity. Determining the reason for the routing change is crucial for diagnosing and fixing the problem, and for holding a particular domain accountable for the disruption. Active measurement tools like traceroute can infer the current path between two end-points, but not where and why the path changed. Analyzing BGP data from multiple vantage points seems like a promising way to infer the root cause of routing changes. In this paper, we explain the inherent limitations of using BGP data alone and argue for a distributed approach to troubleshooting routing problems. We propose a solution where each AS continuously maintains a view of routing changes in its own network, without requiring additional support from the underlying routers. Then, we describe how to query the measurement servers along the AS-level forwarding path from the source to the destination to uncover the location and the reason for the routing change.

Detecting and locating wormhole attacks in wireless ad hoc networks through statistical analysis of multi-path

Abstract: The application of multi-path techniques in wireless ad hoc networks is advantageous because multi-path routing provides means to combat the effect of unreliable wireless links and constantly changing network topology. The performance of multi-path routing under wormhole attack is studied in both cluster and uniform network topologies. Because multi-path routing is vulnerable to wormhole attacks, a scheme called statistical analysis of multi-path (SAM) is proposed to detect such attacks and to identify malicious nodes. As the name suggests, SAM detects wormhole attacks and identifies attackers by statistically analyzing the information collected by multi-path routing. Neither additional security services or systems nor security enhancement of routing protocols is needed in the proposed scheme. Simulation results demonstrate that SAM successfully detects wormhole attacks and locates the malicious nodes in networks with cluster and uniform topologies and with different node transmission range.

Optimal routing in Chord

Abstract: We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with edges connecting pairs of nodes that are 2k positions apart for any k ≥ 0. The standard Chord routing algorithm uses edges in only one direction. Our algorithms exploit the bidirectionality of edges for optimality. At the heart of the new protocols lie algorithms for writing a positive integer d as the difference of two non-negative integers d′ and d″ such that the total number of 1-bits in the binary representation of d′ and d″ is minimized. Given that Chord is a variant of the hypercube, the optimal routes possess a surprising combinatorial structure.