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.

Totally Disjoint Multipath Routing in Multihop Wireless Networks

Abstract: Spreading traffic over multiple paths has been shown to enhance network performance compared to single path routing. However, the route coupling effect specific to wireless environments (consequent to the shared transmission medium) can significantly reduce the benefits of such an approach. In this paper, we focus on the 2-path routing problem in a non-mobile and non energy-constrained network. We evaluate the network performance and the effect of interference in a single source-destination pair scenario and for multiple source-destinations pairs. In the former case, we provide an analytical evaluation of the throughput and propose a position-based algorithm to iteratively find a path between a source and a destination. In the latter case, we demonstrate how interference can significantly degrade the nominal network capacity and void the benefits of multipath routing.

Searching very large routing tables in wide embedded memory

Abstract: Exponentially growing routing tables create the need for increasingly storage-efficient lookup schemes that do not compromise on lookup performance and update rates. This paper evaluates the mechanisms that determine the storage efficiency of state-of-the-art IP lookup schemes. A novel scheme named BARTS (balanced routing table search) is proposed for searching large routing tables in wide embedded memory at OC-192 and OC-768 speeds, while also supporting fast incremental updates. BARTS supports a 38 K-entry routing table in 255 KB and a 72 K-entry table in 453 KB; a 500 K-entry table is estimated to fit into 3 MB. More sophisticated memory management can further reduce these figures to 215, 375 KB, and approximately 2.5 MB, respectively. This is sufficient to handle the large routing tables towards which the Internet seems to be heading in the near future.

Method and apparatus for implementing forwarding decision shortcuts at a network switch

Abstract: A shortcut technique implements forwarding decision shortcuts at a switch for frames routed between subnetworks of a computer network. The switch monitors the flow of a first frame of a particular type to and from the router, which renders a forwarding decision for routing the frame. The switch records information stored in network layer header of a packet encapsulated within the first frame, and then compares that information with the information stored in network layer headers of packets contained within subsequent frames of that particular type. Forwarding decisions for these subsequent frames are then rendered by hardware logic circuits of the switch rather than by the router.

Apparatus and method for optical communication protection

Abstract: Protection techniques within optical communication networks are extremely important. An alternative to a line protection scheme, as most current optical communication networks use, is to utilize a path protection technique in which working and protection paths that are desired are assigned during network setup. During normal operations, only the working path is configured within the network elements' switch fabric with protection paths being left unconfigured. If a failure indication is detected in the working path by a network element, a protection entry within a routing table of the network element is looked up to determine protection switching data that is required to switch the data traffic to the pre-assigned protection path. This protection switching data is inserted within the path overhead for the data traffic so that it can be communicated to all of the network elements that require their switch fabrics reconfigured to establish the protection path of communications. This protection technique allows for similar switching speed to that of line switching protection such as BLSR designs, but with an increase in efficiency in terms of protection bandwidth.

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms

Abstract: In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor network. In addition, we also address such a problem in the wireless sensor network where relay nodes exist and consider the cases where the link quality is not perfect. We show that these problems are NP-complete and propose $O(1)$ -approximation algorithms for each of them. Simulations show that the proposed algorithms have good performance in terms of energy cost.