Performance Evaluation of Authenticate (MD5, SHA) Routing Traffic over EIGRP and OSPF with IPV6

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Garima Jain, Teena Hadpawat, Dipesh Vaya

Garima Jain, Teena Hadpawat and Dipesh Vaya. Performance Evaluation of Authenticate (MD5, SHA) Routing Traffic over EIGRP and OSPF with IPV6. International Journal of Computer Applications 176(8):26-29, October 2017. BibTeX

	author = {Garima Jain and Teena Hadpawat and Dipesh Vaya},
	title = {Performance Evaluation of Authenticate (MD5, SHA) Routing Traffic over EIGRP and OSPF with IPV6},
	journal = {International Journal of Computer Applications},
	issue_date = {October 2017},
	volume = {176},
	number = {8},
	month = {Oct},
	year = {2017},
	issn = {0975-8887},
	pages = {26-29},
	numpages = {4},
	url = {},
	doi = {10.5120/ijca2017915624},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


A process of forwarding data on a route from source to destination is termed as routing. This process of routing data from source node to destination node is accomplished by using its protocol. Routing protocols have the responsibility of movement of data through optimal path. As routing protocol play a vital role in infrastructure of computer network, more emphasis is given to routing protocols with security constraints. EIGRP is a distance vector routing protocol which is based on DUAL (Diffusing Update Algorithm), OSPF is an interior Dijkstra algorithm based protocol. OSPF is a link state interior gateway protocol. In first, proposed network topology has been configured with EIGRP and OSPF protocols with IPV6.Then routers are authenticated using MD5 and SHA algorithms. Performance is evaluated in terms of jitter and delay time. Average delay time and average jitter time are calculated for OSPF MD5, OSPF SHA, EIGRP MD5 and EIGRP SHA. It is observe that average delay time and average jitter time for OSPF MD5 is less then EIGRP MD5 and average delay time and average jitter time for OSPF SHA is less then EIGRP SHA.


  1. Rivest, R. The MD5 Message digest algorithm, Request for commentsv(RFC) 1321, Internet Activities Board, Internet Privacy Task Force, Apr.v1992.
  2. FIPS PUB 180-1, Secure Hash Standard (SHA-1),National Institute of Standards and Technology (NIST),1995.
  3. Graziani,R. and Jonson,A. Routing protocols and concepts: CCNA exploration companion guide.Pearson Education. London,2008.
  4. Haijun1,Z., Jin1, Pan and Pubing1,S. Cost adaptive OSPF Source: Proceedings. Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003, 55-60, 2003.
  5. Online source. (2004, Aug 27),Advanced IP Addressing Management, Cisco Systems.
  6. Cisco, IP Routing, Introduction to EIGRP, Document ID: 13669.
  8. Feldmeier, B. and Atkinson, R., OSPF MD5 Authentication, Draft ofietf-ospf-md5-02,”Naval Research Laboratory, pp. 11-11, 1994.
  9. Javvin network management and security. IS-IS: Intermediate System to Intermediate system routing protocol.
  10. Lammle, T. Cisco Certified Network Associate, 5th edition, 2005
  11. Huitema,C. Routing in the internet,2. Ed. Prentice Hall PTR, cop. 2000.
  13. Merike K., Designing Network Security, CiscoPress, 2003.
  14. Rivest, R., The MD5 Message-Digest Algorithm, IETF RFC 1321, MIT Laboratory for Computer Science and RSA Data Security, 1992.
  15. Ratna,A.,Purnamasari,P.,Shaugi,A.and Salman, M.Analysis and comparison of MD5 and SHA-1 algorithm implementation in Simple-O authentication based security system.
  16. Pei, D.,Zhang,L.and Massey, D.A framework for resilient Internet routing protocols.Year,2004, Volume 18, Issue 2,Pages 5 - 12.
  17. Dey, G.,Ahmed, M., and Ahmmed K.Performance analysis and redistribution among RIPv2, EIGRP & OSPF Routing Protocol,2015. International Conference on Computer and Information Engineering (ICCIE),Year 2015, Pages 21 – 24.


MD5, SHA, OSPF, EIGRP, Jitter.