Time-dependent Decentralized Routing using Federated Learning

Time-dependent Decentralized Routing using Federated Learning

Authors: Wilbur, Michael; Samal, Chinmaya; Talusan, Jose Paolo; Yasumoto, Keiichi; Dubey, Abhishek

2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC) - 2020 Pages 56-64

© 2020 IEEE.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.

https://doi.org/10.1109/ISORC49007.2020.00018

Cite as:

@inproceedings{Wilbur_2020,
	doi = {10.1109/isorc49007.2020.00018},
	url = {https://doi.org/10.1109%2Fisorc49007.2020.00018},
	year = 2020,
	month = {may},
	publisher = {{IEEE}},
	author = {Michael Wilbur and Chinmaya Samal and Jose Paolo Talusan and Keiichi Yasumoto and Abhishek Dubey},
	title = {Time-dependent Decentralized Routing using Federated Learning},
	booktitle = {2020 {IEEE} 23rd International Symposium on Real-Time Distributed Computing ({ISORC})}
}



    Leave a Reply

    Your email address will not be published. Required fields are marked *

    x
    This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close