Cited by 8Privacy-Preserving Technologies in DataIoT and Edge/Fog ComputingTransportation Planning and Optimization

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Time-dependent Decentralized Routing using Federated Learning

Wilbur, Michael, Samal, Chinmaya, Talusan, Jose Paolo, Yasumoto, Keiichi, Dubey, Abhishek·2020·2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC)

Abstract

Recent advancements in cloud computing have driven rapid development in data-intensive smart city applications by providing near real time processing and storage scalability. This has resulted in efficient centralized route planning services such as Google Maps, upon which millions of users rely. Route planning algorithms have progressed in line with the cloud environments in which they run. Current state of the art solutions assume a shared memory model, hence deployment is limited to multiprocessing environments in data centers. By centralizing these services, latency has become the limiting parameter in the technologies of the future, such as autonomous cars. Additionally, these services require access to outside networks, raising availability concerns in disaster scenarios. Therefore, this paper provides a decentralized route planning approach for private fog networks. We leverage recent advances in federated learning to collaboratively learn shared prediction models online and investigate our approach with a simulated case study from a mid-size U.S. city.

Overview

Integrity signals

Registry

Crossref · 10.1109/isorc49007.2020.00018

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 27

  1. 10.1007/BF01386390 · DOI
  2. ford, 1956, Network flow theory, RAND CORP SANTA MONICA CA Tech Rep
  3. 10.1090/qam/102435 · DOI
  4. dantzig, 2016, Linear Programming and Extensions
  5. 10.1109/TSSC.1968.300136 · DOI · Paper page
  6. goldberg, 2005, Computing point-to-point shortest paths from external memory, ALENEX/ANALCO, 26
  7. 10.1007/11561071_51 · DOI
  8. 10.1007/11946441_40 · DOI
  9. 10.1109/HPCC.2008.113 · DOI
  10. crauser, 1998, A parallelization of dijkstra’s shortest path algorithm, International Symposium on Mathematical Foundations of Computer Science, 722
  11. goodfellow, 2016, Deep Learning, 1
  12. bonawitz, 2019, Towards federated learning at scale: System design, arXiv preprint arXiv 1902 05023
  13. perry, 2017, Dedicated short-range communications roadside unit specifications
  14. manual, 1964, Bureau of public roads, US Department of Commerce
  15. 10.1007/BF02551274 · DOI · Paper page
  16. pajor, 2009, Multi-modal route planning, University of Karlsruhe
  17. 10.1007/978-3-540-68552-4_24 · DOI
  18. 10.1007/11841036_71 · DOI
  19. 2019, 911 dispatch software
  20. goldberg, 2005, Computing the shortest path: A search meets graph theory, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics, 156
  21. nations, 0, World Urbanization Prospects The 2018 Revision
  22. vetter, 2009, Parallel time-dependent contraction hierarchies, Student Research Project, 134
  23. vukovic, 2016, Hilbert-geohash-hashing geographical point data using the hilbert space-filling curve
  24. 10.1109/SMARTCOMP.2019.00063 · DOI
  25. glorot, 2010, Understanding the difficulty of training deep feedforward neural networks, Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 249
  26. 2019, ET Docker
  27. 10.1007/978-3-7908-2604-3_16 · DOI · Paper page

Cited by

Sorted by citations

See all 8

Metadata

Authors
Wilbur, M., Samal, C., Talusan, J. P., Yasumoto, K., & Dubey, A.
Affiliations
  • Vanderbilt University (US)
  • Nara Institute of Science and Technology (JP)
Venue
2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC)
Publisher
IEEE
Published
2020-05
Pages
56-64
OpenAlex
W3035523410
Cited by
8
References
1
Citations by year
2024: 3 · 2023: 2 · 2021: 2 · 2020: 1
FWCI
0.48
Type
conference paper
Language
en
Open access
closed
Locations
IEEE International Symposium on Real-Time Distributed Computing (ISORC) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Social Sciences › Transportation › Transportation Planning and Optimization
Keywords
federated learning, time-dependent routing, fog computing, smart cities, autonomous vehicles, online collaborative learning, prediction model, disaster resilience

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review