research-article

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

Authors:

Dingyu YangAuthors Info & Claims

SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data

Pages 665 - 679

https://doi.org/10.1145/3318464.3389735

Published: 31 May 2020 Publication History

Abstract

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.

Supplementary Material

MP4 File (3318464.3389735.mp4)

Presentation Video

Download
104.93 MB

References

[1]

Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In ACM SIGMOD International Conference on Management of Data, 2013. 349--360.

Digital Library

[2]

Anonymous. 2019. Anonymous technique report. (2019).

[3]

Sabeur Aridhi, Philippe Lacomme, Libo Ren, and Benjamin Vincent. 2015. A MapReduce-based approach for shortest path problem in large-scale networks. Engineering Applications of Artificial Intelligence, Vol. 41 (2015), 151--165.

Digital Library

[4]

Baruch Awerbuch. 1989. Distributed Shortest Paths Algorithms. In Proceedings of the 21th annual ACM symposium on Theory of computing, 1998. 490--500.

[5]

Fleischmann Bernhard, Gietz Martin, and Gnutzmann Stefan. 2004. Time-Varying Travel Times in Vehicle Routing. Transportation Science, Vol. 38, 2 (2004), 121--255.

[6]

K Mani Chandy and Jayadev Misra. 1982. Distributed computation on graphs: Shortest path algorithms. Programming Techniques and Data Structures (1982), 833--837.

Digital Library

[7]

Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Jian Pei. 2015. Efficiently computing top-k shortest path join. In Proceedings of the 18th International Conference on Extending Database Technology (EDBT), 2015. 133--144.

[8]

DIMACS. 2005. http://users.diag.uniroma1.it/challenge9. (2005).

[9]

Michael Elkin. 2017. Distributed exact shortest paths in sublinear time. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing, 2017. 757--770.

Digital Library

[10]

David Eppstein. 1998. Finding the k shortest paths. SIAM Journal on computing, Vol. 28, 2 (1998), 652--673.

[11]

Wenfei Fan, Xin Wang, and Yinghui Wu. 2012. Performance guarantees for distributed reachability queries. In Proceedings of the VLDB Endowment, 2012, Vol. 5. 1304--1316.

Digital Library

[12]

Sebastian Forster and Danupon Nanongkai. 2018. A Faster Distributed Single-Source Shortest Paths Algorithm. In IEEE 59th Annual Symposium on Foundations of Computer Science, 2018 .

[13]

Jun Gao, Huida Qiu, Xiao Jiang, Tengjiao Wang, and Dongqing Yang. 2010. Fast top-k simple shortest paths discovery in graphs. In 19th ACM International Conference on Information and Knowledge Management, 2010. 509--518.

Digital Library

[14]

Jun Gao, Jeffrey Yu, Huida Qiu, Xiao Jiang, Tengjiao Wang, and Dongqing Yang. 2012. Holistic top-k simple shortest path join in graphs. IEEE Transactions on Knowledge and Data Engineering, Vol. 24, 4 (2012), 665--677.

Digital Library

[15]

Mohsen Ghaffari and Jason Li. 2018. Improved Distributed Algorithms for Exact Shortest Paths. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 .

Digital Library

[16]

Jiawei Han, Jian Pei, and Yiwen Yin. 2000. Mining frequent patterns without candidate generation. In ACM SIGMOD International Conference on Management of Data, 2000. 1--12.

Digital Library

[17]

Bast Hannah, Delling Daniel, Goldberg Andrew, Muller-Hannemann Matthias, Pajor Thomas, Sanders Peter, Wagner Dorothea, and Renato F. Werneck. 2016. Route Planning in Transportation Networks. Algorithm Engineering (2016), 19--80.

[18]

John Hershberger, Matthew Maxel, and Subhash Suri. 2007. Finding the k shortest simple paths: A new algorithm and its implementation. ACM Transactions on Algorithms, Vol. 3, 4 (2007).

Digital Library

[19]

John Hershberger and Subhash Suri. 2001. Vickrey prices and shortest paths: What is an edge worth?. In IEEE International Conference on Cluster Computing, 2001. 252--259.

[20]

Naoki Katoh, Toshihide Ibaraki, and Hisashi Mine. 1982. An efficient algorithm for k shortest simple paths. Networks, Vol. 12, 4 (1982), 411--427.

[21]

Huiping Liu, Cheqing Jin, Bin Yang, and Aoying Zhou. 2018. Finding top-k shortest paths with diversity. IEEE Transactions on Knowledge and Data Engineering, Vol. 30, 3 (2018), 488--502.

[22]

Kun Qiu, Yuanyang Zhu, Jing Yuan, Jin Zhao, Xin Wang, and Tilman Wolf. 2018. ParaPLL: Fast Parallel Shortest-path Distance Query on Large-scale Weighted Graphs. In Proceedings of the 47th International Conference on Parallel Processing, 2018 .

Digital Library

[23]

Grégoire Scano, Marie-José Huguet, and Sandra Ulrich Ngueveu. 2015. Adaptations of k-shortest path algorithms for transportation networks. In International Conference on Industrial Engineering and Systems Management, 2015. 663--669.

[24]

Rahul C Shah and Jan M Rabaey. 2002. Energy aware routing for low energy ad hoc sensor networks. In IEEE Wireless Communications and Networking Conference Record, Vol. 1. 350--355.

[25]

Apache Storm. 2019. http://storm.apache.org/.

[26]

Dingyu Yang, Dongxiang Zhang, Kian-Lee Tan, Jian Cao, and Frédéric Le Mouël. 2014. CANDS: continuous optimal navigation via distributed stream processing. In Proceedings of the VLDB Endowment, 2014. 137--148.

Digital Library

[27]

Jin Y. Yen. 1971. Finding the k shortest loopless paths in a network. Management Science, Vol. 17, 11 (1971), 712--716.

Digital Library

[28]

Libin Zheng, Lei Chen, and Jieping Ye. 2018. Order Dispatch in Price-aware Ridesharing. In Proceedings of the VLDB Endowment, 2018 .

Digital Library

[29]

Libin Zheng, Peng Cheng, and Lei Chen. 2019. Auction-Based Order Dispatch and Pricing in Ridesharing. In IEEE 35th International Conference on Data Engineering (ICDE), 2019 .

Cited By

Yu ZYu XKoudas NChen YLiu Y(2024) A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks IEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3346377(1-14)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3346377
Zhao JLi LZhang MLuo ZZhao XZhou X(2024)A Just-In-Time Framework for Continuous Routing2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00350(4600-4613)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00350
Wang LWong RJensen C(2024)Congestion-Mitigating Spatiotemporal Routing in Road Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00349(4586-4599)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00349
Show More Cited By

Index Terms

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
1. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Branch-and-bound
      2. Divide and conquer

Recommendations

Processing time-dependent shortest path queries without pre-computed speed information on road networks

Shortest path (or least travel time path) identification has been actively studied for direct application to road networks. In addition, the processing of time-dependent shortest-path queries, which use past traffic data to compute the speed variations ...
Dynamic Shortest Path Queries over Moving Objects on Road Networks
Spatial Data and Intelligence
Abstract
With the development of intelligent mobile devices and communication technology, moving objects have become a hot research topic. This paper studies the moving objects on the road network, and a dynamic shortest path query algorithm is proposed to ...
Low time complexity algorithms for path computation in Cayley Graphs
Abstract
We study the problem of path computation in Cayley Graphs (CG) from an approach of word processing in groups. This approach consists in encoding the topological structure of CG in an automaton called Diff, then techniques of word ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data

June 2020

2925 pages

ISBN:9781450367356

DOI:10.1145/3318464

General Chairs:
David Maier
Portland State University, USA
,
Rachel Pottinger
University of British Columbia, Canada
,
Program Chairs:
AnHai Doan
University of Wisconsin, USA
,
Wang-Chiew Tan
Megagon Labs, USA
,
Publications Chairs:
Abdussalam Alawini
University of Illinois at Urbana-Champaign, USA
,
Hung Q. Ngo
RelationalAI, USA

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Natural Science Foundation of China

Conference

SIGMOD/PODS '20

Sponsor:

SIGMOD

SIGMOD/PODS '20: International Conference on Management of Data

June 14 - 19, 2020

OR, Portland, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
814
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)10

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Yu ZYu XKoudas NChen YLiu Y(2024) A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks IEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3346377(1-14)Online publication date: 2024
https://doi.org/10.1109/TKDE.2023.3346377
Zhao JLi LZhang MLuo ZZhao XZhou X(2024)A Just-In-Time Framework for Continuous Routing2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00350(4600-4613)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00350
Wang LWong RJensen C(2024)Congestion-Mitigating Spatiotemporal Routing in Road Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00349(4586-4599)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00349
Mostafa AMokbel MRenz MNascimento M(2023)Towards Open-Source Maps MetadataProceedings of the 31st ACM International Conference on Advances in Geographic Information Systems10.1145/3589132.3625576(1-4)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3589132.3625576
Cai KDai TLin QSong XZhou WZhou QWei JWang FChen HLi B(2023)Route Planning Based on Parallel Optimization in the Air-Ground Integrated NetworkIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.323493624:12(15762-15772)Online publication date: Dec-2023
https://doi.org/10.1109/TITS.2023.3234936
Sun FYu JHao RYang MKong F(2023)Privacy-Preserving Shortest Distance Query for Dynamic Large-Scale Road NetworkIEEE Systems Journal10.1109/JSYST.2023.323880917:2(1729-1740)Online publication date: Jun-2023
https://doi.org/10.1109/JSYST.2023.3238809
Xu YLi LZhang MXu ZZhou X(2023)Global Routing Optimization In Road Networks2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00194(2524-2537)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00194
D’ascenzo AD’emidio M(2023)Top-k Distance Queries on Large Time-Evolving GraphsIEEE Access10.1109/ACCESS.2023.331660211(102228-102242)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3316602
Chang MDing ZLi LJia NTian J(2023)Coarse-Grained Path Planning Under Dynamic Situational EnvironmentSpatial Data and Intelligence10.1007/978-3-031-24521-3_1(3-18)Online publication date: 18-Jan-2023
https://doi.org/10.1007/978-3-031-24521-3_1
Luo ZLi LZhang MHua WXu YZhou X(2022)Diversified top-k route planning in road networkProceedings of the VLDB Endowment10.14778/3551793.355186315:11(3199-3212)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551863
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents