Routing Algorithms - Assignment Example

Routing Algorithms I.D. 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. Today, OSPF is most widely used while once popular RIP is undergoing extensive development. (Forouzan 2006)Open Shortest Path First (OSPF) OSPF is a complex routing algorithm that can analyze the link-state situation of the given network. It can maintain the routes for all possible destinations in a network continuously.

The routing table built by OSPF is based on topology database, and selection of nodes is done along shortest paths. The shortest path has least number of nodes in it. Hence, the technique proactively helps in ascertaining adjacency properties of two or more given nodes. (Perkins and Bhagwat 1994)AdvantagesOSPF can detect which nodes are closestSince OSPF can analyze the changes in link state, it can handle dynamic networks by instantaneously updating the routing tablesIt can be simply applied to networks where both workstations and mobile computers are being usedDisadvantagesGenerates highly complex and bulky trafficUses a number of varieties of data packets, where each variety has its specific functions.

Therefore, the overall working of this algorithm is considerably complicatedTemporally-Ordered Routing Algorithm (TORA) TORA is a combination of both reactive and proactive techniques. It can be implemented across large and distributed networks without the fear of further complications. TORA can also respond to any modifications in the network topology. Thus, TORA is also ideal for handling dynamic networks, where mobile devices or nodes are actively used. However, “since multiple paths are used in TORA, routes may not be the shortest ones always” (Logambal and Chitra 2014).

AdvantagesRapidly identifies and synchronizes available neighboring nodesCan maintain network states and continuously update the routing tableIt is capable of accomplishing both proactive and reactive routing operationsDisadvantagesTORA is not scalableNot widely used, so compatibility issues may ariseProtocols like AODV and DSR often outperform TORA in discharging basic network management functionsRouting Information Protocol (RIP) It is one of the simplest and earliest routing protocols that can be utilized for generating routing tables.

RIP has a primitive design and it may generate very large traffic load in a modern, fully operational computer network. RIP utilizes the User Datagram Protocol or UDP for the purpose of its main transport and communication protocol. (Malkin 2000)AdvantagesVersions of RIP that are readily compatible with the advanced versions of Internet Protocol or IP help in modernizing its implementation fasterAlthough it is non-proprietary, it is well compatible with Cisco routing technologies which are widely used across the worldDisadvantagesToo simple to be used in modern, dynamic networksMay lead to traffic burstPoor scalabilityReferencesForouzan, B.A. (2006).

TCP/IP Protocol Suite. Boston: McGraw HillLogambal, R., & Chitra, K. (2014). A Study on Routing Protocols for Mobile Adhoc Networks. International Journal of Innovative Research in Computer and Communication Engineering, 2, 3259-3264Malkin, G.S. (2000). RIP: An Intra-Domain Routing Protocol. Addison-Wesley LongmanPerkins, C.E. and Bhagwat, P. (1994). Highly Dynamic Destination Sequenced Distance Vector Routing for Mobile Computers, Proc. Of Computer Communication Rev. 1, 234-244.