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.

Optimal buffered routing path constructions for single and multiple clock domain systems

Abstract: Shrinking process geometries and the increasing use of IP components in SoC designs give rise to new problems in routing and buffer insertion. A particular concern is that cross-chip routing will require multiple clock cycles. Another is the integration of independently clocked components. This paper explores simultaneous routing and buffer insertion in the context of single and multiple clock domains. We present optimal and efficient polynomial algorithms that can be used to estimate communication overhead for interconnect and resource planning in single and multi-clock domain systems. Experimental results verify the correctness and practicality of our approach.

Method and apparatus for storing and retrieving routing information in a network node

Abstract: Method and apparatus for storing and retrieving routing information in a node of a network, such as an ATM network, are disclosed. A routing table in each node of the network stores the routing information for each active call connection through the node, for example, identified by a virtual path identifier (VPI) and a virtual channel identifier (VCI). The routing table is indexed by a modified header error control (HEC) value, which may be the actual HEC value associated with a given cell, or a value calculated therefrom. Upon receipt of an incoming cell at a network node, the modified HEC value is calculated, to access the appropriate entry of the routing table. The routing table preferably stores a pointer to a memory location, such as a linked list of data structures, storing the actual routing information for each connection. An intermediate node data structure preferably stores the routing information for a particular connection through an intermediate node of the ATM network, while a leaf node data structure preferably stores the routing information for a particular connection associated with a leaf node of the ATM network. If a data structure in the indicated linked list has a VPI/VCI value matching the VPI/VCI value in the received cell header, the routing information for the next link of the call connection is retrieved, and the cell header information is validated.

Exact methods based on node routing formulations for arc routing problems

Abstract: This paper proposes a new transformation of arc routing problems into equivalents node routing problems, with emphasis on the transformation of Capacitated Arc Routing Problems (CARP) into Capacitated Vehicle Routing Problems (CVRP). For this last case, an analogue transformation has already been proposed in Pearn et al. [21], where each required CARP arc was mapped onto a triplet of CVRP nodes. In our case, only 2 CVRP nodes are needed for every CARP required arc. The transformed instances have a structure and a dimension which make most CARP benchmarks solvable by state of the art CVRP techniques. We thus propose a general purpose transformation of arc into node routing problems and new results on lower bounds and exact methods for CARP instances. . DISMI, University of Modena and Reggio Emilia, Viale Allegri 13, 42100 Reggio Emilia, Italy. . Department of Computer Science, University of Bologna, Mura Anteo Zamboni, 7 40127 Bologna, Italy.

Traffic steering in software defined networks: planning and online routing

Abstract: Middleboxes have become ubiquitous in data center as well as wide area networks Simple routing of flows from ingress to egress along shortest paths has been replaced by policy aware paths that have to pass through the required set of middleboxes The complex routing is one of the major impetus for the Software Defined Networking (SDN) paradigm In this paper, we consider both offline planning and online routing problems in SDN framework The offline planning problem is one where aggregate demands are specified and the objective is to determine whether there is enough capacity in the network to handle the demands We develop a fast FPTAS for the problem based on segmentation and lazy dual update In the online routing problem, flow requests are given one at a time and the objective is to steer the flows to maximize the total amount of traffic accepted over time We develop a log-competitive algorithm based on time-dependent duals