CANDS: Continuous Optimal Navigation via Distributed Stream Processing

Dingyu Yang (1) , Dongxiang Zhang (2) , Kian-Lee Tan (3) , Jian Cao (1) , Frédéric Le Mouël (1, 4)

1 CSE - Department of Computer Science and Engineering [Shanghai]
2 NUS - School of computing [Singapore]
3 Department of Computer Science - Singapore
4 DYNAMID - Dynamic Software and Distributed Systems

Shortest path query over a dynamic road network is a prominent problem for the optimization of real-time traffic systems. Existing solutions rely either on a centralized index system with tremen- dous pre-computation overhead, or on a distributed graph process- ing system such as Pregel that requires much synchronization ef- fort. However, the performance of these systems degenerates with frequent route path updates caused by continuous traffic condition change. In this paper, we build CANDS, a distributed stream processing platform for continuous optimal shortest path queries. It provides an asynchronous solution to answering a large quantity of shortest path queries. It is able to efficiently detect affected paths and adjust their paths in the face of traffic updates. Moreover, the affected paths can be quickly updated to the optimal solutions through- out the whole navigation process. Experimental results demon- strate that the performance for answering shortest path queries by CANDS is two orders of magnitude better than that of GPS, an open-source implementation of Pregel. In addition, CANDS pro- vides fast response to traffic updates to guarantee the optimality of answering shortest path queries.

Domaines: Système d'exploitation [cs.OS]; Algorithme et structure de données [cs.DS]; Calcul parallèle, distribué et partagé [cs.DC]; Complexité [cs.CC]

Dingyu Yang, Dongxiang Zhang, Kian-Lee Tan, Jian Cao, Frédéric Le Mouël. CANDS: Continuous Optimal Navigation via Distributed Stream Processing. Proceedings of the VLDB Endowment (PVLDB), 2014, 8 (2), pp.137-148. ⟨hal-01073066⟩