Open Access Open Access  Restricted Access Subscription or Fee Access

Dynamic Routing with Security Considerations

K. Venkatesh Sharma, K. Hanumantha Rao, B. Satish Kumar

Abstract


Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks ,without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

Keywords


Security- Enhanced Data Transmission, Dynamic Routing, RIP, DSDV

Full Text:

PDF

References


G. Apostolopoulos, V. Peris, P. Pradhan, and D.Saha, “Securing Electronic ommerce: Reducing the SSL Overhead,”IEEE Network, 2000.

S. Bohacek, J.P. Hespanha, K. Obraczka, J. Lee, and C. Lim,“Enhancing Security via Stochastic Routing,” Proc. 11th Int’l Conf.Computer Comm. and Networks (ICCCN), 2002.

D. Collins, Carrier Grade Voice over IP. McGraw-Hill, 2003.

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.

P. Erdo¨s and A. Re´nyi, “On Random Graphs,” Publicationes Math.Debrecen, vol. 6, 1959.

M. Faloutsos, P. Faloutsos, and C.aloutsos, “On Power-Law Relationships of the Internet Topology,” Proc. ACM SIGCOMM’99,pp. 251-262, 1999.

FreeS/WAN, http://www.freeswan.org, 2008.

I. Gojmerac, T. Ziegler, F. Ricciato, and P. Reichl, “Adaptive Multipath Routing for Dynamic Traffic Engineering,” Proc. IEEE Global Telecommunications Conf.GLOBECOM), 2003.

C. Hopps, Analysis of an Equal-Cost Multi-Path Algorithm, Request for comments (RFC 2992), Nov. 2000.

C. Kaufman, R. Perlman, and M. Speciner, Network Security—PRIVATE Communication in a PUBLIC World, second ed. Prentice Hall PTR, 2002.

J.F. Kurose and K.W. Ross, Computer Networking—A Top-Down Approach Featuring the Internet. Addison Wesley, 2003.

V.I. Levenshtein, “Binary Codes Capable of Correcting Deletions,Insertions, and Reversals,” Soviet Physics Doklady, vol. 10, no. 8,pp. 707-710, 1966.

S.-H. Liu, Y.-F. Lu, C.-F. Kuo, A.-C. Pang, and T.-W. Kuo, “The Performance Evaluation of a Dynamic Configuration Method over IPSEC,” Proc. 24th IEEE Real-Time Systems Symp.: Works in Progress Session (RTSS WIP), 2003.

W. Lou and Y. Fang, “A Multipath Routing Approach for Secure Data Delivery,” Proc. IEEE Military Comm. Conf. (MilCom), 2001.

W. Lou, W. Liu, and Y. Fang, “SPREAD: Improving Network Security by Multipath Routing,” Proc. IEEE Military Comm. Conf. (MilCom), 2003.

G. Malkin, Routing Information Protocol (RIP) Version 2 Carrying Additional Information, Request for comments (RFC 1723), Nov. 1994.

October 2004 Map Poster of the GEANT Topology, http://www.geant.net/upload/pdf/topology_oct_2004.pdf, 2004.

D.L. Mills, DCN Local-Network Protocols, Request for comments (RFC 891), Dec.1983.

J. Moy, Open Shortest Path First (OSPF) Version 2, Request for comments (RFC 1247), July 1991.

C. Perkins and P. Bhagwat, “Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,”Proc. ACM SIGCOMM ’94, pp. 234-244, 1994.

Secure Sockets Layer (SSL), http://www.openssl.org/, 2008.

Cisco Systems, White Paper: EIGRP, Sept. 2002.

R. Thayer, N. Doraswamy, and R. Glenn, IP Security Document Roadmap, Request for comments (RFC 2411), Nov. 1998.

The Network Simulator-ns2, http://www.isi.edu/nsnam/ns/, 2008.

J. Yang and S. Papavassiliou, “Improving Network Security by Multipath Traffic Dispersion,” Proc. IEEE Military Comm. Conf .(MilCom), 2001.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.