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.

A comparison of on-demand and table driven routing for ad-hoc wireless networks

Abstract: We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR) protocol, which is an on-demand routing protocol for wireless ad-hoc networks. We evaluate the performance of WRP-Lite and DSR for varying degree of mobility and traffic in a 20-node network. The performance parameters are end-to-end delay, control overhead, percentage of packets delivered, and hop distribution. We show that WRP-Lite has much better delay and hop performance while having comparable overhead to DSR.

Routing system and method for synchronizing a routing system with peers after failover

Abstract: A routing system provides for transparent routing system failover by checkpointing route prefixes during normal operation by maintaining a route prefix table. After failure of a primary routing processor, routing with peer routing systems is synchronized through the use of this prefix table. The prefix table is managed by the primary routing processor and is accessible by a backup routing processor at least after failure of the primary routing processor. Upon the detection of a failure, a backup routing processor solicits routes from peer routing systems in response to the failure and generates a backup routing database from the routes received from peer routing systems. The backup routing processor also compares prefixes of routes in the backup routing database with prefixes in the prefix table, and sends route withdraw messages to the peer routing systems for routes having prefixes listed in the prefix table and not identified in the backup routing database.

Method and apparatus for exchanging routing information in a packet-based data network

Abstract: Routing information is exchanged between edge routers in different autonomous systems that independently define their routing policies. A Simple Path Vector Protocol extends the prior art Border Gateway Protocol in a manner that is guaranteed to converge by adding a new attribute to the routing messages sent by an edge router to its peers in the different systems. This attribute is a path history, which is dynamically computed at each router as the routing path to a particular destination is changed. The path history attribute is sent in a routing message by a router to its peers together with the sending router's path to that destination. By observing the dynamic path history that is computed at a router as a received routing message from a peer router that contains a history attribute is processed, a cycle can be identified in the newly computed history and associated with a policy conflict at that receiving router's associated autonomous system. A path whose history contains a cycle is automatically suppressed as a permitted path to that destination.

Centralized ground-based route determination and traffic engineering for software defined satellite communications networks

Abstract: Approaches are provided for an SDSN that employs a satellite network nodes, where central L2 network nodes are controlled via a centralized Controller. Link status information is obtained regarding links of each L2 node. Global routing constraints, satellite ephemeris data, and resource allocation information are obtained. A constellation topology of the network nodes is determined based on the ephemeris data. Network routes between pairs of endpoints are determined. Each route includes links based on the link status information regarding the links, the global routing constraints, the bandwidth resources of the links and the current allocation of bandwidth resources, and/or the constellation topology. A forwarding table is generated for each network node, wherein each forwarding table includes route entries providing a next hop indicating a destination for data packets, wherein the destination is associated with a link of the respective network node that represents a link of a respective route.

Opportunistic compression of routing segment identifier stacks

Abstract: A method and device are disclosed for opportunistic compression of routing segment identifiers. In one embodiment, the method includes participating in routing of a first data packet through a first node in a network, and subsequently entering into an arrangement with an adjacent node in the network. The first data packet includes a first plurality of routing segment identifiers, and additional data packets to be routed through the first node also include the first plurality of routing segment identifiers. The arrangement entered into includes representation of the first plurality of routing segment identifiers by a single compression identifier. The method further includes participating in routing of at least one of the additional data packets using the compression identifier instead of the first plurality of routing segment identifiers. In an embodiment, the device includes one or more network interfaces and a processor configured to perform the steps of the method.