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.

Dense virtual router packet switching

Abstract: A dense virtual router packet switching system includes a memory (62) divided into context areas for a set of virtual private routed networks (VPRNs). Each context area includes a routing table and routing protocol state information for a corresponding VPRN. Each of a set of different routing tasks (60) operates with a separate routing table and separate routing protocol state information to realize a corresponding virtual router. Context selection logic (64) selectively couples the routing tasks to the different context areas of the memory to realize a set of virtual routers for all the VPRNs. The system supports a large number of routes by exploiting the segmentation of the VPRNs. Rather than having a single large routing table and associated routing process, which can load hardware resources in proportion to the square of the number of routes in the routing table, routes are distributed among a number of VPRNs having generally smaller tables and correspondingly less processing demand.

Efficient message routing in planar networks

Abstract: The problem of routing messages along near-shortest paths in a distributed network without using complete routing tables is considered It is assumed that the nodes of the network can be assigned suitable short names at the time the network is established Two space-efficient near-shortest-path routing schemes are given for the class of planar networks Both schemes use the separator property of planar networks in assigning the node names and performing the routings For an n-node network, the first scheme uses $O(\log n)$-bit names and a total of $O(n^{{4 / 3}} )$ items of routing information, each $O(\log n)$ bits long, to generate routings that are only three times longer than corresponding shortest routings in worst cases For any constant $\epsilon ,0 < \epsilon < 1/3$, the second scheme achieves the better space bound of $O(n^{1 + \epsilon } )$ items, each $O(({1 / \epsilon })\log n)$ bits long, but at the expense of $O(({1 / \epsilon })\log n)$-bit node names and a worst-case bound of 7 on the rout

Worst-case Traffic for Oblivious Routing Functions

Abstract: This paper presents an algorithm to find a worst-case trafficpattern for any oblivious routing algorithm on an arbitrary interconnectionnetwork topology. The linearity of channel loading offered by obliviousrouting algorithms enables the problem to be mapped to a bipartitemaximum-weight matching, which can be solved in polynomial time forrouting functions with a polynomial number of paths. Finding exact worstcaseperformance was previously intractable, and we demonstrate an examplecase where traditional characterization techniques overestimate thethroughput of a particular routing algorithm by 47%.

Alternate paths in a self-routing packet switching network

Abstract: A packet switching architecture in which switching network nodes (200-206) automatically determine alternate routes through a switching network (107) so as to increase reliability and distribute traffic. The switching network comprises stages of distribution (D) and routing nodes (R). The routing nodes are responsive to physical addresses associated with the packets to communicate those packets to address designated downstream nodes. The distribution switching nodes statistically communicate packets to downstream switching nodes on the basis of an alternate routing algorithm and availability of downstream nodes. The initial network stages are alternate distribution and routing stages followed by only routing stages for the remaining stages of the network. Both the routing and the distributing nodes are identical in design and are responsive to an input signal from the network to assume either routing or distributing functions.