VAPNIC: A VersAtile shortest path-free VNF Placement using a divide-and-coNquer tactIC.

Laaziz Lahlou Arol Gbeto Fia Nadjia Kara Aris Leivadeas

Published in: GLOBECOM (2021)

Keyphrases

shortest path
shortest path problem
shortest path algorithm
road network
routing algorithm
travel time
weighted graph
dijkstra algorithm
distance transformation
geodesic distance
optimal path
finding the shortest path
minimum cost flow
flow graph
path selection
minimal surface
path length