StudentShare solutions
Got a tricky question? Receive an answer from students like you! Try us!

Essay example - Temporally-Ordered Routing Algorithm

Only on StudentShare
Pages 13 (3263 words)
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…

Extract of sample

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. ...
Download paper
Not exactly what you need?

Related papers

Computer Communication
The communication methods involve many linguistic approaches. This involves the Para linguistic, Non linguistic and Meta linguistics. It is the process of movement of data from one person to another and from one place to another.…
16 pages (4016 words)
Mobile IP
The route does not have to be the same in both directions. Therefore, a mobile host needs to have a stable IP address in order to be uniquely identifiable to other Internet hosts. However, when a mobile host moves from one network to another, as shown in Fig. 1, the IP address of an MH will change due to the enforced hierarchical address structure of the Internet. If the MH has only standard IP…
8 pages (2008 words)
Mobility Management
Each node is required to know the topology of the network within its routing zone only. Thus, nodes are updated about topological changes only witin their routing zones. Thus, in spite of the fact that a network can be quite large, the updates are only locally propagated. Since for radius greater than one, the routing zones heavily overlap, the routing tends to be extremely robust. The routes…
4 pages (1004 words)
Congestion control
But this presumption of congestion by sender TCP while using constant threshold technique is not an impeccable procedure and may cause several problems. The TCP design vehemently relies on in-order packet delivery despite the fact that the reordering process is quite possible in the network. The static nature of segment retransmission totally undermines the possibility of delay in the network…
2 pages (502 words)
Advanced Routing Protocols
The popular routing protocol used on the Internet is the Border Gateway Protocol (BGP) which is an exterior gateway routing protocol. Corporate networks manage internal routing with the help of Routing Information Protocol version 2 (RIPv2) and Open Shortest Path First (OSPF) which are interior gateway routing protocols. In this case study, the practical implementation of a complex network for an…
22 pages (5522 words)
Hash Algorithm and Secure Hash Algorithm
"Hash functions are designed to be fast and to yield few hash collisions in expected input domains. In hash tables and data processing, collisions inhibit the distinguishing of data, making records more costly to find.…
12 pages (3012 words)