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.

Packet forwarding apparatus with a flow detection table

Abstract: A packet forwarding apparatus provided with a plurality of line interface units, comprises a routing processing unit for referring to a routing table, based on header information of received packet to specify one of output lines to output the received packet, a flow detection unit for referring to an entry table, in which a plurality of entries with flow conditions and control information are registered, to retrieve control information defined by the entry with a flow condition which coincides with that of the header information of the received packet, and a packet forwarding unit for transferring the received packet to one of the line interface units connected to the output line specified by the routing processing unit. The entry table id divided into a plurality of subtables corresponding to the values of flow attributes associated with the received packets and the flow detection unit retrieves the control information from one of said subtables specified by the value of the flow attribute corresponding to the received packet.

Load balanced short path routing in wireless networks

Abstract: We study wireless network routing algorithms that use only short paths, for minimizing latency, and achieve good load balance, for balancing the energy use. We consider the special case when all the nodes are located in a narrow strip with width at most /spl radic/3/2 /spl ap/ 0.86 times the communication radius. We present algorithms that achieve good performance in terms of both measures simultaneously. In addition, our algorithms only use local information and can deal with dynamic change and mobility efficiently.

Multi-service network switch with policy based routing

Abstract: A multi-service network switch capable of providing multiple network services from a single platform. The switch incorporates a distributed packet forwarding architecture where each of the various cards is capable of making independent forwarding decisions. The switch further allows for dynamic resource management for dynamically assigning modem and ISDN resources to an incoming call. The switch may also include fault management features to guard against single points of failure within the switch. The switch further allows the partitioning of the switch into multiple virtual routers where each virtual router has its own wet of resources and a routing table. Each virtual router is further partitioned into virtual private networks for further controlling access to the network. The switch supports policy based routing where specific routing paths are selected based on a domain name, a telephone number, and the like. The switch also provides tiered access of the Internet by defining quality of access levels to each incoming connection request. The switch may further support an IP routing protocol and architecture in which the layer two protocols are independent of the physical interface they run on. Furthermore, the switch includes a generic forwarding interface software for hiding the details of transmitting and receiving packets over different interface types.

On scalable QoS routing: performance evaluation of topology aggregation

Abstract: A number of important questions remain concerning the scalability of networks with quality of service guarantees. We consider one of these questions: can QoS routing protocols scale to large networks? To address this question, we evaluate the performance of techniques that can reduce the QoS routing protocol overhead. We specifically focus on topology aggregation, which can reduce overhead by orders of magnitude. We also investigate the interaction of topology aggregation with other important factors that contribute to performance, such as routing update frequency, routing algorithms, and network configuration. Our experiments are based on simulations of relatively large, structured networks. Among our observations, we find-contrary to intuition-that topology aggregation does not always have a negative impact on routing performance. Aggregation can reduce the routing information fluctuation, increase stability, and thus benefit routing performance. We also propose two new methods of aggregating routing information. Our hybrid aggregation method performs much better than conventional star aggregation and approaches unaggregated performance. Our weighted aggregation method, while intuitively appealing, offers mixed performance across topologies.