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.

MLSR: a novel routing algorithm for multilayered satellite IP networks

Abstract: Several IP-based routing algorithms have been developed for low-Earth orbit (LEO) satellite networks in recent years. The performance of the satellite IP networks can be improved drastically if multiple satellite constellations are used in the architecture. In this work, a multilayered satellite IP network is introduced that consists of LEO, medium-Earth orbit (MEO), and geostationary Earth orbit (GEO) satellites. A new multilayered satellite routing algorithm (MLSR) is developed that calculates routing tables efficiently using the collected delay measurements. The performance of the multilayered satellite network and MLSR is evaluated through simulations and analysis.

Dynamic routing system for a multinode communications network

Abstract: A communication network having a multiplicity of nodes provides efficient exchange of messages between the nodes. The messages may be originated and received by the computers of a parallel computer system, the processors and associated memories of which are connected to each node. Each node includes a routing system which results in efficient system performance for the parallel computer system associated with the nodes. The messages have control information (a message tag) to which the routing system at each node is responsive. The tag contains data identifying the destination node of the message in the network and prioritization data which, when the message is generated, is initialized to have a value (weight) corresponding to the length (number of links) of the minimal path from the source node where the message originates to the destination node of the message. The routing system utilizes the weights to establish message priority. The routing system receives and sends messages not exceeding the number of links connected thereto on each cycle such that messages flow in and flow out of each routing node on each cycle without being held or stored in queues in the node. Messages of lesser priority are switched by the router to alternate links in accordance with their weights thereby dynamically routing and resolving conflicts among messages.

Load-balancing routing for wireless access networks

Abstract: The widespread use of wireless devices presents new challenges for network operators, who need to provide service to ever larger numbers of mobile end users, while ensuring quality-of-service guarantees. We describe a new distributed routing algorithm that performs dynamic load-balancing for wireless access networks. The algorithm constructs a load-balanced backbone tree, which simplifies routing and avoids per-destination state for routing and per-flow state for QoS reservations. We evaluate the performance of the algorithm using several metrics including adaptation to mobility, degree of load-balance, bandwidth blocking rate, and convergence speed. We find that the algorithm achieves better network utilization by lowering bandwidth blocking rates than other methods.

Content-based routing

Abstract: Implementations are described and claimed herein for content-based routing of messages in an overlay network. According to an exemplary implementation, routing nodes receive messages and return routing policies to the sending node based at least in part on content of the message. The routing policies include instructions for redirecting similar messages to other nodes in the overlay network. The sending node determines which policies to apply to the message. The sending node may then iterate through the routing policies, modifying the address in the message according to instructions included in the routing policies so that the message is sent, e.g., directly to the intended destination. Accordingly, the sending node is able to bypass one or more intermediary nodes to reduce latency in the overlay network.

Source selectable path diversity via routing deflections

Abstract: We present the design of a routing system in which end-systems set tags to select non-shortest path routes as an alternative to explicit source routes Routers collectively generate these routes by using tags as hints to independently deflect packets to neighbors that lie off the shortest-path We show how this can be done simply, by local extensions of the shortest path machinery, and safely, so that loops are provably not formed The result is to provide end-systems with a high-level of path diversity that allows them to bypass unde-sirable locations within the network Unlike explicit source routing, our scheme is inherently scalable and compatible with ISP policies because it derives from the deployed Internet routing We also sug-gest an encoding that is compatible with common IP usage, making our scheme incrementally deployable at the granularity of individual routers