Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification

Document Type Expired Internet-Draft (manet WG)
Authors Vincent Park  , Scott Corson 
Last updated 2001-07-25
Stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Expired & archived
plain text pdf htmlized bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


This document provides both a functional description and a detailed specification of the Temporally-Ordered Routing Algorithm (TORA)--a distributed routing protocol for multihop networks. A key concept in the protocol's design is an attempt to de-couple the generation of far-reaching control message propagation from the dynamics of the network topology. 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.


Vincent Park (vpark@itd.nrl.navy.mil)
Scott Corson (corson@flarion.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)