Securing the Network Topology in a Source Routing Multi Domain SDN
Sarat Chandra Prasad Gingupalli and Saumya Hegde. Article: Securing the Network Topology in a Source Routing Multi Domain SDN. IJCA Proceedings on International Conference on Advances in Computer Engineering and Applications ICACEA(3):1-5, March 2014. Full text available. BibTeX
@article{key:article,
author = {Sarat Chandra Prasad Gingupalli and Saumya Hegde},
title = {Article: Securing the Network Topology in a Source Routing Multi Domain SDN},
journal = {IJCA Proceedings on International Conference on Advances in Computer Engineering and Applications},
year = {2014},
volume = {ICACEA},
number = {3},
pages = {1-5},
month = {March},
note = {Full text available}
}
Abstract
In this paper we look at the research work on hiding the topology details in a source routing multi domain software defined networking(SDN), in which each domain is handled by a single controller and all are coordinated by a central controller. Secrecy of the topology is maintained by the secret key shared between the central controller and the other controllers. The central controller redistributes the shared secret key among other controllers once if the threshold number of flows are reached.
References
- Marc Mendonca, Bruno Astuto A. Nunes, Xuan-Nam Nguyen, Katia Obraczka and Thierry Turletti, A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks. hal-00825087, version 2, 2013.
- Ramya Raghavendra, Jorge Lobo and Kang-Won Lee, Dynamic Graph Query Primitives for SDN-based Cloud Network Management. In Proceedings of HotSDN, 2012.
- Seungwon Shin, Guofei Gu, Attacking Software-Defined Networks: A First Feasibility Study. HotSDN13, August 16, 2013.
- Diego Kreutz, Fernando M. V. Ramos,Paulo Verissimo, Towards Secure and Dependable Software-Defined Networks. HotSDN13, August 16, 2013.
- XitaoWen,Yan Chen, Chengchen Hu, Towards a Secure Controller Platform for OpenFlow Applications. HotSDN13, August 16, 2013.
- Stefan Schmid, Jukka Suomela Exploiting Locality in Distributed SDN Control. HotSDN13, August 16, 2013.
- Alistair Moffat and Tadao Takaoka, An all pairs shortest path algorithm with expexted running time O(n2 log n). IEEE, 1985.
- Bloniarz P. A. , A shortest path algorithm with expected time O(n2 log n log n). SIAM J. Comput. ,12(1983), 588-600
- S. Chaudhuri and C. D. Zaroliagis, Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica, 27:212226, 2000.
- C. Demetrescu and G. F. Italiano, Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms, 2(4), Oct. 2006.
- E. W. Dijkstra, A note on two problems in connexion with graphs. NUMERISCHE MATHEMATIK, 1(1):269271,1959.
- F. Wei, TEDI: efficient shortest path query answering on graphs. In Proceedings of SIGMOD, 2010.
- Marc Mendonca, Bruno Astuto A. Nunes, Xuan-Nam Nguyen, Katia Obraczka and Thierry Turletti, A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks. hal-00825087, version 2, 2013. 5