Extending Dijkstra's shortest path algorithm for software defined networking

APNOMS 2014 - 16th Asia-Pacific Network Operations and Management Symposium

Volumn , Issue , 2014, Pages

  Jiang, Jehn Ruey ^a   Huang, Hsin Wen ^a   Liao, Ji Hau ^a   Chen, Szu Yuan ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Dijkstra's algorithm; Network topology; Shortest path; Software defined networking (SDN)

Indexed keywords

GRAPH THEORY; SOFTWARE DEFINED NETWORKING;

DIJKSTRA'S ALGORITHMS; DIJKSTRA'S SHORTEST PATH ALGORITHM; EDGE WEIGHTS; END TO END LATENCIES; NETWORK TOPOLOGY; SHORTEST PATH; SOFTWARE DEFINED NETWORKING (SDN);

GRAPH ALGORITHMS;

EID: 84941039079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APNOMS.2014.6996609     Document Type: Conference Paper

References (16)

1. E. Dijkstra, "A note on two problems in connexion with graphs, " Numerische mathematik, vol. 1, no. 1, 1959, pp. 269-271.
2. D. Drutskoy, E. Keller, and J. Rexford, "Scalable network visualization in software-defined networks, " IEEE Internet Computing, vol. 17, no. 2, 2013, pp. 20-27.
3. N. Foster, R. Harrison, M. Freedman, C. Monsanto, J. Rexford, A. Story, and D. Walker, "Frenetic: A Network Programming Language", in Proc. of the 16th ACM SIGPLAN International Conference on Functional Programming, 2011, pp 279-291.
4. A. Furculita, M. Ulinic, A. Rus, and V. Dobrota, "Implementation issues for Modified Dijkstra's and Floyd-Warshall algorithms in OpenFlow, " in Proc. of 2013 RoEduNet International Conference 12th Edition: Networking in Education and Research, 2013, pp. 141-146
5. B. Lantz, B. Heller, and N. McKeown, "A Network in a Laptop: Rapid Prototyping for Software-Defined Networks, " in Proc. of ACM Hotnets'10, 2010.
6. N. McKeown, et. al., "OpenFlow: Enabling Innovation in Campus Networks, " ACMSIGCOMMComputer Communication, 2008.
7. C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker, "Composing Software-Defined Networks, " in Proc. of NSDI, 2013.
8. B. Nunes, M. Mendon9a, X. Nguyen, K. Obraczk, and T. Turletti, "A survey of software-defined networking: Past, present, and future of programmable networks, " to appear in IEEE Communications Surveys & Tutorials, 2014.
9. Open Networking Foundation, "OpenFlow Switch Specification version 1. 4. 0, " October 14, 2013.
10. A. Rus, V. Dobrota, A. Vedinas, G. Boanea, and M. Barabas, "Modified Dijkstra's algorithm with cross-layer QoS, " ACTA TECHNICA NAPOCENSIS, Electronics and Telecommunications, vol. 51, no. 3, 2010, pp. 75-80.
11. J. Reich, C. Monsanto, N. Foster, J. Rexford, and D. Walker, "Modular SDN Programming with Pyretic", Technical Reprot of USENIX, available at http://www. usenix. org, 2013.
12. Abilene Network, http://en. wikipedia. org/wiki/Abilene-Network-#cite-note-line-1, last accessed on March 4, 2014.
13. Mininet Website, http://mininet. org/, last accessed on May 2014.
14. Open Network Foundation (ONF) Website (SDN white paper), https://www. opennetworking. org/sdn-resources/sdn-definition, last accessed on January 2014.
15. Historical Abilene Connection Traffic Statistics, http://stryper. uits. iu. edu/abilene/, last accessed in March 2014
16. Iperf, http://iperf. fr/, last accessed in May 2014.