Loading

Performance Analysis of Protocols RIP & EIGRP
Jeevan Prasad Adhikari

Jeevan Prasad Adhikari, Ph.D Pursuing, CMJ (Meghalaya), India
Manuscript received on 15 April 2013 | Revised Manuscript received on 22 April 2013 | Manuscript Published on 30 April 2013 | PP: 107-111 | Volume-2 Issue-5, April 2013 | Retrieval Number: E0661032413/13©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: The Routing Information Protocol (RIP) is one of the Internet’s first widely used routing protocol. It is still useful in local and medium area networks. RIP is classified as a distance-vector routing protocol, which employs the hop count as a routing metric, The maximum number of hops allowed for RIP is 15[3]. A hop count of 16 is considered an infinite distance viewing such distance as unreachable and undesirable route in it routing process. This hop count limits the size of network that RIP operate. EIGRP is a Cisco-proprietary routing protocol that is based on IGRP. EIGRP supports CIDR and VLSM, allowing network designers to maximize address space. EIGRP is often described as a hybrid routing protocol that offers the best of distance vector and link-state algorithms. EIGRP is an advanced routing protocol that relies on features commonly associated with link-state protocols. This paper consist of comparisons of RIP and EIGRP, it includes the various trouble resolving techniques and traffic handling techniques during communication in simple as well in bulky networks[5].
Keywords: Routing Protocols RIP, IGRP, EIGRP.

Scope of the Article: Measurement & Performance Analysis