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.

Interchangeable pin routing with application to package layout

Abstract: Many practical routing problems such as BGA, PGA, pin redistribution and test fixture routing involve routing with interchangeable pins. These routing problems, especially package layout, are becoming more difficult to do manually due to increasing speed and I/O. Currently, no commercial or university router is available for this task. In this paper, we unify these different problems as instances of the interchangeable pin routing (IPR) problem, which is NP-complete. By representing the solution space with flows in a triangulated routing network instead of grids, we developed a min-cost max-flow heuristic considering only the most important cuts in the design. The heuristic handles multiple layers, prerouted nets, and all-angle, octilinear or rectilinear wiring styles. Experiments show that the heuristic is very effective on most practical examples. It had been used to route industry designs with thousands of interchangeable pins.

Restorable dynamic quality of service routing

Abstract: The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. Upon failure of a node or link on the path, a new path satisfying the constraints has to be established. However, resources needed to satisfy the QoS requirements are not guaranteed to be available at the rerouting instant, so QoS is not guaranteed upon failure. Restorable QoS routing, where active and backup paths must be simultaneously set up, has been previously studied. This is mostly motivated by the incorporation of mechanisms to establish QoS guaranteed paths with failure protection in multiprotocol label switching networks. This article describes some previously developed algorithms for dynamic routing of restorable QoS guaranteed paths.

Preferential loading in data centers

Abstract: Infrastructure is disclosed for optimizing performance and minimizing errors during normal operation of replicated data centers. In some implementations, systems that are replicated in each data center under a common IP address may have service requests routed to them using routing tables that favor one of the systems. The routing tables may prefer the system that resides in the data center where the service requests originated, or they may prefer the system that meets other criteria. Other systems replicated in the data center may have service requests routed to them using configuration tables that favor one of the systems. The configuration tables may also prefer the system that resides in the data center where the service requests originated, or they may prefer the system that meets other criteria. This arrangement helps optimize performance during normal operation and minimize potential for disruption of service should one of the data centers fail.

An adaptive routing algorithm for wavelength-routed optical networks with a distributed control scheme

Abstract: For a wavelength-routed network in which connection requests are arriving and departing at high rates, an appropriate control scheme must be implemented to set up light paths for each request in a fast and efficient manner. The control scheme, which includes routing and wavelength assignment algorithms, must also be scalable, and should attempt to minimize the number of blocked connections. In this paper, we consider a distributed control scheme which utilizes a new adaptive routing approach called alternate-link routing. In the proposed approach, routing decisions for a light path are made adaptively on a hop-by-hop basis by individual nodes in a distributed manner. The scheme does not require the maintenance of any global information. A simulation is developed to analyze blocking performance, and it is shown that the proposed approach outperforms fixed routing and, under certain conditions, also outperforms fixed alternate-path routing.

Route-over vs mesh-under routing in 6LoWPAN

Abstract: Transmission of IPv6 packets over Low-power Wireless Personal Area Networks (6LoWPAN) was considered nearly impractical once. The size of IPv6 packets is much larger than the packet size of the IEEE 802.15.4 data link layer. 6LoWPAN implements an adaptation layer between network and data link layers. Main purpose of the adaptation layer is to fragment and reassemble IPv6 packets. Implementation of the adaptation layer enhances the routing/forwarding decision of packets both network and adaptation layers. We can divide the routing scheme in 6LoWPAN into two categories: the mesh-under and the route-over, based on the routing decision taken on adaptation layer or network layer respectively. In this paper we perform an analytical comparison between these two schemes in terms of the packet/fragment arrival probability, the total number of transmissions and the total delay between source and destination. We also compare the selective fragment retransmission mechanism between mesh-under and route-over schemes.