Issue No.04 - April (2014 vol.26)
Zhiguo Gong , Dept. of Comput. & Inf. Sci., Univ. of Macau, Taipa, China
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.176
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.
Indexes, Roads, Servers, Maintenance engineering, Computational modeling, Time factors, Navigation,broadcasting, Shortest path, air index
Zhiguo Gong, "Towards Online Shortest Path Computation", IEEE Transactions on Knowledge & Data Engineering, vol.26, no. 4, pp. 1012-1025, April 2014, doi:10.1109/TKDE.2013.176