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 method for routing data packets within a wireless, packet-hopping network and a wireless network and node for implementing the same

Abstract: A random multiple path tabular routing method for routing data packets within a wireless, packet-hopping network, e.g., an intelligent lighting control system, which includes the steps of programming a plurality of the individual nodes to each serve as a repeater node for a least one other individual node, the reapeater nodes forming multiple programmed communication paths between the central node and each of at least selected ones of the individual nodes, and randomly hopping the data packets along the programmed communication paths. The repeater nodes are preferably programmed on the basis of nodal connectivity information obtained during a network initialization process. The repeater nodes are preferably programmed by storing compact partial routing tables in a memory portion of each of these repeater nodes. This routing method is partially deterministic or tabular in that routing tables are used to preprogram the multiple communication paths, and partially random, in that the data packets are randomly hopped along these preprogrammed multiple paths, rather than being hopped along preprogrammed singular paths.

Optimized InfiniBand TM fat-tree routing for shift all-to-all communication patterns

Abstract: Clustered systems have become a dominant architecture of scalable high-performance super computers. In these large-scale computers, the network performance and scalability is as critical as the compute-nodes speed. InfiniBandTM has become a commodity networking solution supporting the stringent latency, bandwidth and scalability requirements of these clusters. The network performance is also affected by its topology, packet routing and the communication patterns the distributed application exercises. Fat-trees are the topology structures used for constructing most large clusters as they are scalable, maintain cross-bisectional-bandwidth (CBB), and are practical to build using fixed-arity switches. In this paper, we propose a fat-tree routing algorithm that provides a congestion-free, all-to-all shift pattern leveraging on the InfiniBandTM static routing capability. The algorithm supports partially populated fat-trees built with switches of arbitrary number of ports and CBB ratios. To evaluate the proposed algorithm, detailed switch and host simulation models were developed and multiple fabric topologies were run. The results of these simulations as well as measurements on real clusters show an improvement in all-to-all delay by avoiding congestion on the fabric. Copyright © 2009 John Wiley & Sons, Ltd. The paper was presented in the International Super Computer 2007 conference in Dresden Germany.

Optimal routing algorithms for mesh-connected processor arrays

Abstract: We show that there is a randomizedoblivious algorithm for routing any (partial) permutation on ann ?n grid in 2n +O(logn) parallel communication steps. The queues will not grow larger than ź(logn/log logn) with high probability. We then modify this to obtain a (nonoblivious) algorithm with the same running time such that the size of the queues is bounded by a constant with high probability. For permutations withlocality, where each packet has to travel a distance at mostL, a generalization of the algorithm routes in time proportional toL with high probability. Finally, we identify a class of meshlike networks that have optimal or near-optimal diameter. These meshes have the potential of being adapted to run existing sorting and routing algorithms with corresponding reduction in their running times.

Packet routing system and method for achieving uniform link usage and minimizing link load

Abstract: Data packets are routed among nodes of a communication system in a uniform fashion. Substantial uniform link usage is achieved within allowed routes determined by end to end transport delay criteria. Initial routes are selected for each source--destination pair from alternative minimal hop routes. Link usage probabilities are calculated for the links involved in each route and system network routing entropy is calculated from the link usage probabilities. Final routes are chosen to maximize the network routing entropy resulting in uniform usage of the system's communication links in proportion to link capacity. The aggregate link load is also minimized. Individual routing tables are generated for each communication node based on the selected routes. The routing tables reflect changes in the traffic demand, changes in link capacity and changes in node connectivity within the constellation which occur as a result of satellite motion.

Dynamic wireless network

Abstract: A Dynamically Reconfigurable Dynamic Wireless Network for connecting a local area network (“LAN”) to wireless Mobile Stations. Backbone Access Points (“Backbone APs”) are physically connected to the LAN. Levels of Wireless Access Points (“Wireless APs”) are daisy-chained together and connected to the Backbone AP, providing an extended area of network coverage. Mobile stations are connected to either Backbone APs or Wireless APs. Dynamic Reconfiguration prevents single point failures. Each AP contains a router, Address Resolution Protocol (“ARP”) cache, and Distributed Routing Table (“DR Table”). The DR Table maintains the Media Access Control (“MAC”) address and the Internet Protocol (“IP”) address of each AP below it in the Distributed Routing Tree. Additionally, each DR Table also maintains the IP address for the device each AP is connected. The Distributed Routing Tree is dynamically reconfigured to minimize transmission hops or to maximize signal strength between Mobile Stations and the LAN.