Analysis of Improved Shortest Path First Algorithm (Ispfa) for Enhanced Interior Gateway Routing Protocol (Eigrp)
American Journal of Engineering and Technology Management
Volume 1, Issue 3, October 2016, Pages: 25-30
Received: Aug. 2, 2016; Accepted: Aug. 13, 2016; Published: Sep. 12, 2016
Views 2750      Downloads 50
Authors
Enyenihi H. Johnson, Department of Elect/Elect Engineering, Akwa Ibom State University, Ikot Akpaden, Nigeria
Uduak Idio Akpan, Department of Elect/Elect Engineering, Akwa Ibom State University, Ikot Akpaden, Nigeria
Nornu S. Agbeb, Department of Elect/Elect Engineering, Rivers State Polytechnic, Port Harcourt, Nigeria
Article Tools
Follow on us
Abstract
The world is experiencing rapid and tremendous growth in computer communication network technology. This technology provides the technical infrastructure, where routing protocols are used to transmit packets across the Internet. Routing protocols specify how routers communicate with each other by spreading information. Enhanced Interior Gateway Routing Protocol (EIGRP) is one of the hybrid protocols, which is based on Interior Gateway Routing Protocol (IGRP). In our work titled “Improved Shortest Path First Algorithm for Enhanced Interior Gateway Routing Protocol (EIGRP)”, we proposed an improved shortest path first algorithm (ISPFA) used in enhanced interior gateway routing protocol. This work addressed the end-to-end delay problem associated with the existing routing protocol. In this paper, we carried our comprehensive analysis of the proposed protocol and assessed its comparative performance with existing protocol. The analysis shows average improvement of 36% by the proposed protocol over the existing.
Keywords
Routing Protocol, Delay Metrics, VOIP, EIGRP, ISPFA
To cite this article
Enyenihi H. Johnson, Uduak Idio Akpan, Nornu S. Agbeb, Analysis of Improved Shortest Path First Algorithm (Ispfa) for Enhanced Interior Gateway Routing Protocol (Eigrp), American Journal of Engineering and Technology Management. Vol. 1, No. 3, 2016, pp. 25-30. doi: 10.11648/j.ajetm.20160103.11
Copyright
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
References
[1]
U. I. Akpan, U. E. Udoka and E. H. Johnson, “Improved Shortest Path First Algorithm for Enhanced Interior Gateway Routing Protocol (EIGRP),” American Journal of Intelligent Systems 2016, 6 (2): 31-41 DOI: 10.5923/j.ajis.20160602.01.
[2]
R. Devi, B. Sumathi, T. Gandhimathi, and G. Alaiyarasi, “Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols,” International Journal of Computational Engineering Research (IJCER) ISSN. 2250-3005.
[3]
M. Sportack, “IP Routing Fundamentals,” 2nd ed. California: Cisco Press. pp. 23, 1999.
[4]
C. Xianhui and J. C. Lee, “VoIP Performance over Different Interior Gateway Protocols,” International Journal of Communication Networks and Information Security (IJCNIS), 1 (1): 34-39, 2009.
[5]
D. C. Cox, “Wireless Personal Communications: What is it?” IEEE Personal Communications, vol. 2, no. 2, pp. 20-35, 1995.
[6]
T. F. Johansson, “Bandwidth efficient AMR Operation for VoIP,” IEEE Proceedings of the Workshop on speech Coding, 3, 150-152, 2002.
[7]
L. Cidon and M. Sidi, “A Multi-Station Packet-Radio Network,” Performance Evaluation, 8 (1): 65-72, 1988.
[8]
J. C. Bolot, “Characterizing End-to-End Packet Delay and Loss in the Internet,” ACM SIGCOMM, 2 (4): 289–98, 1993.
[9]
R. L. Carter, and M. E. Crovella, “Measuring Bottleneck Link Speed in Packet-Switched Networks,” Proc. Perf. Eval. 27 (28): 297–318 1996.
[10]
M. Jain, and C. Dovrolis, “End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput,” ACM SIGCOMM., 34, 295–308, 2002.
[11]
A. M. Mark, “Voice over IP Technologies: Building the Converged Network,” 2nd ed. New York: John Wiley and Sons, Inc. pp. 234-237, 2002.
[12]
A. R. Nohl, and G. Molnar, “The convergence of the OSPF Routing Protocol,” Periodica Polytechnica Electrical Engineering, 47 (1-2): 89-100, 2002.
[13]
M. Rashed, and M. Kabir, “A Comparative Study of Different Queuing Techniques in VOIP, Video Conferencing and File Transfer,” Daffodil International University Journal of Science and Technology, 5 (1), 37-47, 2010.
[14]
S. G. Thorenoor, “Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background using OPNET Modeler,” 2010 Second International Conference on Computer and Network Technology (ICCNT 2010), 191-195.
[15]
B. A. Forouzan, “TCP/IP Protocol Suite”, McGraw-Hill Education Press. P. 269. ISBN 0-073-37604-3. Retrieved on March 25, 2009.
[16]
V. Paxson,”End-to-End Internet Packet Dynamics,” IEEE/ACM Trans. Net., 7 (3): 277-292, 1996.
[17]
T. Lammle, (2011). Cisco Certified Network Associate Study Guide, Wiley Publishing, Inc., Seventh Edition.
[18]
K. Archana, S. Reena and A. Dayanand, “Performance Analysis of Routing Protocols for Real Time Application,” International Journal of Advanced Research in Computer and Communication Engineering. 3 (1): 23- 25, 2014.
[19]
J. E Padgett, C. G Gunther and T. Hattori, “Overview of Wireless Personal Communications,” IEEE Communications Magazine, pp. 28-41, 1995.
[20]
B. Fortz and M. Thorup, “Optimizing OSPF/IS–IS weights in a changing world,” IEEE Journal on Selected Areas in Communications, vol. 20, no. 4, pp. 756 767, May 2002.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186