The Routing Information Protocol ( Rip )

2649 words - 11 pages

The Routing Information Protocol ( RIP )


I will summarize Request For Comments (RFC) 1058, Routing Information Protocol (RIP), by discussing RIPs basic algorithm/distance vector algorithm, protocol, message format, protocol limitations, and new improvements to RIP.

RIP is very important to internetworking, since it passes information about routes between networks and hosts. It allows hosts and gateways to exchange information for the purpose of computing routes.


RIP was designed to work with moderate sized networks, which used pretty much the same technology. It was not intended to work complex network systems. RIP is widely used for routing traffic in the global Internet and is an interior gateway protocol (IGP), which means that it performs routing within a single autonomous system.

On the Internet, an autonomous system is either a single network or a group of networks that are controlled by a common network administrator (or group of administrators) on behalf of a single administrative entity (such as a university, a business enterprise, or a business division). An autonomous system is also sometimes referred to as a routing domain.

There are several algorithms to determine routes between networks. One categorization is on the type of information that is needed to be exchanged between the networks. Distance vector algorithms exchange only a small amount of data. Each participating gateway keeps information about all destinations within the network.

RIP is a "distance vector algorithm". The basic distance vector algorithm attempts to find the shortest number of "hops" possible to reach the destination. A hop is whenever you pass through a node. In the following example the distance from X to Z is 2:

X ----- Y ----- Z

When the network has many interconnected nodes, the shortest distance is harder to find. In the following, the distance could be 4,5,6 and more.

/ / |
/ / D---E
F-----G | |
| H |
| / |
I--------J |
/ | |

In the above, the shortest path from A to M could be A-B-C-E-M, A-B-D-H-M, or A-G-J-L-M. There are two algorithms that find the shortest path: the Bellman-Ford or Dijkstra algorithms. Once one of these algorithms are run, each node in the network will know the shortest path from itself to each other node in the network.

The algorithm uses fixed "metrics" for route comparisons. The fixed metrics could be time delay, cost, or some other value used to compare routes. In the following network, the numbers represent the cost to transverse the link.

A ---- 1 ---- B ----- 2 ----- C
| |
| ...

Find Another Essay On The Routing Information Protocol ( RIP )

Routing Protocols for Ad Hoc Mobile Networks

2227 words - 9 pages establish connectivity within the network, a dynamic and effective routing protocol is required to generate routing tables that locates the changing routes between the mobile nodes and establishes efficient routed between them. While designing mobile ad hoc routing protocols, its limitations need to be catered such as the protocol must maintain loop free paths through multiple disjoint routes and have control message with low overhead to allow fast

Enhanced Interior Gateway Routing Protocol Essay

653 words - 3 pages Enhanced Interior Gateway Routing Protocol Enhanced Interior Gateway Routing Protocol is a distance vector routing protocol, where a router shares information with neighboring routers about the network in an autonomous system and shares only the information that neighboring routers don’t have instead of the whole message. It is an enhanced version of Interior Gateway Routing Protocol, both of them uses the same distant vector technology and

An approach of Energy Efficient and secure data transfer using multicast routing protocol in Ad Hoc Networks

946 words - 4 pages shortest-tree based multicast routing protocol always chooses the shortest path between source to destination. The source node is the root node it must always know the topology information and address of its entire receiver in the multicast group. Core-based multicast routing protocol will produce single tree per group and its shared by all of the group’s senders and receivers. In network at least one source node and one destination node is available


7329 words - 29 pages with the subnet mask. Routing protocols (Note: Do not confuse with routed protocols.) determine the paths that routed protocols follow to their destinations. Examples of routing protocols include the Routing Information Protocol (RIP), the Interior Gateway Routing Protocol (IGRP), the Enhanced Interior Gateway Routing Protocol (EIGRP), and Open Shortest Path First (OSPF). Routing protocols enable routers that are connected, to create a map

network administration

1394 words - 6 pages through the Link State Packet which allow every router in the internetwork • Each router calculates its own desirable path to a destination using Dijkstra’s Shortest Path Algorithm to determine the best path. It does so by using the link information from the routers in the packet header. Therefore packet forwarding becomes very fast because no lookup is required COMPARISON • Link State protocol only includes the routing table updates

Questions Regarding the TCP/IP Network Model

2300 words - 10 pages & Chapter 3 Network Layer/Internet Protocolspg1 writes. IP network in general uses a vibrant routing protocol to locate alternate routes. Whenever there is a link which becomes unavailable. Such as a routing information protocol which is used in the network layer Using such as RIP. A gateway host (with a router) sends its entire routing table and next hop gateway information to its neighbour. Also OSPF (Open shortest Path First) like the stated by

Design of communication systems

5286 words - 21 pages service providers (ISP). Customer networks, such as universities and corporations, usually employ an Interior Gateway Protocol (IGP) such as RIP or OSPF for the exchange of routing information within their networks. Customers connect to ISPs, and ISPs use BGP to exchange customer and ISP routes. When BGP is used between autonomous systems (AS), the protocol is referred to as External BGP (EBGP). If a service provider is using BGP to exchange routes

Life Time Prediction of Node-to-Node Communication

2375 words - 10 pages . Krishnamurthy, S.K. Tripathi, A framework for reliable routing in mobile ad hoc networks, in: IEEE INFOCOM, San Francisco, CA, USA, 2003, pp. 270–280. [15] M. Kun, Y. Jingdong, R. Zhi, The research and simulation of multipath olsr for mobile ad hoc network, in: International Symposium on Communications and Information Technologies (ISCIT), 2005, pp. 540–543. [16] X. Zhou, Y. Lu, B. Xi, A novel routing protocol for ad hoc sensor networks using

Ad Hoc Routing Protocols

1903 words - 8 pages connectivity within the network, a dynamic and effective routing protocol is required to generate routing tables that locates the changing routes between the mobile nodes. While designing mobile ad hoc routing protocols, its limitations need to be catered such as the protocol must maintain loop free paths through multiple disjoint routes and have control message with low overhead to allow fast rerouting mechanisms. This paper will discuss the various

Choosing the Correct Networking Devices

1184 words - 5 pages protocol at layer 1 and layer 3. The router also be set up a number of different network protocol stacks such as TCP/IP and IPX/SPX. Routers can be included under Mesh topology or Star topology. One of the routing protocol that been used for the router are Routing Information Protocol (RIP) which is one of the internet first widely used protocol for routing. Router is a small device that able to join multiple networks together and router are commonly

Load Balanced Routing with Constant Stretch for Wireless Sensor Network with Holes

1097 words - 5 pages geographical information at the GPS-equipped sensors is widely accepted for its simplicity and efficiency. Geographic routing algorithms typically assume: a) that each network node knows its own and its neighbors’ positions and b) that the source of a message knows the destination’s position. Such a routing algorithm typically starts with a greedy strategy where each node chooses the next hop to be the neighbor node closest to the destination

Similar Essays

Routing Information Protocol: A Survey Essay

2353 words - 9 pages routing its Distance Vector algorithm which is the basis of the well-known Routing Information Protocol (RIP) then we will go to explain how this protocol works what is the problem, and how we can manage this problem and solve it, when use this protocol . After that, we will go to find the advantage and disadvantage with this protocol and compare it with another protocol. Finally, find the accuracy of this algorithm. Keywords: Routing Protocol

Open Shortest Path First (Ospf) Tta Essay

413 words - 2 pages · OSPF is an interior gateway protocol (IGP) for routing Internet Protocol (IP) packets within a single routing domain, such as autonomous system. · OSPF gathers link state information from available routers and constructs a topology map of the network.  · The topology is presented as a routing table to the Internet layer which routes packets based on their destination IP address. · OSPF supports Internet Protocol Version 4 (IPv4) and Internet

Understanding Tcp/Ip Essay

1732 words - 7 pages includes the following protocols: Domain name Service (DNS). This application maps IP addresses to the names assigned to network devices.Routing Information Protocol (RIP). RIP management information from network devices enables packets to be routed along better routing paths.Network File System (NFS). A system developed by Sun Microsystems that enables computers to mount drivers on remote hosts and operate them as if they were local drives.Some

Mobile Ad Hoc Network Temporarily Forms A Network Without Support

1538 words - 7 pages applications which does not allow the long delays. 4.OLSR allow hosts to have multiple OLSR interface addresses and provide external routing information. COMPARISION OF PROTOCOLS: 1.Performance and scalability: The AODV protocol need to discover the route first in order to send the actual data, OLSR does not need to do the extra work for the discovery of the route so it provides low single packet transmission latency .The OLSR drawback is that it