Efficient single-pair all-shortest-path query processing for massive dynamic networks

2021 ◽  
Vol 546 ◽  
pp. 1306-1327
Author(s):  
Sun Geol Baek ◽  
Sungkil Lee ◽  
Young Ik Eom
Keyword(s):  
Query Processing ◽  
Shortest Path ◽  
Dynamic Networks ◽  
Single Pair ◽  
Shortest Path Query

Distributed shortest path query processing on dynamic road networks

2017 ◽  
Vol 26 (3) ◽  
pp. 399-419 ◽  
Author(s):  
Dongxiang Zhang ◽  
Dingyu Yang ◽  
Yuan Wang ◽  
Kian-Lee Tan ◽  
Jian Cao ◽  
...  
Keyword(s):  
Query Processing ◽  
Shortest Path ◽  
Road Networks ◽  
Shortest Path Query ◽  
Dynamic Road Networks

Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query

2017 ◽  
Vol 96 (2) ◽  
pp. 2305-2322 ◽  
Author(s):  
Lei Zhang ◽  
Jing Li ◽  
Songtao Yang ◽  
Bin Wang
Keyword(s):  
Shortest Path ◽  
Privacy Preserving ◽  
Cloud Environment ◽  
Shortest Path Query

An experimental evaluation and guideline for path finding in weighted dynamic network

2021 ◽  
Vol 14 (11) ◽  
pp. 2127-2140
Author(s):  
Mengxuan Zhang ◽  
Lei Li ◽  
Xiaofang Zhou
Keyword(s):  
Shortest Path ◽  
State Of The Art ◽  
Dynamic Networks ◽  
Real Life ◽  
Dynamic Network ◽  
Problem Space ◽  
Network Applications ◽  
Complete Problem ◽  
Path Computation ◽  
Shortest Path Computation

Shortest path computation is a building block of various network applications. Since real-life networks evolve as time passes, the Dynamic Shortest Path (DSP) problem has drawn lots of attention in recent years. However, as DSP has many factors related to network topology, update patterns, and query characteristics, existing works only test their algorithms on limited situations without sufficient comparisons with other approaches. Thus, it is still hard to choose the most suitable method in practice. To this end, we first identify the determinant dimensions and constraint dimensions of the DSP problem and create a complete problem space to cover all possible situations. Then we evaluate the state-of-the-art DSP methods under the same implementation standard and test them systematically under a set of synthetic dynamic networks. Furthermore, we propose the concept of dynamic degree to classify the dynamic environments and use throughput to evaluate their performance. These results can serve as a guideline to find the best solution for each situation during system implementation and also identify research opportunities. Finally, we validate our findings on real-life dynamic networks.

A novel shortest path query algorithm

2018 ◽  
Vol 22 (S3) ◽  
pp. 6729-6740
Author(s):  
Wei Chen ◽  
Ziyang Chen ◽  
Jia Liu ◽  
Qingzhang Yang
Keyword(s):  
Shortest Path ◽  
Query Algorithm ◽  
Shortest Path Query
Sign in / Sign up

Export Citation Format

Share Document