RIP-(Routing Information Protocol)

Author: Pointout team

Author: Pointout team

TheRouting Information Protocol (RIP) is a dynamicrouting protocol used in local and wide area networks. As such it is classified as aninterior gateway protocol (IGP). It uses thedistance-vector routing algorithm. The protocol has since been extended several times, resulting in RIP Version 2. Both versions are still in use today, however, they are considered technically obsoleted by more advanced techniques, Open Shortest Path First (OSPF) and theOSI protocolIS-IS. RIP has also been adapted for use inIPv6 networks, a standard known as RIPng (RIP next generation). The routingalgorithm used in RIP, theBellman-Ford algorithm, was first deployed in a computer network in 1967, as the initial routing algorithm of theARPANET. RIP is adistance-vector routing protocol, which employs thehop count as a routing metric(more about distance vector protocols on link). The hold down time is 180 seconds. RIP prevents routing loops by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops allowed for RIP is 15. This hop limit, however, also limits the size of networks that RIP can support. A hop count of 16 is considered an infinite distance and used to deprecate inaccessible, inoperable, or otherwise undesirable routes in the selection process. Versions RIP version 1 The original specification of RIP,usesclassful routing. The periodic routing updates do not carrysubnet information, lacking support forvariable length subnet masks (VLSM). This limitation makes it impossible to have different-sizedsubnets inside of the samenetwork class. In other words, all subnets in a network class must have the same size. There is also no support for router authentication, making RIP vulnerable to various attacks. RIP version 2 RIP version 2 (RIPv2) was developed in 1993and last standardized in 1998.It included the ability to carry subnet information, thus supportingClassless Inter-Domain Routing (CIDR). To maintain backward compatibility, the hop count limit of 15 remained. RIPv2 has facilities to fully interoperate with the earlier specification if allMust Be Zero protocol fields in the RIPv1 messages are properly specified. In addition, acompatibility switch featureallows fine-grained interoperability adjustments. In an effort to avoid unnecessary load on hosts that do not participate in routing, RIPv2multicasts the entire routing table to all adjacent routers at the address224.0.0.9, as opposed to RIPv1 which uses broadcast. Unicast addressing is still allowed for special applications. (MD5) authentication for RIP was introduced in 1997.[6][7] Route tags were also added in RIP version 2. This functionality allows for routes to be distinguished from internal routes to external redistributed routes from EGP protocols. RIPng RIPng (RIP next generation)is an extension of RIPv2 for support ofIPv6, the next generation Internet Protocol. The main differences between RIPv2 and RIPng are: Support of IPv6 networking. While RIPv2 supports RIPv1 updates authentication, RIPng does not. IPv6 routers were, at the time, supposed to use IPsec for authentication. RIPv2 allows attaching arbitrary tags to routes, RIPng does not; RIPv2 encodes the next-hop into each route entries, RIPng requires specific encoding of the next hop for a set of route entries. Originally each RIP router transmitted full updates every 30 seconds. In the early deployments, routing tables were small enough that the traffic was not significant. As networks grew in size, however, it became evident there could be a massive traffic burst every 30 seconds, even if the routers had been initialized at random times. It was thought, as a result of random initialization, the routing updates would spread out in time, but this was not true in practice. Modern RIP implementations introduce deliberate variation into the update timer intervals of each router. RIP implements thesplit horizon,route poisoning andholddown mechanisms to prevent incorrect routing information from being propagated(more about RIPimplementations on this link). These are some of the stability features of RIP. It is also possible to use the so called RIP-MTI algorithm to cope with the count to infinity problem. With its help, it's possible to detect every possible loop with a very small computation effort. In most current networking environments, RIP is not the preferred choice forrouting as itstime to converge and scalability are poor compared toEIGRP,OSPF, orIS-IS (the latter two beinglink-state routing protocols), and (without RIP-MTI) a hop limit severely limits the size of network it can be used in. However, it is easy to configure, because RIP does not require any parameters on a router unlike other protocols. RIP is implemented on top of theUser Datagram Protocol as its transport protocol. It is assigned the reserv edport number 520.You can find more info onwww.pointout.orgAbout the Author:

PointOut.org is web resource for computer and network technology

POST COMMENT

Looking For Information On Switchgear? Cat Allergies Free Information Information about skullcandy smokin bud Information About Famous Teacup Chihuahua Some Greatest Information About Battery Find Some Usage Information About Cable Some Useful Information About Fm Transmitter Medicare Part D Information - How You Can Get Significant Savings On Your Prescriptions Live Bait: A91 Amazing Information On Crappie Spawn And Paper Mouth Unbeaten Ferret Raising Information Catfish Information You Need To Know Information About Skullcandy Smokin Bud Basic IBS Information