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.

The optimal routing problem in the context of battery-powered electric vehicles

Abstract: Electric vehicles (EV) powered by batteries will play a sig- nificant role in the road traffic of the future. The unique characteristics of such EVs – limited cruising range, long recharge times, and the ability to regain energy during deceleration – require novel routing algorithms, since the task is now to determine the most economical route rather than just the shortest one. This paper proposes extensions to general shortest- path algorithms that address the problem of energy-optimal routing. Specifically, we (i) formalize energy-efficient routing in the presence of rechargeable batteries as a special case of the constrained shortest path problem (CSPP) with hard and soft constraints, and (ii) present an adap- tion of a general shortest path algorithm (using an energy graph, i.e., a graph with a weight function representing the energy consumption) that respects the given constraints and has a worst case complexity of O(n3). The presented algorithms have been implemented and evaluated within a prototypic navigation system for energy-efficient routing.

Three-dimensional switch providing packet routing between multiple multimedia buses

Abstract: A method and data network for routing data packets is described. Switches are connected in a three-dimensional architecture (11) to form a switching fabric providing horizontal data routing according to addresses and vertical data routing according to packet types. An allocation procedure is then executed to manage the bandwidth resources of said fabric resulting with assigning routing tables at the switches and portals, prior to forwarding packets to the switch fabric a hop-by-hop packet flow is executed through said switches of said switch fabric. Packet flow is controlled by an output port having an output port state machine and an output port concentrator.

Method for automatically routing circuits of very large scale integration (VLSI)

Abstract: An automated routing tool for routing interconnections between circuit elements, standard cells and/or cell blocks of cell-based designs which incorporates the best features of both currently known gate array routing techniques with currently known cell-based routing techniques. The invention eliminates the disadvantages of permitting the detailed router to adjust the relative positions of the circuit elements, standard cells and/or cell blocks during the detailed routing process. The method employs a topology manager which iteratively compacts the circuit topology while at the same time optimizing the routing of the interconnections among the circuit elements, standard cells and/or cell blocks of the circuit design. The method employs bin-based global routing, which identifies expandable boundaries and which provides input to a compaction routine which expands or contracts the expandable areas in accordance with the result of the global routing process. The detailed routing step is not performed until after the relative positions of the circuit elements, cells and/or cell blocks have been already fixed.

Analytical Modeling of Multi-hop IEEE 802.15.4 Networks

Abstract: Many of existing analytical studies of the IEEE 802154 medium access control (MAC) protocol are not adequate because they are often based on assumptions such as homogeneous traffic and ideal carrier sensing, which are far from reality for multi-hop networks, particularly in the presence of mobility In this paper, a new generalized analysis of the unslotted IEEE 802154 MAC is presented The analysis considers the effects induced by heterogeneous traffic due to multi-hop routing and different traffic generation patterns among the nodes of the network and the hidden terminals due to reduced carrier-sensing capabilities The complex relation between MAC and routing protocols is modeled, and novel results on this interaction are derived For various network configurations, conditions under which routing decisions based on packet loss probability or delay lead to an unbalanced distribution of the traffic load across multi-hop paths are studied It is shown that these routing decisions tend to direct traffic toward nodes with high packet generation rates, with potential catastrophic effects for the node's energy consumption It is concluded that heterogeneous traffic and limited carrier-sensing range play an essential role on the performance and that routing should account for the presence of dominant nodes to balance the traffic distribution across the network

A Class of Decentralized Routing Algorithms Using Relaxation

Abstract: An important problem in packet-switched communication networks is the optimal assignment of routes to the message packets. An optimal routing assignment is one which chooses network paths for the packets in a way that minimizes some cost function, typically average message delay. A class of optimal routing algorithms is described which utilize a type of iterative computation known as relaxation. Computation is decentralized in the sense that each node computes its routing strategy using only information supplied from adjacent nodes. Being iterative, the algorithms are inherently adaptive. The routing computation is based conceptually on an electrical network analog for the optimization problem. We show that a simple, convergent relaxation procedure can be used to "solve" the analog network, thereby yielding the optimal routing strategy. A simple example is presented to illustrate the method. In general, the computational load compares favorably with other (centralized) methods, although further work is needed to obtain quantitive comparisons in specific cases.