Log In Sign Up

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

by   Ziqiang Yu, et al.

The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Very often such services have to process numerous KSP queries over large road networks at the same time, thus there is a pressing need to identify distributed solutions for this problem. However, most existing approaches are designed to identify KSPs on a static graph in a sequential manner (i.e., the (i+1)-th shortest path is generated based on the i-th shortest path), restricting their scalability and applicability in a distributed setting. We therefore propose KSP-DG, a distributed algorithm for identifying k-shortest paths in a dynamic graph. It is based on partitioning the entire graph into smaller subgraphs, and reduces the problem of determining KSPs into the computation of partial KSPs in relevant subgraphs, which can execute in parallel on a cluster of servers. A distributed two-level index called DTLP is developed to facilitate the efficient identification of relevant subgraphs. A salient feature of DTLP is that it indexes a set of virtual paths that are insensitive to varying traffic conditions, leading to very low maintenance cost in dynamic road networks. This is the first treatment of the problem of processing KSP queries over dynamic road networks. Extensive experiments conducted on real road networks confirm the superiority of our proposal over baseline methods.


page 1

page 2

page 3

page 4


Finding k-Dissimilar Paths with Minimum Collective Length

Shortest path computation is a fundamental problem in road networks. How...

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks

Finding the shortest paths in road network is an important query in our ...

Inferring Routing Preferences of Bicyclists from Sparse Sets of Trajectories

Understanding the criteria that bicyclists apply when they choose their ...

Collective Shortest Paths for Minimizing Congestion on Temporal Load-Aware Road Networks

Shortest path queries over graphs are usually considered as isolated tas...

Online shortest paths with confidence intervals for routing in a time varying random network

The increase in the world's population and rising standards of living is...

Space-efficient, Fast and Exact Routing in Time-dependent Road Networks

We study the problem of computing shortest paths in massive road network...