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.

Geographic locality of IP prefixes

Abstract: Information about the geographic locality of IP prefixes can be useful for understanding the issues related to IP address allocation, aggregation, and BGP routing table growth. In this paper, we use traceroute data and geographic mappings of IP addresses to study the geographic properties of IP prefixes and their implications on Internet routing. We find that (1) IP prefixes may be too coarse-grained for expressing routing policies, (2) address allocation policies and the granularity of routing contribute significantly to routing table size, and (3) not considering the geographic diversity of contiguous prefixes may result in overestimating the opportunities for aggregation in the BGP routing table.

Routing with opportunistically coded exchanges in wireless mesh networks

Abstract: Network coding is known to improve network throughput by mixing information from different flows and conveying more information in each transmission. Recently there have been some proposals for applying network coding to wireless mesh networks leveraging the broadcast nature of wireless transmissions. These approaches exploit coding opportunities passively while forwarding packets but they do not proactively change routing of flows to create more coding opportunities. In this paper, we attempt to investigate the extent of performance gain possible when routing decisions are made with the awareness of coding. We first define the expected number of coded transmissions for a successful exchange of packets between two nodes through an intermediate node. We then formulate optimal routing with coding, given the topology and traffic, as a linear programming problem. We conduct a preliminary evaluation of coding-aware routing and show that it offers significant gain particularly when there are many long distance flows.

Fault tolerant shared system resource with communications passthrough providing high availability communications

Abstract: A communications passthrough mechanism for high availability network communications between a shared system resource and clients of the system resource. The system resource includes a control/processing sub-system including multiple peer blade processors. A port of each blade processor is connected to each client/server network path and each client is connected to a corresponding port of each blade processor. Each blade processor includes a network fault detector exchanging beacon transmissions with other blade processors through corresponding blade processor ports and network paths. Each blade processor includes response generator responsive to a failure to receive a beacon transmission from a failed port of an other blade processor for redirecting the client communications to the failed port on the other blade processor to the corresponding port of the blade processor. A path manager in the blade processor is responsive to operation of the response generator for modifying the communications routing table to correspond with the redirection message to route the client communications to the failed port of the other blade processor to the other blade processor through the inter-processor communications link. Each blade processor may also include an inter-blade communications monitor for detecting a failure in the inter-processor communications link between the blade processor and another blade processor, reading the communications routing table to select a functional network communications path to a port of the other blade processor, and modifying the communications routing table to redirect inter-processor communications to the selected functional network communications path.

Randomized routing on fat-tress

Abstract: Fat-trees are a class of routing networks for hardwareefficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor λ = Ω(lg n lg lg n) on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(λ) with probability 1-O(1/n). The best previous bound was O(λ lg n) for the off-line problem where switch settings can be determined in advance. In a VLSI-like model where hardware cost is equated with physical volume, we use the routing algorithm to demonstrate that fat-trees are universal routing networks in the sense that any routing network can be efficiently simulated by a fat-tree of comparable hardware cost.

LISP-DHT: towards a DHT to map identifiers onto locators

Abstract: Recent activities in the IRTF (Internet Research Task Force), and in particular in the Routing Research Group (RRG), focus on defining a new Internet architecture, in order to solve scalability issues related to interdomain routing. The research community has agreed that the separation of the end-systems' addressing space (the identifiers) and the routing locators' space will alleviate the routing burden of the Default Free Zone. Nevertheless, such approach, adding a new level of indirection, implies the need of storing and distributing mappings between identifiers and routing locators. In this paper we present LISP-DHT, a mapping distribution system based on Distributed Hash Tables (DHTs). LISP-DHT is designed to take full advantage of the DHT architecture in order to build an efficient and secured mapping lookup system while preserving the locality of the mapping. The paper describes the overall architecture of LISP-DHT, explaining its main points and how it works.