Shortest Path Routing Strategy Research Articles

A multiple-path routing strategy for vehicle route guidance systems

This paper analyzes the transportation effectiveness of a multiple-path routing strategy using traffic simulation from the perspective of planning and designing a vehicle route guidance system. The test results indicate that the multiple-path routing strategy performs better than the commonly used shortest-path routing strategy.

Embedding All Binary Trees in the Hypercube

An O(N2) heuristic algorithm is presented that embeds all binary trees, with dilation 2 and small average dilation, into the optimal-sized hypercube. The heuristic relies on a conjecture about all binary trees containing a perfect matching. It provides a practical and robust technique for mapping binary trees into the hypercube and ensures that the communication load is evenly distributed across the network assuming any shortest path routing strategy. One contribution of this work is the identification of a rich collection of binary trees that can be easily mapped into the hypercube.

Space-Efficient Message Routing inc-Decomposable Networks

The problem of routing messages along near-shortest paths in a distributed network without using complete routing tables is considered. It is assumed that the nodes of the network can be assigned suitable short names at the time the network is established. Two space-efficient near- shortest path routing schemes are given for any class of networks whose members can be decomposed recursively by a separator of size at most a constant c, where $c \geqslant 2$. For an n-node network, the first scheme uses a total of $O(cn \log n)$ items of routing information, each $O(\log n)$ bits long, and $O(\log n)$-bit names, generated from a separator-based decomposition of the network, to achieve routings that are at most three times longer than shortest routings in worst case.l The second scheme augments the node names with $O(c \log c \log n)$ additional bits and uses this to reduce the bound on the routings to $(2 / \alpha) + 1$, where $\alpha, 1 < \alpha \leq 2$, is the root of the equation $\alpha ^{\lceil (c+1) / ...

A new responsive distributed shortest-path rounting algorithm

Distributed shortest-path routing algorithms based on the Ford-Fulkerson method are simple to implement but they suffer from the cost-dependent looping problem: when link costs increase, routing table loops may form and convergence to correct paths may be too slow, depending on link costs. This problem can be eliminated if constraints are imposed on the order in which routing tables are updated at different nodes but the resulting internode protocols tend to be relatively complex. Furthermore, update constraints may restrict a node's ability to obtain alternate paths quickly in an environment where topology changes are frequent. In this paper, a new distributed shortest-path routing scheme based on the Ford-Fulkerson method is presented. Under the new scheme, each node uses partial topology information to eliminate the cost-dependent looping problem. No update constraints are imposed and no assumptions are made regarding link costs. In the worst case, the new scheme responds to link cost changes in O(D) update steps, where D is the diameter of the network after the occurrence of the changes.