Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification
draft-ietf-manet-tora-spec-04
| Document | Type |
Expired Internet-Draft
(manet WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Vincent D. Park , Dr. Scott M. Corson | ||
| Last updated | 2023-06-09 (Latest revision 2001-07-25) | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Dead WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
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.
Authors
Vincent D. Park
Dr. Scott M. Corson
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)