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.

Minimum-cost bounded-skew clock routing

Abstract: In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST) in two steps: (i) a bottom-up phase to construct a binary tree of shortest-distance feasible regions which represent the loci of possible placements of clock entry points, and (ii) a top-down phase to determine the exact locations of clock entry points. Experimental results show that our clock routing algorithm, named BST/DME, can produce a set of routing solutions with skew and wirelength trade-off.

Survey on Mobile Ad Hoc Network Routing Protocols

Abstract: mobile ad-hoc network is characterized as network without any physical connections. In this network there is no fixed topology due to the mobility of nodes, interference, multipath propagation and path loss. Many Routing protocols have been developed to overcome these characteristics. The purpose of this paper is to review existing mobile ad-hoc proactive and reactive routing protocols depending on their proactive and reactive nature respectively. This review paper provides an overview of these protocols by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance. The objective of this review paper is to provide analysis about improvement of these existing protocols.

Towards a New Internet Routing Architecture: Arguments for Separating Edges from Transit Core.

Abstract: In recent years, the size and dynamics of the global routing table have increased rapidly along with an increase in the number of edge networks The relation between edge network quantity and routing table size/dynamics reveals a major limitation in the current architecture; there is a conflict between provider-based address aggregation and edge networks’ need for multihoming Two basic directions towards resolving this conflict have surfaced in the networking community The first direction, which we dub separation, calls for separating edge networks from the transit core, and engineering a control and management layer in between The other direction, which we dub elimination, calls for edge networks to adopt multiple provider-assigned addresses to enable provider-based address aggregation In this paper, we argue that separation is a more promising approach to scaling the global routing system than elimination, and can potentially be leveraged to bring other architectural improvements to today’s Internet that an elimination approach cannot

Communications network with routing tables for establishing a path without failure by avoiding unreachable nodes

Abstract: In a communications network where cross-connect nodes are organized according to geographic domains, a domain connectivity table indicates intra-domain connectivity of each domain and a domain routing table indicates a route specifying those nodes whose intra-domain connectivity is indicated in the domain connectivity table Each node uses its domain routing table to establish a path between edge nodes In another embodiment, the domain routing table indicates routes containing no intra-domain virtual link that terminates at an edge node and no consecutively concatenated intra-domain virtual links A backbone routing table indicates inter-domain routes and unreachability indications between border nodes of each domain and border nodes of every other domain The inter-domain routes contain at least one of the inter-domain physical links but contain no consecutively concatenated intra-domain virtual links

High availability L3 gateways for logical networks

Abstract: Some embodiments provide a method for a network controller in a network control system that manages a plurality of logical networks. The method receives a specification of a logical network that includes a logical router. The method selects at least two host machines to implement a routing table for the logical router from several host machines designated for hosting logical routers. The selected host machines include a designated master host machine for the routing table. The method generates data tuples for provisioning a set of managed forwarding elements that implement the logical network to send data packets that require processing by the routing table to the selected host machines. The data tuples specify an order for the selected host machines with the designated master host machine as the first host machine in the specified order.