Here is the synopsis of our sample research paper on Routing Information Protocol. Have the paper e-mailed to you 24/7/365.
Essay / Research Paper Abstract
This 9 page paper looks at Routing Information Protocol (RIP), considering what it is and how it is used and how it has developed. The paper includes example packet formats for both RIP and RIP 2. RIP is discussed in the context of networks and Cisco networks. The bibliography cites 9 sources.
Page Count:
9 pages (~225 words per page)
File: TS14_TERIProt.rtf
Buy This Term Paper »
Unformatted sample text from the term paper:
first appeared (Scheideler, 1998). It is based on a development in the 1970s by Xerox, of a distance vector protocol (Bertsekas and Gallaher, 1987, Xerox, 1981). RIP routes the protocols
on the internal networks, and sometimes, but rarely to networks that have a connection to the internet and helps the routers adapt dynamically to the requirements that network traffic is
placing on the network routers with a system of communicating information concerning the routers on the network that the routers can reach and the distance of those routers (Sportack, 1999).
The system id very old and some will argue that it is outdated but it is still commonly used being made obsolete by newer routing protocols such as IS-IS
and OSPF as well as IGRP (Interior Gateway Routing Protocol), this latter protocol is in the same family (Sportack, 1999, Lewis, 1996). RIP has changed little over the years, and
with the section edition RIP-2, some of the issues present in the first edition were overcome, but this is still an older system which is overlooked in preference to the
newer more up to date alternatives (Lewis, 2000, Sportack, 1999). As noted, RIP is a distance vector algorithm; this is first seen described in Ford and Fulkerson (1962). For
this reason they may also be referred to as Ford-Fulkerson algorithms, and their development originates with Bellmans equation which formed the basis of dynamic programming (Bellman, 1957). For this reason
it is also referred to as the Bellman-Ford algorithm. Bellmans work was the mathematical work that made use of distance vectors in order to compare the available routes mathematically in
order to identify the most efficient route to any given destination (Lewis, 2000, Bertsekas and Gallaher, 1987). RIP has developed and todays version may also be referred to as
...