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.

Automatic global routing device for efficiently determining optimum wiring route on integrated circuit and global routing method therefor

Abstract: Automatic routing device which automatically conducts placement and routing of integrated circuits on an integrated circuit chip, including a wire capacitance calculating unit, a degree of wire congestion calculating unit and a routing checking unit for determining whether routing of a desired net is possible or not based on a degree of wire congestion at each global routing cell boundary formed by the division of a logic circuit chip to be processed into global routing cells, and a number of grids calculating units, a grid use rate calculating unit and a grid use rate checking unit for determining whether routing of a desired net is possible or not based on a state of the use of a routing track grid in each global routing cell formed on the logic circuit chip.

Chapter 5 Arc routing methods and applications

Abstract: Publisher Summary The term "arc routing" refers to routing problems where the key service activity is to cover arcs of a transportation network. In contrast to node routing, where the key service activity occurs at the nodes (customer sites) and arcs are of interest only as elements of paths that connect the nodes, arc routing focuses on the traversal of edges. Practical examples include the routing of street sweepers, snow-plowing, salt gritting (covering streets with salt grit), and inspection of streets for maintenance, postal delivery, and meter reading. In all examples, each street segment must be covered in its entirety. In meter reading, postal delivery, and the delivery of telephone books, the density of the customer locations along a street segment is sufficiently high to consider the street segment as a whole as the service entity. The basic methodology of arc routing by discussing generic arc routing models and their solution techniques is discussed. The chapter covers well-known postman problems that can be regarded as the classical problems of arc routing. The basic objective of these problems is to cover all arcs of a given network with an Euler cycle of minimum cost. The chapter considers the capacitated arc routing problem, where each vehicle tour (cycle) must observe an explicit capacity constraint. Two manufacturing problems that can be modeled as rural postman problems and also mentions other routing applications are discussed in the chapter.

A multi-parametric evolution strategies algorithm for vehicle routing problems

Abstract: Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational testing on six real-life problems and 195 benchmark problems demonstrate that the suggested algorithm is efficient and highly competitive, improving or matching the current best-known solution in 42% of the test cases.

The message flow model for routing in wormhole-routed networks

Abstract: In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. This method may be used to develop deterministic, partially-adaptive, and fully-adaptive routing algorithms for wormhole-routed networks with arbitrary topologies. We first establish the necessary and sufficient condition for deadlock free routing, based on the analysis of the message flow on each channel. We then use the model to develop new adaptive routing algorithms for 2D meshes. >

Apparatus and method for routing data packets through a communications network

Abstract: A method and apparatus (25) for determining the next router (25, 26, 27, 28) that a data packet is transmitted to on its way to a destination host (33-35) by traversing a routing table (41) using a hardware search engine (46) and a unique search tree (Fig. 16). The step of traversing each node in the search tree (Fig. 16) takes only one memory cycle, decreasing in half the time it takes to search a routing table (41) and thus forward data packets on a system of computer networks (8). This is accomplished by storing the decision bit for each node in its parent node rather than in the node itself. The apparatus may use a hardware search engine (46) to search the routing table (41).