Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.

Enhancing security via stochastic routing

Abstract: Shortest path routing leaves connections at risk of interception and eavesdropping since the path over which data packets travel is fairly predictable and easy to determine. To improve routing security, we propose a proactive mechanism, which we call secure stochastic routing, that explores the existence of multiple routes and forces packets to take alternative paths probabilistically. We investigate game theoretic techniques to develop routing policies which make interception and eavesdropping maximally difficult. Through simulations, we validate our theoretical results and show how the resulting routing algorithms perform in terms of the security/delay/throughput trade-off. We observe that a beneficial side-effect of these algorithms is an increase in throughput, as they make use of multiple paths. The Internet was designed to use redundancy to enhance reliability. We suggest that, through stochastic methods, redundancy be used to increase security.

Scalable multiple level tab oriented interconnect architecture

Abstract: An improved field programmable gate array (FPGA) is provided which includes tab network connectors for interfacing groups of configurable function generators with lower levels of interconnect and for interfacing lower levels of interconnect with higher levels of interconnect. Furthermore, an innovative cluster architecture is utilized which provides fine granularity without a significant increase in configurable function generators. The tab connector network can also be used to route a lower level routing line to a higher level routing line. This is particularly desirable in order to meet the needs for driving a signal along longer routing lines without requiring all signal drivers be sufficiently large to drive a signal along the longest routing line. The connector networks described enable a flexible routing scheme to be implemented in which the routing lines at each level are divided into sets. In addition, the innovative routing hierarchy consisting of the routing lines, block connector tab networks and turn matrices, permits an innovative, space saving floor plan to be utilized that is scalable.

Method and apparatus for layout-constrained global routing

Abstract: A global router uses an algorithm for controlling routing based upon rough topologies. In one embodiment a set of regions and layers is specified over which the routing must occur. Tunnels can be defined outside of which routing cannot occur. Topologies of previous iterations are considered. Restrictions on the amount of deviation between successive iterations can be specified. As a result, successive iterations of the global router do not cause large changes in the timing delays of circuits. In addition, partial tunnels can be stretched to accommodate nearby nets. Also described are an integrated circuit that is produced using the layout-constrained global routing algorithm and a computer-readable medium storing computer-executable instructions and at least one data structure for implementing the algorithm.

Method and apparatus for rapid rerouting of ldp packets

Abstract: A u-turn fast rerouting capability is depicted and described herein. A packet that is intended for a destination node is propagated from a first node toward a second node. The first node propagates the packet toward the second node based on selection of a first routing path for routing the packet from the first node toward the destination node. The second node, upon receiving the packet, determines that the packet cannot be delivered to the destination node via the first routing path. The second node inserts a u-turn label into the packet and returns the packet to the first node. The u-turn label indicates to the first node that the packet is being returned to the first node by the second node due to a condition preventing propagation of the packet toward the destination node using the first routing path. The first node, upon receiving the packet including the u-turn label, then selects a second routing path for routing the packet toward the destination node and propagates the packet toward the destination node based on the second routing path. The u- turn fast rerouting capability enables fast rerouting of packets in a manner preventing dropping of packets and preventing formation of forwarding loops.

Dynamic route recomputation considered harmful

Abstract: This paper advocates a different approach to reduce routing convergence--side-stepping the problem by avoiding it in the first place! Rather than recomputing paths after temporary topology changes, we argue for a separation of timescale between offline computation of multiple diverse paths and online spreading of load over these paths. We believe decoupling failure recovery from path computation leads to networks that are inherently more efficient, more scalable, and easier to manage.