scispace - formally typeset
Search or ask a question
Topic

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.


Papers
More filters
Patent
09 Nov 1995
TL;DR: In this paper, a two-level multi-path routing table at each node is proposed to ensure efficient delivery of the messages in a multinode communication or multiprocessor network.
Abstract: In a multinode communication or multiprocessor network, messages are communicated from one node to another using an adaptive and dynamic routing scheme. The routing scheme includes two-level multi-path routing tables at each node to ensure efficient delivery of the messages. An entry in the level-1 table identifies a group of nodes and entry in the level-2 table identifies the address for each node within that group. The routing scheme also includes a deflection counter in each message header to avoid endless rerouting of messages and an exponential backoff and retry policy to avoid deadlocks.

73 citations

Proceedings ArticleDOI
07 Nov 2002
TL;DR: This paper presents an efficient hardware solution for the IP address lookup problem as a searching problem on a binary-trie using a hierarchical indexing structure to facilitate direct access to subtrees in a given level.
Abstract: A multigigabit IP router may receive several million packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forwarding table in order to determine the packet's next-hop. In this paper, we present an efficient hardware solution for the IP address lookup problem. We model the address lookup problem as a searching problem on a binary-trie. The binary-trie is partitioned into four levels of fixed size 255-node subtrees. We employ a hierarchical indexing structure to facilitate direct access to subtrees in a given level. It is estimated that a forwarding table with 40 K prefixes will consume 2.5 Mbytes of memory. The searching is implemented using a hardware pipeline with a minimum cycle of 12.5 ns if the memory modules are implemented using SRAM. A distinguishing feature of our design is that forwarding table entries are not replicated in the data structure. Hence, table updates can be done in constant time with only a few memory accesses.

73 citations

Journal ArticleDOI
T.E. Stern1
TL;DR: It is shown that a simple, convergent relaxation procedure can be used to "solve" the analog network, thereby yielding the optimal routing strategy, and the computational load compares favorably with other (centralized) methods, although further work is needed to obtain quantitive comparisons in specific cases.
Abstract: An important problem in packet-switched communication networks is the optimal assignment of routes to the message packets. An optimal routing assignment is one which chooses network paths for the packets in a way that minimizes some cost function, typically average message delay. A class of optimal routing algorithms is described which utilize a type of iterative computation known as relaxation. Computation is decentralized in the sense that each node computes its routing strategy using only information supplied from adjacent nodes. Being iterative, the algorithms are inherently adaptive. The routing computation is based conceptually on an electrical network analog for the optimization problem. We show that a simple, convergent relaxation procedure can be used to "solve" the analog network, thereby yielding the optimal routing strategy. A simple example is presented to illustrate the method. In general, the computational load compares favorably with other (centralized) methods, although further work is needed to obtain quantitive comparisons in specific cases.

73 citations

Patent
12 Jun 2013
TL;DR: In this article, the authors present an information handling system that includes a first hypervisor running on a first server and a second hypervisor operating on a second server, where the gateway devices share a floating address and are configured to export a host route associated with the address into a corresponding entry in an underlay routing table.
Abstract: An information handling system is provided. The information handling system includes a first hypervisor running on a first server and a second hypervisor running on a second server. The first hypervisor manages a first virtual switch and has an overlay forwarding table in memory supporting at least one virtual machine, while the second hypervisor manages a second virtual switch and also has the overlay forwarding table in memory and supports at least one other VM. The information handling system further includes a plurality of gateway devices coupled to the hypervisors. The gateway devices share a floating address and are configured to export a host route, associated with the address, into a corresponding entry in an underlay routing table to redirect network traffic from a first gateway device to a second gateway device.

73 citations

Proceedings ArticleDOI
06 Dec 2011
TL;DR: SMALTA is presented, a practical, near-optimal FIB aggregation scheme that shrinks forwarding table size without modifying routing semantics or the external behavior of routers, and without requiring changes to FIB lookup algorithms and associated hardware and software.
Abstract: IP Routers use sophisticated forwarding table (FIB) lookup algorithms that minimize lookup time, storage, and update time. This paper presents SMALTA, a practical, near-optimal FIB aggregation scheme that shrinks forwarding table size without modifying routing semantics or the external behavior of routers, and without requiring changes to FIB lookup algorithms and associated hardware and software. On typical IP routers using the FIB lookup algorithm Tree Bitmap, SMALTA shrinks FIB storage by at least 50%, representing roughly four years of routing table growth at current rates. SMALTA also reduces average lookup time by 25% for a uniform traffic matrix. Besides the benefits this brings to future routers, SMALTA provides a critical easy-to-deploy one-time benefit to the installed base should IPv4 address depletion result in increased routing table growth rate. The effective cost of this improvement is a sub-second delay in inserting updates into the FIB once every few hours. We describe SMALTA, prove its correctness, measure its performance using data from a Tier-1 provider as well as Route-Views. We also describe an implementation in Quagga that demonstrates its ease of implementation.

73 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
92% related
Server
79.5K papers, 1.4M citations
91% related
Wireless ad hoc network
49K papers, 1.1M citations
91% related
Wireless network
122.5K papers, 2.1M citations
90% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202331
202294
2021119
2020293
2019411
2018493