StudentShare
Contact Us
Sign In / Sign Up for FREE
Search
Go to advanced search...
Free

Open Shortest Path First and Routing Information Protocol - Research Paper Example

Cite this document
Summary
This paper 'Open Shortest Path First and Routing Information Protocol' tells us that in computer networking, there are various techniques used. This includes but is not limited to, open the shortest path first (OSPF) as well as routing internet protocol (RIP). The protocols make up an all-rounded, complete, wireless network…
Download full paper File format: .doc, available for editing
GRAB THE BEST PAPER96% of users find it useful
Open Shortest Path First and Routing Information Protocol
Read Text Preview

Extract of sample "Open Shortest Path First and Routing Information Protocol"

Open Shortest Path First (OSPF) compared to Routing Internet Protocol (RIP) due: Open Shortest Path First (OSPF) and Routing Information Protocol (RIP) In computer networking, there are various techniques used. This includes but not limited to, open shortest path first (OSPF) as well as routing internet protocol (RIP). The protocols makeup an all rounded, complete, wireless network. The two protocols form the main algorithms for routing. Each of the protocols has its own benefits and drawbacks. Routing is the process of selecting a path through which to send data in network traffic. Routing can be applied in various ways such as internet protocols, for sending packet data or even in telephones. The OSPF and the RIP are some of the algorithms used in the routing process (Dubey, Makloha, & Sarwar, 2012). Each of the algorithms is discussed in this paper, in an attempt to bring out their operations and effectiveness in terms of transmission of the packet data, in an electronic data transfer (Sendra, Fernández, Quilez, & Lloret, 2011) Open shortest path first (OSPF) This is the most widely used protocol due to its dynamism in the transfer of electronic data that is in the internet protocol networks. It is categorized in the interior gateway protocols. It is highly preferred due to its low cost of the links to a destination in terms of calculating the optimal routes, based on Dijikstar’s algorithm (Sendra et al., 2011). The working of the OSPF protocol will be discussed in the following perspectives: 1. Metrics A router measures the cost involved for it to communicate with its neighbors. This cost is used to determine the best route to take. The formula for calculating the cost is given by: Cost= 10000 0000 /bandwidth in bps When the bandwidth is wider, the cost is lower; the interface with the lowest cost will be chosen to send data (Wang, Hoque, Alyyan, & Zhang, 2012) 2. Types of messages A router will send packets to its neighborhood routers so as to trace their positions and status. These packets are referred to as hello packets since they are sent to check how the neighboring routers are doing. For OSPF routers, they have both hello and dead time intervals being exchanged. Various manufacturers of the routers have designed them differently such that, there is a set number hello messages sent to the router, after which if it doesn’t respond, it is considered dead (Kamalakannan, Venkatesh, & Mohan, 2014). In an OSPF topology, the network is divided into areas and uses link state packets (LSP) to update each of its surrounding routers with the corresponding cost. OSPF has high scalability due to its ability to send seven different messages which are used to identify the proximity to the neighbors and also exchange information with the neighbors (Thorenoor, 2010). 3. Algorithm operation OSPF routers choose a designated router and a backup designated router which are used as the central points for updating the routers and exchanging the routing information. To avoid deadlocks when the OSPF priorities are the same, the router ID takes the designated router (DR) election. The link state information is then sent by DR to all other OSPF routers in the same segment via the multicast address 224.0.0.5.The advantage with this is that there is higher efficiency than when there is no DR, but the disadvantage is that there is now a single point of failure (Sendra et al., 2011). 4. Node status When there are topology changes, routing produces a large volume of traffic. OSPF supports variable-length subnet mask (VLSM) and multiple routes thus maximizing its addressing efficiency. Router Information Protocol (RIP) Being the oldest routing protocol, it has evolved into two versions; RIPv1 and RIPv2.The former was seen as obsolete prompting the need for development of the latter version to cope with the current demands in the networking area.RIPv2, which is the latest version, is a classless protocol. This protocol will be discussed based on the following perspectives. 1. Metrics It counts the number of routers a message will hop before reaching its destination. All routes with distance greater than 15 are considered unreachable since the maximum number of hops it can make is 15. 2. Message types After every 30 seconds, RIP sends messages. This is a major shortcoming of this protocol, simply because it has to keep on updating the database which generates a large amount of traffic on the network. The improvement of RIPv2 allows it to use Classless Inter-Domain Routing (CIDR), something which RIPv1 couldn’t do. The addition of the subnet mask allows it to add a 32-bit mask. The utilization of the multicast address 224.0.0.9 is an advantage of RIPv2, since it allows it to consume less network bandwidth. 3. Tables Routing databases must be constantly updated to assign the most suitable routes to the routers. Without such updates, a router might end up being assigned a route which no longer exists. The databases provide information about the cost of each route as well as the next hop to be taken to reach the next destination (Dubey et al., 2012) 4. Algorithm operation RIP routers operate in such a way that, they only maintain the best route to a destination. However, if the cost for a given route is the same, then they can keep more than one route to the same destination. The main shortcoming with this algorithm is that it takes too much time to converge which could result to inconsistent routing entries causing rooting loops (Wang et al., 2014). Comparison between RIP and OSPF in terms of performance From the above discussion on the working of the two protocols, it is clear that both have their own pros and drawbacks. However, OSPF has wide applications as described by Kamalakannan et al. (2014) making it the most widely used protocol especially in the large enterprises in networks (p. 4). One of the advantages of using this protocol is it is based on link-state technology which uses SPF algorithm to calculate the shortest path possible, as researched by (Kamalakannan et al., 2014). It ascertains that all the routers in the network get to know about all the other routers in the same network just before it runs the calculation. After that, the shortest path between each router is calculated. When a router receives a link-state update, the information is kept into the database, and the router propagates the updated information to the rest of the routers. On this regard, it is clear that there are no limitations due to hops in OSPF, unlike in RIP which has a limitation of 15 hops, meaning when the 15 hops are exceeded the network cannot be reached. Also, OSPF can handle VLSM but RIP cannot (Kamalakannan et al., 2014). What makes OSPF protocol better than RIP? OSPF proves to be far much better than the rip due to its ability to converge the network paths using the shortest path first (SPF) algorithm and error detection. This is made possible by its features discussed below which makes it adapt quickly to topology changes: It achieves this by using the mechanisms of the interface status changes and the failure to receive hello packets from its neighbors through the dead timer timing window. After the expiry of the timer, the neighbor is assumed to be dead. To configure the dead timer, an interface configuration command called IP OSPF dead-interval is used (Kamalakannan et al., 2014). In the rapid recalculation of a route mechanism, LSA packets are sent to all the neighboring routes after detection of a failure. This information is sent by the router which detected the problem to all the other routers directly connected to it, so that the change can be effected in all the routes so as to provide the shortest route. The ability of the OSPF to load balances along equal paths makes it achieve an almost immediate convergence (Wang et al, 2012). Conclusion From the discussion above, it is without doubt that OSPF is better than RIP in that it is not limited to hops, like the RIP whose limitation is 15 hops. OSPF also has the ability to handle Variable-Length Subnet Mask (VLSM) unlike RIP which cannot. Of importance to note is that OSPF converges much faster in comparison to RIP, made possible by its calculation algorithm. This has a lot of significances especially in the large enterprises networks. References Dubey, A., Makloha, S., & Sarwar, S. (2012). Implementation, Analysis & Comparision Of Routing Protocol (RIP & OSPF) Using Network Simulator Education Version OPNET. International Journal of Research in Engineering and Applied Sciences, 2(2), 633-640. Kamalakannan, S., Venkatesh, S., & Mohan, M. (2014). Convergence Analysis Of RIP And OSPF In IPv6 Network. Convergence, 2(3). Sendra, S., Fernández, P. A., Quilez, M. A., & Lloret, J. (2011). Study and performance of interior gateway IP routing protocols. Network Protocols and Algorithms, 2(4), 88-117. Thorenoor, S. G. (2010, April). Dynamic routing protocol implementation decision between EIGRP, OSPF and RIP based on technical background using OPNET modeler. In Computer and Network Technology (ICCNT), 2010 Second International Conference on (pp. 191-195). IEEE. Wang, L., Hoque, A. K. M. M., Yi, C., Alyyan, A., & Zhang, B. (2012). OSPFN: An OSPF based routing protocol for Named Data Networking. University of Memphis and University of Arizona, Tech. Rep. Read More
Cite this document
  • APA
  • MLA
  • CHICAGO
(“In networking protocol,open shortest path first(OSPF)protocol is Research Paper”, n.d.)
In networking protocol,open shortest path first(OSPF)protocol is Research Paper. Retrieved from https://studentshare.org/information-technology/1656785-in-networking-protocolopen-shortest-path-firstospfprotocol-is-better-than-routing-information-protocolripbecauseit-converges-the-network-faultsuses-the-shortest-path-firstspf-algorithm-and-error-detection
(In Networking protocol,open Shortest Path first(OSPF)protocol Is Research Paper)
In Networking protocol,open Shortest Path first(OSPF)protocol Is Research Paper. https://studentshare.org/information-technology/1656785-in-networking-protocolopen-shortest-path-firstospfprotocol-is-better-than-routing-information-protocolripbecauseit-converges-the-network-faultsuses-the-shortest-path-firstspf-algorithm-and-error-detection.
“In Networking protocol,open Shortest Path first(OSPF)protocol Is Research Paper”, n.d. https://studentshare.org/information-technology/1656785-in-networking-protocolopen-shortest-path-firstospfprotocol-is-better-than-routing-information-protocolripbecauseit-converges-the-network-faultsuses-the-shortest-path-firstspf-algorithm-and-error-detection.
  • Cited: 0 times

CHECK THESE SAMPLES OF Open Shortest Path First and Routing Information Protocol

Anatomy of an Internet Routing Protocol

routing information protocol (RIP) As per network dictionary it is defined as 'routing information protocol (RIP) is a standard for exchange of routing information among gateways and hosts.... This protocol is most useful as an 'interior gateway protocol'.... It is also knows as Interior Gateway protocol (IGP).... Frame Relay protocol is implemented for WAN networks associated with LAN internetworking....
13 Pages (3250 words) Coursework

Routing Protocols for Ad-hoc Wireless Network

This information tells nothing in relation to the quality or level of the connection in the reverse order that is sending signal back to node B from node A (Schiller, 2000).... Chapter 3: routing Protocols for Ad-hoc Wireless Network 3.... routing Protocols As stated previously in this paper, an ad-hoc mobile network refers to a number of wireless mobile hosts linked together to form a network of temporary nature without using any centralized control or stand-alone infrastructure [18]....
20 Pages (5000 words) Dissertation

Evaluation of Routing Protocols

s per network dictionary it is defined as “routing information protocol (RIP) is a standard for exchange of routing information among gateways and hosts.... The following sections contains advantages and disadvantages of each routing protocol specified along with its administrative distance, metrics, periodic updates, triggered updates, partial updates, VSLM / CIDR subnet masking and algorithms.... This protocol is most useful as an “interior gateway protocol”....
8 Pages (2000 words) Essay

Routing Protocols Of Cisco

A routing protocol is defined as a procedure, which stipulates the mode of communication between two or more routers within a computer network.... tatic routing is not a form of routing protocol because it is a manual procedure.... isco's network linking protocols have found wide application as a way of ensuring proper routing.... In addition, routing protocols provide rules through which routers in a network environment choose the paths to be followed between nodes through application of various routing algorithms....
6 Pages (1500 words) Essay

Network Organization, Addressing, and Routing Protocols

Name of the Author Name of the Professor Course 10 February 2012 Network Organization, Addressing, and Routing Protocols The best routing protocol for this scenario is open shortest path first OSPF routing protocol.... Moreover, a database demonstrating the Autonomous system's topology is maintained in each OSPF router ("open shortest path first.... The routes are than calculated the routes while minimizing the use of bandwidth ("open shortest path first....
3 Pages (750 words) Research Paper

Routing Protocol Security

Within an automated system, the routing protocols that are most commonly deployed in Autonomous System, are the open shortest path first (OSPF) alongside the Intermediate-System-to-Intermediate System routing protocols.... The paper 'Routing protocol Security' seeks to examine OSPF v2 Routing protocol Security with a focus on various security measures such as message digest and digital certificate.... According to Jones & Moigne (2006) abuse of routine protocol and mechanism is perhaps the simplest available protocol-based attack....
3 Pages (750 words) Dissertation

Simulation Based Routing Protocols Analysis

After recalling the previous network, the routing protocol then shares the information among the routers on the same path then to the routers across the entire network (Jaffar, 2007) Most of the widely used routing protocol includes the Enhanced interior Gateway routing Protocol (EIGRP), open shortest path first (OSPF), and the Interior Gateway Routing Protocol (IGRP).... open shortest path first (OSPF) developed by Interior gateway protocol, conveys information in an automatic system....
2 Pages (500 words) Essay

Routing Algorithms

(Forouzan 2006)open shortest path first (OSPF) OSPF is a complex routing algorithm that can analyze the link-state situation of the given network.... The shortest path has least number of nodes in it.... The routing table built by OSPF is based on topology database, and selection of nodes is done along shortest paths.... routing Algorithms I.... of the routing Algorithms In this paper, some widely used complex routing algorithms are discussed which can be used to manage complicated networks and build routing tables....
2 Pages (500 words) Assignment
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.
Contact Us