Paper Info
Title
The K Shortest Paths Problem with Application to Routing.
Abstract
We present a simple algorithm for explicitly computing all k shortest paths bounded by length L from a fixed source to a target in O(m + kL) and O(mlogm + kL) time for unweighted and weighted directed graphs with m edges respectively. For many graphs, this outperforms existing algorithms by exploiting the fact that real world networks have short average path length. Consequently, we would like to adapt our almost shortest paths algorithm to find an efficient solution to the almost short- est simple paths, where we exclude paths that visit any node more than once. To this end, we consider realizations from the Chung-Lu random graph model as the Chung-Lu random graph model is not only amenable to analysis, but also emulates many of the properties frequently observed in real world networks including the small world phenomenon and degree heterogeneity. We provide theoretical and numeric evidence regarding the efficiency of utilizing our almost shortest paths algorithm to find al- most shortest simple paths for Chung-Lu random graphs for a wide range of parameters. Finally, we consider a special application of our almost shortest paths algorithm to study internet routing (withdrawals) in the Autonomous System graph.
Year
Venue
Field
2016
arXiv: Data Structures and Algorithms
Average path length,Discrete mathematics,Combinatorics,Path (graph theory),Johnson's algorithm,Floyd–Warshall algorithm,Yen's algorithm,Suurballe's algorithm,Shortest Path Faster Algorithm,Mathematics,K shortest path routing
DocType
Volume
Citations 
Journal
abs/1610.06934
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
David Burstein1744.44
Leigh Metcalf200.34