Sign in
Version 5.13.0, 2015-03-25
Report a bug

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

Document type: Expired Internet-Draft (manet WG)
Document stream: IETF
Last updated: 2001-07-25
Intended RFC status: Unknown
Other versions: (expired, archived): plain text, pdf, html

IETF State: WG Document
Document shepherd: No shepherd assigned

IESG State: Expired
Responsible AD: (None)
Send notices to: No addresses provided

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


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 <>
Scott Corson <>

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