Abstract: This paper extends the well-known Dijkstra's shortest path algorithm to consider not only the edge weights but also the node weights for a graph derived from the underlying SDN topology. We ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback