Temporally-Ordered Routing Algorithm - Essay Example

Comments (0) Cite this document
Summary
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…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER94.2% of users find it useful
Temporally-Ordered Routing Algorithm
Read TextPreview

Extract of sample "Temporally-Ordered Routing Algorithm"

Download file to see previous pages The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity . This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. (Park and Corson, 1997, p.1)
The basic, underlying algorithm is neither distance-vector nor link-state; it is a member of a class referred to as link-reversal algorithms. The protocol builds a loop-free, multipath routing structure that is used as the basis for forwarding traffic to a given destination. The protocol can simultaneously support both source-initiated, on-demand routing for some destinations and destination-initiated, proactive routing for other destinations. (Lundberg, 2002)
Routing optimality (i.e. determination of the shortest path) is less important for the TORA algorithm. Also it is assumed that it's not necessary (nor desirable) to maintain routes between every source/destination pair at all times. The overhead expended to establish a route between a given source/destination pair will be wasted if the source does not require the route prior to its invalidation due to topological changes.
The TORA protocol is designed to minimize reaction to topological changes. A key concept in its design is that it decouples the generation of potentially far-reaching control message propagation from the rate of topological changes. Such messaging is typically localized to a very small set of nodes near the change without having to resort to a dynamic, hierarchical routing solution with its attendant complexity. (Park and Corson, 1997, p.2)
The basic idea is as follows. When a node loses its last downstream link (i.e. becomes a local minimum) as a result of a link failure, the node selects a new height such that it becomes a global maximum by defining a new "reference level". By design, when a new reference level is defined, it is higher than any previously defined reference level. (Park and Corson, 1997, p.4)
Detailed Description
It is based on the ideas of the GB and LMR algorithms. It uses Query and Reply packets as in LMR but combines this with the notion of height as in the GB partial reversal algorithm. The main enhancement comes from the introduction of a time value which stores the time since a link failure.
TORA also maintains Directed Acyclic Graph (DAG) by means of an ordered quintuple associated with each node with ...Download file to see next pagesRead More
Cite this document
  • APA
  • MLA
  • CHICAGO
(“Temporally-Ordered Routing Algorithm Essay Example | Topics and Well Written Essays - 3250 words”, n.d.)
Temporally-Ordered Routing Algorithm Essay Example | Topics and Well Written Essays - 3250 words. Retrieved from https://studentshare.org/technology/1505197-temporally-ordered-routing-algorithm
(Temporally-Ordered Routing Algorithm Essay Example | Topics and Well Written Essays - 3250 Words)
Temporally-Ordered Routing Algorithm Essay Example | Topics and Well Written Essays - 3250 Words. https://studentshare.org/technology/1505197-temporally-ordered-routing-algorithm.
“Temporally-Ordered Routing Algorithm Essay Example | Topics and Well Written Essays - 3250 Words”, n.d. https://studentshare.org/technology/1505197-temporally-ordered-routing-algorithm.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF Temporally-Ordered Routing Algorithm

Hashing Algorithm

...?HASHING ALGORITHMS Hashing Algorithms Affiliation Introduction Hashing algorithms are used to translate the input of any size to a smaller output of fixed extent by making use of the hash function. In this scenario, this output value is known as the hash value. Basically, this hash value consists of a distinctive and very condensed mathematical illustration of a portion of data. This process of translation from input to output is a compressed mapping, to be precise, the space that is taken by the hash value is a great deal smaller than that of the input. In fact, any value or even a single letter is changed in the input; then the values of hash value will also be changed. Additionally,...
10 Pages(2500 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

Algorithm Visualization

...Shaffer, C., Cooper, M. and Edwards, S. (2007). Algorithm Visualization: A Report on the of the Field. Kentucky: ACM SIGCSE Publications 0The Research Question Shaffer, Cooper and Edwards (2007) embarked on a journey to ascertain the state of the field of algorithm visualization. Their study was concerned with seeking answers to questions such as how content is distributed among topics, who created algorithm visualizations and when, the overall quality of available visualizations, and how visualizations are disseminated. They also concerned themselves with developing a wiki of sites to algorithm visualizations. 2.0 The theory/theories used With regards to a theory that animates the study, there is none. Instead, there is a notion... that...
12 Pages(3000 words)Book Report/Review

Hash Algorithm and Secure Hash Algorithm

...Your first and sur Your Due Hash Algorithm and Secure Hash Algorithm ""A hash function is a reproducible method of turning some kind of data into a (relatively) small number that may serve as a digital "fingerprint" of the data. The algorithm "chops and mixes" (i.e., substitutes or transposes) the data to create such fingerprints. The fingerprints are called hash sums, hash values, hash codes or simply hashes. (Note that hashes can also mean the hash functions.) Hash sums are commonly used as indices into hash tables or hash files. Cryptographic hash functions are used for various purposes in information security applications.""1 "Hash functions are designed to be fast and to yield few...
12 Pages(3000 words)Essay

Algorithm

...Algorithm Design, Analysis and Implementation Assignment 3 To find the longest palindrome in the sequence x n Using LCS (Longest Common Subsequence) Definition: Palindromes are sequences 1...n that remain unchanged even if we reverse the order to n...1 and, hence, palindromic subsequence in the given sequence would be a common subsequence between the original array and the reversed array. Solution: The longest palindrome can be found by first finding the longest common subsequence of the given array, and then checking if it satisfies the conditions for palindrome. If not satisfied, the process is repeated with the longest common subsequence as the new array. The algorithm can be summed up as: Algorithm: Complexity Analysis: LCS... ...
7 Pages(1750 words)Assignment

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

...is 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

Routing Algorithms

...adjacency properties of two or more given nodes. (Perkins and Bhagwat 1994) Advantages 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 Disadvantages 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...
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.

Let us find you another Essay on topic Temporally-Ordered Routing Algorithm for FREE!

Contact Us