Dynamic Routing with Security Considerations
K.V.S. Mounika1, Nanduri Jyothirmai2, A.Rama Krishna3
1K.V. S. Mounika, Department of Electronics and Computer Engineering, KL University, Guntur, Krishna District, Andhra Pradesh, India.
2Nanduri Jyothirmai, Department of Electronics and Computer Engineering, KL University, Guntur, Krishna District, Andhra Pradesh, India.
3Asst. Prof. A. Rama Krishna, Department of Electronics and Computer Engineering, KL University, Guntur, Krishna District, Andhra Pradesh, India.
Manuscript received on 15 November 2012 | Revised Manuscript received on 25 November 2012 | Manuscript Published on 30 November 2012 | PP: 58-61 | Volume-1 Issue-6, November 2012 | Retrieval Number: E0331101612/2012©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: One of the major issues for data communication over wired and wireless networks is the security. Different from the past works which includes the Cryptography algorithms and System Infrastructures, we are proposing a dynamic routing algorithm that could randomize the delivery of packets for data transmission as it is compatible and also easy to implement. It is compatible with some of the popular routing protocols such as the Routing Information Protocol which uses hop-count as its metric in the wired networks and Destination-Sequenced Distance Vector protocol in the wireless networks. In the RIP where the hop-count is considered only a limited number of hops are chosen and data transmission are done by selecting the hops randomly in a network. This improves security as well as controls traffic in a network. The routing table in this algorithm is based on the one of the Dynamic routing algorithms known as “Bellman-Ford algorithm” or “Ford Fulkerson Routing algorithm”. An analytical study on the proposed algorithm is presented and the results are verified to show the capability of the proposed algorithm.
Keywords: Bellman Ford algorithm, Dynamic Routing, IP Security, Routing Information Protocol (RIP), Secure Socket Layer.
Scope of the Article: Dynamic Routing