@inproceedings{0279e549cac34fb3b3bc3810a6714575,

title = "Extending Dijkstra's shortest path algorithm for software defined networking",

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 use Pyretic to implement the extended Dijkstra's algorithm and compare it with the original Dijkstra's algorithm and the unit-weighted Dijkstra's algorithm under the Abilene network topology in terms of end-to-end latency with the Mininet tool. As shown by the comparisons, the extended Dijkstra's algorithm outperforms the other algorithms.",

keywords = "Dijkstra's algorithm, Network topology, Shortest path, Software defined networking (SDN)",

author = "Jiang, {Jehn Ruey} and Huang, {Hsin Wen} and Liao, {Ji Hau} and Chen, {Szu Yuan}",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 16th Asia-Pacific Network Operations and Management Symposium, APNOMS 2014 ; Conference date: 17-09-2014 Through 19-09-2014",

year = "2014",

month = dec,

day = "23",

doi = "10.1109/APNOMS.2014.6996609",

language = "???core.languages.en_GB???",

series = "APNOMS 2014 - 16th Asia-Pacific Network Operations and Management Symposium",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "APNOMS 2014 - 16th Asia-Pacific Network Operations and Management Symposium",

}