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.

System for generating explicit routing advertisements to specify a selected path through a connectionless network to a destination by a specific router

Abstract: A system for providing explicit routing functions in a connectionless network. A specific router selects a path through the connectionless network to a destination. Explicit routing advertisements are generated by the specific router and contain information regarding the selected path. Routing state is installed according to information contained in the explicit routing advertisements. The explicit routing advertisements are forwarded to each next hop router. Each next hop router installs routing state, generates the explicit routing advertisement, and forwards the explicit routing advertisement to further propagate the routing information.

Multi-domain network and method for multi-domain network

Abstract: Each domain of a multi-domain network collects intra-domain routing information relating to that domain and makes a reduced view of that information available to other domains of the network, and in which each domain of the network uses its own intra-domain routing information together with the reduced-view routing information from the other domains to form a logical view of the network so as to enable that domain to make an end-to-end route selection decision.

WDM packet routing for high-capacity data networks

Abstract: We present experimental and numerical studies of a novel packet-switch architecture, the data vortex, designed for large-scale photonic interconnections. The selfrouting multihop packet switch efficiently scales to large port counts (>10 k) while maintaining low latencies, a narrow latency distribution, and high throughput. To facilitate optical implementation, the data-vortex architecture employs a novel hierarchical topology, traffic control, and synchronous timing that act to reduce the necessary routing logic operations and buffering. As a result of this architecture, all routing decisions for the data packets are based on a single logic operation at each node. The routing is further simplified by the employment of wavelength division multiplexing (WDM)-encoded header bits, which enable packet-header processing by simple wavelength filtering. The packet payload remains in the optical domain as it propagates through the data-vortex switch fabric, exploiting the transparency and high bandwidths achievable in fiber optic transmission. In this paper, we discuss numerical simulations of the data-vortex performance and report results from an experimental investigation of multihop WDM packet routing in a recirculating test bed.

Dynamic path selection with in-order delivery within sequence in a communication network

Abstract: In a communication network system having a multi-switch Fiber Channel fabric, switches are in communication through a plurality of paths. To distribute the traffic load, more than one path can be used for any source-destination pair. However, due to limitations under the Fiber Channel standard, in-order delivery is required for certain data frames, such as those belonging to the same sequence or exchange. To avoid compromising the in-order requirement, a dynamic path selection scheme is devised. In one embodiment, a hash function is used to categorize data frames into sequences and to distribute the load in a pseudo-random manner. In another embodiment, a multiple-field routing table is used to assign arbitrary paths to different sequences.

Extension of logical networks across layer 3 virtual private networks

Abstract: A method of managing a set of managed forwarding elements 135, 155, 160 that forward data between machines. The method configures a first managed forwarding element 135 to operate in a first network 105 that uses first and second address spaces that at least partially overlap with each other, a second managed forwarding element 155 to operate in a second network 110 that uses the first address space, and a third managed forwarding element 160 to operate in a third network 115 that uses the second address space. An address space is a set of addresses defined by an IP prefix. A network controller generates configuration data for configuring the managed forwarding elements 105, 110, 115 operating in the network sites 105, 110, 115 connected through a wide area network 120 such that the machines in the different sites can share the same address spaces. The wide area network 120 has an edge router interfacing with the first network 105. The first managed forwarding element 153 is directed to create a virtualized link to the edge router for each of the first and second address spaces, and to connect to the second and third managed forwarding elements 155, 160 using the virtualized links for the first and second address spaces, respectively. The edge router has a plurality of forwarding tables 420, 425, wherein each of the virtualized links is for having the edge router use a particular forwarding table associated with an address space. The virtualized link may comprise a GRE tunnel or a VLAN tag.