References

[1]. Kreutz, D., Ramos, F. M., Verissimo, P. E., Rothenberg, C. E., Azodolmolky, S., & Uhlig, S.
(2015). “Software-Defined Networking: A Comprehensive Survey”. Proceedings of the
IEEE, 103(1), 14-76.
[2]. Nunes, B. A. A., Mendonca, M., Nguyen, X. N., Obraczka, K., & Turletti, T. (2014). “A
survey of Software-Defined Networking: Past, Present, and Future of Programmable
Networks”. IEEE Communications Surveys & Tutorials, 16(3), 1617-1634.
[3]. Jarraya, Y., Madi, T., & Debbabi, M. (2014).” A Survey and a Layered Taxonomy of
Software Defined Networking”. IEEE Communications Surveys & Tutorials, 16(4), 1955-
1980. [4]
[4]. Yoon, C., Park, T., Lee, S., Kang, H., Shin, S., & Zhang, Z. (2015). “Enabling Security
Functions with SDN: A Feasibility Study”. Computer Networks, 85, 19-35.
[5]. “Going With the Flow: Google’s Secret Switch to the Next Wave of Networking”, Online
Available:http://www.wired.com/wiredenterprise/2012/04/going-with-the-flowgoogle,
Accessed: 24-04-2017
[6]. Niyaz, Q., Sun, W., & Alam, M. (2015). “Impact on SDN Powered Network Services Under
Adversarial Attacks”. Procedia Computer Science, 62, 228-235.
[7]. Sezer S, Scott-Hayward S, Chouhan PK and Fraser B, Lake D, Finnegan J, and Viljoen N,
Miller M, Rao N. “Are we ready for SDN? Implementation Challenges for Software
Defined Networks”. Communications Magazine, IEEE 2013. p. 36-43.
[8]. Olivier, F., Carlos, G., & Florent, N. (2015). “New Security Architecture for IoT
Network”. Procedia Computer Science, 52, 1028-1033.
[9]. Johnson, D. B. (1973). A note on Dijkstra's shortest path algorithm. Journal of the ACM
(JACM), 20(3), 385-388.
[10]. Fuhao, Z., & Jiping, L. (2009, August). An algorithm of shortest path based on Dijkstra
for huge data. In Sixth International Conference on Fuzzy Systems and Knowledge
Discovery, 2009. FSKD'09. (Vol. 4, pp. 244-247). IEEE.

[11]. Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks, Princeton Univ. Press
Princeton.
[12]. Bellman, R. (1958). On a routing problem. Quarterly of applied mathematics, 16(1), 87-
90.
[13]. Yen, J. Y. (1970). An algorithm for finding shortest routes from all source nodes to a
given destination in general networks. Quarterly of Applied Mathematics, 27(4), 526-
530.
[14]. Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. management
Science, 17(11), 712-716.
[15]. Jiang, J. R., Huang, H. W., Liao, J. H., & Chen, S. Y. (2014). “Extending Dijkstra's Shortest
Path Algorithm for Software Defined Networking”. In Network Operations and
Management Symposium (APNOMS), 2014 16th Asia-Pacific (pp. 1-4). IEEE.
[16]. Waleed, S., Faizan, M., Iqbal, M., & Anis, M. I. (2017). “Demonstration of Single Link
Failure Recovery Using Bellman Ford and Dijikstra algorithm in SDN”. In International
Conference on Innovations in Electrical Engineering and Computational Technologies
(ICIEECT) (pp. 1-4). IEEE.
[17]. Shamim, S. M., Miah, M. B. A., Sarker, A., Bahar, A. N., & Sarker, A. “Simulation of
Minimum Path Estimation in Software Defined Networking Using Mininet Emulator”.
British Journal of Mathematics’ and Computer Science.
[18]. Tantisarkhornkhet, P., Werapun, W., & Paillassa, B. (2016). “SDN experimental on the
PSU network”. In International Symposium on Intelligent Signal Processing and
Communication Systems (ISPACS), (pp. 1-6). IEEE.
[19]. Tomovic, S., Radusinovic, I., & Prasad, N. (2015). “Performance Comparison of QoS
Routing Algorithms Applicable to Large-scale SDN Networks”. In EUROCON 2015-
International Conference on Computer as a Tool (EUROCON), IEEE (pp. 1-6). IEEE.
[20]. Krile, S., Rakús, M., & Schindler, F. (2016, June). “Centralized Routing Algorithm Based
on Flow Permutations”. In 39th International Conference on Telecommunications and
Signal Processing (TSP), (pp. 68-73). IEEE.
[21]. “OMNeT++ Discrete Event Simulator” Online Available: https://omnetpp.org/,
Accessed: 2016-09-25
[22]. “EstiNet 9.0 | Simulator”, Online Available:
http://www.estinet.com/ns/?page_id=21140, Accessed: 2016-09-30
[23]. “OFNet- Quick User Guide ”Online Available: http://sdninsights.org/, Accessed: 2016-
10-19
[24]. “MaxiNet: Distributed Network Emulation”, Online Available:
https://maxinet.github.io/, Accessed: 2016-11-08
[25]. “ NS-3”, Online Available: https://www.nsnam.org/, Accessed: 2016-11-08
[26]. “Mininet: An Instant Virtual Network on your Laptop (or other PC) - Mininet” Online
Available: http://mininet.org/. Accessed: 2016-06-15.
[27]. F. Keti and S. Askar, “Emulation of Software Defined Networks Using Mininet in
Different Simulation Environments,” 6th International Conference on in Intelligent
Systems, Modeling and Simulation (ISMS), 2015, pp. 205–210, IEEE, 2015.