An efficient algorithm for K shortest simple paths

Katoh, Naoki; Ibaraki, Toshihide; Mine, Hisashi

doi:10.1002/net.3230120406

Cited by 225 publications

(138 citation statements)

References 22 publications

Supporting

Mentioning

132

Contrasting

Unclassified

Order By: Relevance

“…, K}, and the new paths are candidates to a future p j , with j > k, therefore they are stored in X. The paths to be generated from each p k are the quickest in a partition of path sets proposed by Katoh et al [4].…”

Section: A Review Of the K-quickest Path Algorithmmentioning

confidence: 99%

Internet packet routing: Application of a K-quickest path algorithm

Clímaco

Pascoal

Craveirinha

et al. 2007

European Journal of Operational Research

View full text Add to dashboard Cite

This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely its self-similar stochastic nature. Results concerning the average CPU times of the algorithm for the different sets of experiments will be presented and discussed.

show abstract

Section: A Review Of the K-quickest Path Algorithmmentioning

confidence: 99%

Internet packet routing: Application of a K-quickest path algorithm

Clímaco

Pascoal

Craveirinha

et al. 2007

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…On the one hand we have adaptations of K shortest loopless path algorithms, while on the other hand we can consider a generalisation of the methods used to solve the quickest path problem. In the first group we describe the approaches by Rosen, Sun, and Xue (1991), which is an adaptation of the algorithm by Yen (1971), and Pascoal, Captivo, and Clímaco (2005), who, in turn, adapted the algorithm by Katoh, Ibaraki, and Mine (1982). In the second we review the algorithm by Chen (1994).…”

Section: Ranking K Quickest Loopless Pathsmentioning

confidence: 99%

“…, K . The difference between the two algorithms is the partition used to generate new candidates to store in X , as presented by Katoh, Ibaraki, and Mine (1982). Let p j be the parent of some loopless path p k and:…”

Section: B R ) ← Arc Bandwidth Values By Increasing Ordermentioning

confidence: 99%

See 1 more Smart Citation

A comprehensive survey on the quickest path problem

2006

View full text Add to dashboard Cite

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results. Keywords Bicriteria problem . Minsum-maxmin . Quickest path . Paths rankingThe quickest path problem is a particular case of optimal path problems, whose objective function evaluates the time taken to transmit a given amount of data through each path. This function depends on two parameters, an additive function that represents the path delay, and a bottleneck function that represents the path capacity or bandwidth. Thus, the resolution of

show abstract

“…In the ÿrst class, Yen [13] proposed a very e cient algorithm that ÿnds the ÿrst K simple paths in a general network in O(K|V | 3 ) time, where |V | is the number of nodes. Katoh et al [14] improved the time bound to be O(K(|A| + |V | log|V |)) for an undirected network, where |A| is the number of arcs. Recently, Hadjiconstantinou and Christoÿdes [15] presented an e cient implementation of a KSP algorithm based on the method of Katoh et al [14]; they suggested that the KSP algorithm is suitable for ÿnding a large number of simple paths between any pair of nodes.…”

Section: Introductionmentioning

confidence: 99%

Finding K shortest looping paths in a traffic-light network

Yang

Chen

2005

Computers & Operations Research

View full text Add to dashboard Cite

In this paper we consider a tra c-light network where every node in the network is associated with the constraint consisting of a repeated sequence of time windows. The constraint aims to simulate the operations of tra c-light control in an intersection of roads. With this kind of constraints in place, directions of routes when passing through the intersections can be formally modeled. The objective of this paper is to ÿnd the ÿrst K shortest looping paths in the tra c-light network. An algorithm of time complexity of O(rK 2 |V 1 | 3 ) is developed, where r is the number of di erent windows of a node and |V 1 | is the number of nodes in the original network. ?

show abstract

An efficient algorithm for K shortest simple paths

Abstract: This article gives an efficient algorithm for obtaining K shortest simple paths between two specified nodes in an undirected graph G with non-negative edge lengths. Letting n be the number of nodes and m be the number of edges in G, its running time is

Cited by 225 publications

References 22 publications

Internet packet routing: Application of a K-quickest path algorithm

Internet packet routing: Application of a K-quickest path algorithm

A comprehensive survey on the quickest path problem

Finding K shortest looping paths in a traffic-light network

Contact Info

Product

Resources

About