2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC) 2020
DOI: 10.1109/isorc49007.2020.00018
|View full text |Cite
|
Sign up to set email alerts
|

Time-dependent Decentralized Routing using Federated Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…Millions of people rely on centralized, effective www.ijacsa.thesai.org route planning systems like Google Maps as a result of this. Algorithms for route planning have advanced along with the cloud settings in which they operate [15]. As current state-ofthe-art solutions are predicated on a shared memory paradigm, their deployment is constrained to data center multiprocessing scenarios.…”
Section: IImentioning
confidence: 99%
“…Millions of people rely on centralized, effective www.ijacsa.thesai.org route planning systems like Google Maps as a result of this. Algorithms for route planning have advanced along with the cloud settings in which they operate [15]. As current state-ofthe-art solutions are predicated on a shared memory paradigm, their deployment is constrained to data center multiprocessing scenarios.…”
Section: IImentioning
confidence: 99%
“…Nonetheless, deploying planning decisions directly in the cloud leads in communication latency, and at the same time, new collision trajectories are continuously generated due to multiple dynamic obstacles, which drastically reduces the decision window for route planning. For the purpose of solving this problem, the work in [106] deploys routing at the network edge of RSUs and assumes that access to external cloud servers is intermittent while compressing the search space as well as limiting the communication frequency of fog nodes, effectively reducing latency and memory requirements. In [107], the traffic data collected by each station is divided into distinct clusters, the road network is modeled as a time-dependent graph, and the enhanced A* algorithm determines the optimal route with the quickest travel time.…”
Section: Service Providingmentioning
confidence: 99%
“…We assume that for every query, q there exists an optimal sequence of grids, SG, from s to d. We assume that each RSU has a trained model for identifying the next best grid given a set of inputs: current grid, source, destination, and time. By recursively utilizing this model from the source until the destination, we generate the optimal sequence grid, SG [43].…”
Section: Queries and Tasksmentioning
confidence: 99%
“…1. This uses the source, destination and time parameter of the query as well as the Equivalent Grid Routing model (Ê) [43], to recursively identify the optimal grid sequence SG, from the source s to the destination d.Ê is a routing model used by Algo. 2, that predicts the best neighboring grid through which the shortest path likely resides for a particular route.…”
Section: Decentralized Route Planning Examplementioning
confidence: 99%