Routing Algorithms - Assignment Example

Comments (0) Cite this document
Today, OSPF is most widely used while once popular RIP is undergoing extensive development. (Forouzan 2006)
OSPF is a complex…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER93.7% of users find it useful
Routing Algorithms
Read TextPreview

Extract of sample "Routing Algorithms"

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)
OSPF can detect which nodes are closest
Since OSPF can analyze the changes in link state, it can handle dynamic networks by instantaneously updating the routing tables
It can be simply applied to networks where both workstations and mobile computers are being used
Generates highly complex and bulky traffic
Uses a number of varieties of data packets, where each variety has its specific functions. Therefore, the overall working of this algorithm is considerably complicated
Temporally-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).
Rapidly identifies and synchronizes available neighboring nodes
Can maintain network states and continuously update the routing table
It is capable of accomplishing both proactive and reactive routing operations
TORA is not scalable
Not widely used, so compatibility issues may arise
Protocols like AODV and DSR often outperform TORA in discharging basic network management functions
Routing 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)
Versions of RIP that are readily compatible with the advanced versions of Internet Protocol or IP help in modernizing its implementation faster
Although it is non-proprietary, it is well compatible with Cisco routing technologies which are widely used across the world
Too simple to be used in modern, dynamic networks
May lead to traffic burst
Poor scalability
Forouzan, B.A. (2006). TCP/IP Protocol Suite. Boston: McGraw Hill
Logambal, 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-3264
Malkin, G.S. (2000). RIP: An Intra-Domain Routing Protocol. Addison-Wesley Longman
Perkins, C.E. and Bhagwat, P. (1994). Highly Dynamic Destination Sequenced Distance Vector Routing for Mobile Computers, Proc. Of Computer Communication Rev. 1, 234-244. Read More
Cite this document
  • APA
  • MLA
(“Routing Algorithms Assignment Example | Topics and Well Written Essays - 500 words”, n.d.)
Routing Algorithms Assignment Example | Topics and Well Written Essays - 500 words. Retrieved from
(Routing Algorithms Assignment Example | Topics and Well Written Essays - 500 Words)
Routing Algorithms Assignment Example | Topics and Well Written Essays - 500 Words.
“Routing Algorithms Assignment Example | Topics and Well Written Essays - 500 Words”, n.d.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document


Compression Algorithms

...? Compression Algorithms: Introduction In information theory and computer technology, source coding, reduction in the bit rate or data compression involves encoding of information by the use of fewer bits compared to original representations. The compression can be lossless or lossy. Lossless compression lessens bits through identification and elimination of statistical redundancy. There is no information that is lost in the lossless compression. In contrary, lossy compression lessens bits through identification of marginally vital information and eliminates it. This process of size reduction of data is popularly known as compression of data, though it was formally known as source coding. Compression is important as it...
7 Pages(1750 words)Research Paper

Network Routing

...algorithm for the calculation of shortest path. (Zhang, 2011) Every router in the network builds up the complete topology in its routing table, thus each router contains equal amount of information. It consumes space and memory more than distance vector. It is suitable for implementing in large networks. DESIGN AND IMPLEMENTATION The design of this network implements the virtue connection International School of Networking has a Chelmsford HQ in England and two remote sites in Mexico and Malaysia. Communication within the routers is via Open Shortest Path First (OSPF) that has fast convergence and is able to meet the demands of a large organization. The routing protocol is configured on...
10 Pages(2500 words)Assignment

Temporally-Ordered Routing Algorithm

...Temporally-Ordered Routing Algorithm (TORA) The Temporally-Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad-hoc networks (MANET). It was developed by Vincent Park at the University of Maryland, College Park and the Naval Research Laboratory. Park has patented his work, and owns Nova Engineering, who are marketing a wireless router product based on Parks algorithm. (Wikipedia, 2005, para.1-2) Park and Corson (1997, p.1) name the TORA protocol as one of a family of protocols which they term "link reversal" algorithms. The protocol's reaction is...
13 Pages(3250 words)Essay

Advanced Routing Protocols an Area Border Router and R5 is an Autonomous System Boundary Router. Figure 1: Conceptual Layout of a Complex OSPF network (j) Routing communications occur by virtue of OSPF routing protocol packets which are of five types - Hello, Database Description, Link State Request, Link State Update and Link State Acknowledgement. (k) OSPF Hello Packets sends a multicast on all the router interfaces at an interval of 10 seconds to form adjacencies between routers. (l) The OSPF algorithm sends Link State Advertisements (LSAs) at every 30 minutes to communicate network changes. The LSAs are exchanged between neighbour routers to build & maintain a consistent database throughout the...
22 Pages(5500 words)Essay

Genetic Algorithms

...Running Head: GENETIC ALGORITHMS GENETIC ALGORITHMS [The [The of the Genetic Algorithms Genetic Algorithms The N-Queens problem is a traditional AI problem. Its name is resulting from the allowable moves for the ruler part in chess. Queens are allowable to move flat, vertically, or diagonally, toward the back and forward, with the merely restriction being that they can go in only one course at a time. A queen that can reach one more piece in one move capture it. The N-Queens problem is based on the idea of trying to put N queens on an N x N grid, such that no ruler will be able to imprison any other queen. The N-queens problem is characteristic of a lot of combinatorial...
4 Pages(1000 words)Essay

Genetic Algorithms

...Genetic algorithms are used as a synthetic but extremely useful means of solving extremely complex problems. It is a particularly beneficial means of problem solving because it is an efficient way of managing large quantities of arbitrary information. The use of GA’s is not limited to genetics but rather is used in business and other professional fields. For argument’s sake, we will approach genetic algorithms in this paper, from a Biological approach. approach. The principles of the genetic algorithm rests on the principles of natural selection, evolution and Mendelian Genetics. (Jamshidi 2003). The preliminary step to a genetic algorithm is to identify a means of...
3 Pages(750 words)Essay

Network Routing

...Network Routing Network Routing INTRODUCTION This report compares and contrasts dynamic-routing protocols and link routing protocols. Also included in this work are: analysis of an open source; dynamic routing protocol, which fulfills the requirements of a large organization having fast convergence along with its design; implementation using LAN and WAN devices in a topology; and a brief testing plan. Working configurations of all the devices are also discussed. LINK-STATE ROUTING PROTOCOLS Link-state routing protocol works on Shortest Path First (SPF) algorithm; for reaching destination it searches the...
10 Pages(2500 words)Assignment

Vehicle Routing Software

...when installing the vehicle routing system; durability, efficiency, installation and maintenance cost and detailed data. This software helps in; Cost reduction: Routes are created by algorithms that defines the most effective path Maximum utilization of assets: The available resources are utilized effectively More confident decision: Access cost data to understand which stops are profitable and which are not Suitable plan for exceptions and unexpected: It prepares for active changes that will affect routing. There are several software companies that offer vehicle routing service with both similar and different features .Some of the key...
2 Pages(500 words)Assignment

BGP routing protocol

...with I.G.P. The complex nature of this protocol makes it a little more strained with regard to its understanding and usage. Its compatibility with NAT over the autonomous systems may pose a challenge with regard to configuration. B.G.P may prove to be limited in functionality in case of multipath options at hand. Advantages: Most of the internet traffic that we perform is performed through this protocol. Other advantages include its secure and safe operations. It is less prone to failures and external vulnerabilities as compared to the other protocols that are used. Through the use of multiple nodes and various other elements, it makes the overall operations and servicing more effective towards security aspect. It is more updated as...
1 Pages(250 words)Research Paper

Routing Protocol an advanced distance vector routing protocol which reduces routing uncertainty which developed after re-arrangement of various computer network elements. Routers which operate through EIGRP involuntarily spread data packets to the interior gateway routing protocol by changing the 32 bit enhanced interior gateway to 24 bit interior gateway. Since EIGRP uses a dual update algorithm (DUAL) its confluence is much faster. The time taken to transmit data packets through the telecommunication network from the source destination is from 65ms up to 185ms. Open Shortest Path first (OSPF) developed by Interior gateway protocol, conveys information in an automatic system....
2 Pages(500 words)Essay
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.

Let us find you another Assignment on topic Routing Algorithms for FREE!

Contact Us