The K Shortest Paths Problem with Application to Routing

MaRDI QIDQ6278902FDO

Authors David Burstein, Leigh Metcalf

Publication date 21 October 2016

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Abstract: Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted real-world networks. First, we present an easy to implement $O(mlogm+kL)$ solution for finding all (nonbacktracking) paths with bounded length $D$ between two arbitrary nodes on a positively weighted graph, where $L$ is an upperbound for the number of nodes in any of the $k$ outputted paths. Subsequently, we illustrate that for undirected Chung-Lu random graphs, the ratio between the number of nonbacktracking and simple paths asymptotically approaches $1$ with high probability for a wide range of parameters. We then consider an application to the almost shortest paths algorithm to measure path diversity for internet routing in a snapshot of the Autonomous System graph subject to an edge deletion process.

This page was built for publication: The K Shortest Paths Problem with Application to Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278902)