A Distributed Solution for Efficient <italic>K</italic> Shortest Paths Computation Over Dynamic Road Networks
Pages 2759 - 2773
Abstract
The problem of identifying the <italic>k</italic>-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 <inline-formula><tex-math notation="LaTeX">$(i+1)\text{th}$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo><mml:mtext>th</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href="yu-ieq1-3346377.gif"/></alternatives></inline-formula> shortest path is generated based on the <inline-formula><tex-math notation="LaTeX">$i\text{th}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>i</mml:mi><mml:mtext>th</mml:mtext></mml:mrow></mml:math><inline-graphic xlink:href="yu-ieq2-3346377.gif"/></alternatives></inline-formula> shortest path), restricting their scalability and applicability in a distributed setting. We therefore propose KSP-DG, a distributed algorithm for identifying <italic>k</italic>-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 in an efficient and compact fashion, 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.
References
[1]
S. Shang, L. Chen, Z. Wei, C. S. Jensen, J.-R. Wen, and P. Kalnis, “Collective travel planning in spatial networks,” IEEE Trans. Knowl. Data Eng., vol. 28, no. 5, pp. 1132–1146, May 2016.
[2]
Z. Yu et al., “Distributed processing of k shortest path queries over dynamic road networks,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2020, pp. 665–679.
[3]
H. Liu, C. Jin, B. Yang, and A. Zhou, “Finding top-k shortest paths with diversity,” IEEE Trans. Knowl. Data Eng., vol. 30, no. 3, pp. 488–502, Mar. 2018.
[4]
J. Y. Yen, “Finding the k shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, 1971.
[5]
N. Katoh, T. Ibaraki, and H. Mine, “An efficient algorithm for k shortest simple paths,” Networks, vol. 12, no. 4, pp. 411–427, 1982.
[6]
D. Eppstein, “Finding the k shortest paths,” SIAM J. Comput., vol. 28, no. 2, pp. 652–673, 1998.
[7]
J. Hershberger, M. Maxel, and S. Suri, “Finding the k shortest simple paths: A new algorithm and its implementation,” ACM Trans. Algorithms, vol. 3, no. 4, pp. 45–es, 2007.
[8]
J. Gao, H. Qiu, X. Jiang, T. Wang, and D. Yang, “Fast top-k simple shortest paths discovery in graphs,” in Proc. ACM Int. Conf. Inf. Knowl. Manage., 2010, pp. 509–518.
[9]
J. Gao, J. Yu, H. Qiu, X. Jiang, T. Wang, and D. Yang, “Holistic top-k simple shortest path join in graphs,” IEEE Trans. Knowl. Data Eng., vol. 24, no. 4, pp. 665–677, Apr. 2012.
[10]
K. M. Chandy and J. Misra, “Distributed computation on graphs: Shortest path algorithms,” Program. Techn. Data Structures, vol. 25, pp. 833–837, 1982.
[11]
B. Awerbuch, “Randomized distributed shortest paths algorithms,” in Proc. Annu. ACM Symp. Theory Comput., 1989, pp. 490–500.
[12]
M. Elkin, “Distributed exact shortest paths in sublinear time,” in Proc. Annu. ACM Symp. Theory Comput., 2017, pp. 757–770.
[13]
M. Ghaffari and J. Li, “Improved distributed algorithms for exact shortest paths,” in Proc. Annu. ACM Symp. Theory Comput., 2018, pp. 431–444.
[14]
S. Aridhi, P. Lacomme, L. Ren, and B. Vincent, “A mapreduce-based approach for shortest path problem in large-scale networks,” Eng. Appl. Artif. Intell., vol. 41, pp. 151–165, 2015.
[15]
K. Qiu, Y. Zhu, J. Yuan, J. Zhao, X. Wang, and T. Wolf, “ParaPLL: Fast parallel shortest-path distance query on large-scale weighted graphs,” in Proc. 47th Int. Conf. Parallel Process., 2018, pp. 1–10.
[16]
W. Fan, X. Wang, and Y. Wu, “Performance guarantees for distributed reachability queries,” in Proc. VLDB Endowment, 2012, pp. 1304–1315.
[17]
D. Yang, D. Zhang, K.-L. Tan, J. Cao, and F. Le Mouël, “Cands: Continuous optimal navigation via distributed stream processing,” in Proc. VLDB Endowment, 2014, pp. 137–148.
[18]
S. Shang, L. Chen, Z. Wei, C. S. Jensen, K. Zheng, and P. Kalnis, “Trajectory similarity join in spatial networks,” in Proc. VLDB Endowment, 2017, pp. 1178–1189.
[19]
B. Yao et al., “Distributed in-memory analytics for big temporal data,” in Proc. Int. Conf. Database Syst. Adv. Appl., 2018, pp. 549–565.
[20]
L. Chen, S. Shang, C. S. Jensen, B. Yao, and P. Kalnis, “Parallel semantic trajectory similarity join,” in Proc. IEEE Int. Conf. Data Eng., 2020, pp. 997–1008.
[21]
R. Anand and U. Jeffrey David, Mining of Massive Datasets. Cambridge, U.K.: Cambridge Univ. Press, 2011.
[22]
J. Leskovec, A. Rajaraman, and J. D. Ullman, Mining of Massive Datasets, New York, NY, USA: Cambridge Univ. Press, 2014.
[23]
D. Ajwani, E. Duriakova, N. Hurley, U. Meyer, and A. Schickedanz, “An empirical comparison of k-shortest simple path algorithms on multicores,” in Proc. 47th Int. Conf. Parallel Process., 2018, pp. 1–12.
[24]
G. Feng, “Finding k shortest simple paths in directed graphs: A node classification algorithm,” Networks, vol. 64, no. 1, pp. 6–17, 2014.
[25]
“Apache storm,” 2019. [Online]. Available: http://storm.apache.org/
[26]
DIMACS, 2005. [Online]. Available: http://users.diag.uniroma1.it/challenge9
[27]
F. Bernhard, G. Martin, and G. Stefan, “Time-varying travel times in vehicle routing,” Transp. Sci., vol. 38, no. 2, pp. 121–255, 2004.
[28]
B. Hannah et al., “Route planning in transportation networks,” in Algorithm Engineering, Berlin, Germany: Springer, 2016, pp. 19–80.
[29]
J. Hershberger and S. Suri, “Vickrey prices and shortest paths: What is an edge worth?,” in Proc. IEEE Int. Conf. Cluster Comput., 2001, pp. 252–259.
[30]
L. Chang, X. Lin, L. Qin, J. X. Yu, and J. Pei, “Efficiently computing top-k shortest path join,” in Proc. 18th Int. Conf. Extending Database Technol., 2015, pp. 133–144.
[31]
Z. Luo, L. Li, M. Zhang, W. Hua, Y. Xu, and X. Zhou, “Diversified top-k route planning in road network,” in Proc. VLDB Endowment, 2022, pp. 3199–3212.
[32]
S. Forster and D. Nanongkai, “A faster distributed single-source shortest paths algorithm,” in Proc. IEEE 59th Annu. Symp. Foundations Comput. Sci., 2018, pp. 686–697.
[33]
Y. Li, Y. Yuan, Y. Wang, X. Lian, Y. Ma, and G. Wang, “Distributed multimodal path queries,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 7, pp. 3196–3210, Jul., 2022.
[34]
T. Akiba, Y. Iwata, and Y. Yoshida, “Fast exact shortest-path distance queries on large networks by pruned landmark labeling,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2013, pp. 349–360.
[35]
S. Shang, L. Chen, Z.-W. Wei, D.-H. Guo, and J.-R. Wen, “Dynamic shortest path monitoring in spatial networks,” J. Comput. Sci. Technol., vol. 31, pp. 637–648, 2016.
Recommendations
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of DataThe 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 ...
Partially dynamic efficient algorithms for distributed shortest paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the ...
On shortest disjoint paths in planar graphs
For a graph G and a collection of vertex pairs {(s"1,t"1),...,(s"k,t"k)}, the k disjoint paths problem is to find k vertex-disjoint paths P"1,...,P"k, where P"i is a path from s"i to t"i for each i=1,...,k. In the corresponding optimization problem, the ...
Comments
Information & Contributors
Information
Published In
1041-4347 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 July 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Feb 2025