We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Securing the Network Topology in a Source Routing Multi Domain SDN

Published on March 2014 by Sarat Chandra Prasad Gingupalli, Saumya Hegde
journal_cover_thumbnail

International Conference on Advances in Computer Engineering and Applications
Foundation of Computer Science USA
ICACEA - Number 3
March 2014
Authors: Sarat Chandra Prasad Gingupalli, Saumya Hegde
d8596c4b-234c-45a5-a5a2-54804b7238d8

Sarat Chandra Prasad Gingupalli, Saumya Hegde . Securing the Network Topology in a Source Routing Multi Domain SDN. International Conference on Advances in Computer Engineering and Applications. ICACEA, 3 (March 2014), 1-5.

@article{
author = { Sarat Chandra Prasad Gingupalli, Saumya Hegde },
title = { Securing the Network Topology in a Source Routing Multi Domain SDN },
journal = { International Conference on Advances in Computer Engineering and Applications },
issue_date = { March 2014 },
volume = { ICACEA },
number = { 3 },
month = { March },
year = { 2014 },
issn = 0975-8887,
pages = { 1-5 },
numpages = 5,
url = { /proceedings/icacea/number3/15623-1431/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Advances in Computer Engineering and Applications
%A Sarat Chandra Prasad Gingupalli
%A Saumya Hegde
%T Securing the Network Topology in a Source Routing Multi Domain SDN
%J International Conference on Advances in Computer Engineering and Applications
%@ 0975-8887
%V ICACEA
%N 3
%P 1-5
%D 2014
%I International Journal of Computer Applications
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
  1. 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.
  2. Ramya Raghavendra, Jorge Lobo and Kang-Won Lee, Dynamic Graph Query Primitives for SDN-based Cloud Network Management. In Proceedings of HotSDN, 2012.
  3. Seungwon Shin, Guofei Gu, Attacking Software-Defined Networks: A First Feasibility Study. HotSDN13, August 16, 2013.
  4. Diego Kreutz, Fernando M. V. Ramos,Paulo Verissimo, Towards Secure and Dependable Software-Defined Networks. HotSDN13, August 16, 2013.
  5. XitaoWen,Yan Chen, Chengchen Hu, Towards a Secure Controller Platform for OpenFlow Applications. HotSDN13, August 16, 2013.
  6. Stefan Schmid, Jukka Suomela Exploiting Locality in Distributed SDN Control. HotSDN13, August 16, 2013.
  7. Alistair Moffat and Tadao Takaoka, An all pairs shortest path algorithm with expexted running time O(n2 log n). IEEE, 1985.
  8. Bloniarz P. A. , A shortest path algorithm with expected time O(n2 log n log n). SIAM J. Comput. ,12(1983), 588-600
  9. S. Chaudhuri and C. D. Zaroliagis, Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica, 27:212226, 2000.
  10. C. Demetrescu and G. F. Italiano, Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans. Algorithms, 2(4), Oct. 2006.
  11. E. W. Dijkstra, A note on two problems in connexion with graphs. NUMERISCHE MATHEMATIK, 1(1):269271,1959.
  12. F. Wei, TEDI: efficient shortest path query answering on graphs. In Proceedings of SIGMOD, 2010.
  13. 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
Index Terms

Computer Science
Information Sciences

Keywords

Software Defined Networking(sdn) Source Routing Encryption