Towards Online Shortest Path Computation

The online shortest path problem aims at computing the shortest path based on live traffic circumstances. This is very important in modern car navigation systems as it helps drivers to make sensible decisions. To our best knowledge, there is no efficient system/solution that can offer affordable costs at both client and server sides for online shortest path computation. Unfortunately, the conventional client-server architecture scales poorly with the number of clients. A promising approach is to let the server collect live traffic information and then broadcast them over radio or wireless network. This approach has excellent scalability with the number of clients. Thus, we develop a new framework called live traffic index (LTI)which enables drivers to quickly and effectively collect the live traffic information on the broadcasting channel. An impressive result is that the driver can compute/update their shortest path result by receiving only a small fraction of the index. Our experimental study shows that LTI is robust to various parameters and it offers relatively short tune-in cost (at client side), fast query response time (at client side), small broadcast size (at server side), and light maintenance time (at server side)for online shortest path problem.

[1]  Dorothea Wagner,et al.  Landmark-Based Routing in Dynamic Graphs , 2007, WEA.

[2]  Daniele Frigioni,et al.  Dynamic Arc-Flags in Road Networks , 2011, SEA.

[3]  Roy Goldman,et al.  Proximity Search in Databases , 1998, VLDB.

[4]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[5]  Bin Jiang,et al.  I/O-efficiency of shortest path algorithms: an analysis , 1992, [1992] Eighth International Conference on Data Engineering.

[6]  Jiawei Han,et al.  Data Mining: Concepts and Techniques, Second Edition , 2006, The Morgan Kaufmann series in data management systems.

[7]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[8]  Weiwei Sun,et al.  Energy-efficient shortest path query processing on air , 2011, GIS.

[9]  Matthias Hein,et al.  Spectral clustering based on the graph p-Laplacian , 2009, ICML '09.

[10]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[11]  Kyriakos Mouratidis,et al.  Shortest path computation on air indexes , 2010, Proc. VLDB Endow..

[12]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[13]  Tomasz Imielinski,et al.  Data on Air: Organization and Access , 1997, IEEE Trans. Knowl. Data Eng..

[14]  Hanan Samet,et al.  Path Oracles for Spatial Networks , 2009, Proc. VLDB Endow..

[15]  Sakti Pramanik,et al.  An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..

[16]  Arnab Bhattacharya,et al.  A continuous query system for dynamic route planning , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[17]  Peter Sanders,et al.  Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm , 2008, JEAL.

[18]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[19]  Daniele Frigioni,et al.  Dynamic Multi-level Overlay Graphs for Shortest Paths , 2008, Math. Comput. Sci..

[20]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[21]  Farnoush Banaei Kashani,et al.  Online Computation of Fastest Path in Time-Dependent Spatial Networks , 2011, SSTD.

[22]  Haixun Wang,et al.  Location-Based Spatial Query Processing with Data Sharing in Wireless Broadcast Environments , 2008, IEEE Transactions on Mobile Computing.

[23]  Shuigeng Zhou,et al.  Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation , 2012, Proc. VLDB Endow..

[24]  Hanan Samet,et al.  Query Processing Using Distance Oracles for Spatial Networks , 2010, IEEE Transactions on Knowledge and Data Engineering.

[25]  Peter Sanders,et al.  Dynamic Highway-Node Routing , 2007, WEA.

[26]  Fabian Fuchs,et al.  On Preprocessing the ALT-Algorithm , 2010 .

[27]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

[28]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[29]  Fang Wei-Kleiner,et al.  TEDI: Efficient Shortest Path Query Answering on Graphs , 2010, Graph Data Management.

[30]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[31]  Jeffrey Xu Yu,et al.  An Analysis of Selective Tuning Schemes for Nonuniform Broadcast , 1997, Data Knowl. Eng..

[32]  Kyriakos Mouratidis,et al.  Spatial queries in wireless broadcast environments , 2012, MobiDE '12.

[33]  Peter Sanders,et al.  In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.

[34]  Victor C. S. Lee,et al.  Distance indexing on road networks , 2006, VLDB.

[35]  Rolf H. Möhring,et al.  Fast Point-to-Point Shortest Path Computations with Arc-Flags , 2006, The Shortest Path Problem.

[36]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[37]  Peter Sanders,et al.  Engineering highway hierarchies , 2012, JEAL.

[38]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[39]  Edward P. F. Chan,et al.  Shortest Path Tree Computation in Dynamic Graphs , 2009, IEEE Transactions on Computers.