Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2424321.2424383acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Crowdsourcing computing resources for shortest-path computation

Published: 06 November 2012 Publication History

Abstract

Crowdsourcing road network data, i.e., involving users to collect data including the detection and assessment of changes to the road network graph, poses a challenge to shortest-path algorithms that rely on preprocessing. Hence, current research challenges lie with improving performance by adequately balancing preprocessing with respect to fast-changing road networks. In this work, we take the crowdsourcing approach further in that we solicit the help of users not only for data collection, but also to provide us their computing resources. A promising approach is parallelization, which splits the graph into chunks of data that may be processed separately. This work extends this approach in that small-enough chunks allow us to use browser-based computing to solve the pre-computation problem. Essentially, we aim for a Web-based navigation service that whenever users request a route, the service uses their browsers for partially preprocessing a large, but changing road network. The paper gives performance studies that highlight the potential of the browser as a computing platform and showcases a scalable approach, which almost eliminates the computing load on the server.

References

[1]
D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable route planning. In Proceedings of the 10th international conference on Experimental algorithms, 2011.
[2]
C. Demetrescu, A. V. Goldberg, and D. Johnson. The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13--14, 2006. Proceedings. DIMACS Book 74. AMS, 2009.
[3]
E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269--271, 1959.
[4]
A. Efentakis, D. Pfoser, and A. Voisard. Efficient data management in support of shortest-path computation. In Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science, CTS '11, pages 28--33, New York, NY, USA, 2011. ACM.
[5]
S. Jung and S. Pramanik. An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering, 14:1029--1046, 2002.
[6]
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20:359--392, December 1998.

Cited By

View all
  • (2019)Fast Exact Computation of Isocontours in Road NetworksACM Journal of Experimental Algorithmics10.1145/335551424(1-26)Online publication date: 15-Oct-2019
  • (2018)A Collaborative Method for Route Discovery Using Taxi Drivers’ Experience and PreferencesIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2017.275346819:8(2505-2514)Online publication date: Aug-2018
  • (2016)Efficient Processing of Relevant Nearest-Neighbor QueriesACM Transactions on Spatial Algorithms and Systems10.1145/29346752:3(1-28)Online publication date: 21-Sep-2016
  • Show More Cited By

Index Terms

  1. Crowdsourcing computing resources for shortest-path computation

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGSPATIAL '12: Proceedings of the 20th International Conference on Advances in Geographic Information Systems
    November 2012
    642 pages
    ISBN:9781450316910
    DOI:10.1145/2424321

    Sponsors

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 06 November 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. crowdsourcing
    2. graph separators
    3. preprocessing
    4. shortest path

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SIGSPATIAL'12
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 257 of 1,238 submissions, 21%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 15 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Fast Exact Computation of Isocontours in Road NetworksACM Journal of Experimental Algorithmics10.1145/335551424(1-26)Online publication date: 15-Oct-2019
    • (2018)A Collaborative Method for Route Discovery Using Taxi Drivers’ Experience and PreferencesIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2017.275346819:8(2505-2514)Online publication date: Aug-2018
    • (2016)Efficient Processing of Relevant Nearest-Neighbor QueriesACM Transactions on Spatial Algorithms and Systems10.1145/29346752:3(1-28)Online publication date: 21-Sep-2016
    • (2016)Crowdsourcing in ITS: The State of the Work and the NetworkingIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2015.251308617:6(1596-1605)Online publication date: Jun-2016
    • (2016)Route Planning in Transportation NetworksAlgorithm Engineering10.1007/978-3-319-49487-6_2(19-80)Online publication date: 11-Nov-2016
    • (2016)Fast Exact Computation of Isochrones in Road NetworksProceedings of the 15th International Symposium on Experimental Algorithms - Volume 968510.1007/978-3-319-38851-9_2(17-32)Online publication date: 5-Jun-2016
    • (2015)SALT. A Unified Framework for All Shortest-Path Query Variants on Road NetworksProceedings of the 14th International Symposium on Experimental Algorithms - Volume 912510.1007/978-3-319-20086-6_23(298-311)Online publication date: 29-Jun-2015
    • (2014)Multilevel hybrid graph partitioning algorithm2014 IEEE International Advance Computing Conference (IACC)10.1109/IAdCC.2014.6779299(85-89)Online publication date: Feb-2014
    • (2014)GRASP. Extending Graph Separators for the Single-Source Shortest-Path ProblemAlgorithms - ESA 201410.1007/978-3-662-44777-2_30(358-370)Online publication date: 2014
    • (2013)Mobility and social networkingProceedings of the VLDB Endowment10.14778/2536222.25362576:11(1196-1197)Online publication date: 1-Aug-2013
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media