draft-ietf-manet-tora-spec-00.txt   draft-ietf-manet-tora-spec-01.txt 
Internet Draft V. Park Internet Draft V. Park
draft-ietf-manet-tora-spec-00.txt Naval Research Laboratory draft-ietf-manet-tora-spec-01.txt Naval Research Laboratory
S. Corson S. Corson
University of Maryland University of Maryland
Submitted: Nov 26, 1997 Submitted: Aug 7, 1998
Expires: May 26, 1997 Expires: Feb 7, 1999
Temporally-Ordered Routing Algorithm (TORA) Version 1 Temporally-Ordered Routing Algorithm (TORA) Version 1
Functional Specification Functional Specification
Status of this Memo Status of this Memo
This document is an Internet-Draft. Internet-Drafts are working This document is an Internet-Draft. Internet-Drafts are working
documents of the Internet Engineering Task Force (IETF), its areas, documents of the Internet Engineering Task Force (IETF), its areas,
and its working groups. Note that other groups may also distribute and its working groups. Note that other groups may also distribute
working documents as Internet-Drafts. working documents as Internet-Drafts.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
To learn the current status of any Internet-Draft, please check the To learn the current status of any Internet-Draft, please check the
"1id-abstracts.txt" listing contained in the Internet-Drafts Shadow "1id-abstracts.txt" listing contained in the Internet-Drafts Shadow
Directories on ftp.is.co.za (Africa), nic.nordu.net (Europe), Directories on ftp.is.co.za (Africa), nic.nordu.net (Europe),
munnari.oz.au (Pacific Rim), ds.internic.net (US East Coast), or munnari.oz.au (Pacific Rim), ftp.ietf.org (US East Coast), or
ftp.isi.edu (US West Coast). ftp.isi.edu (US West Coast).
Abstract Abstract
This document provides a detailed specification of Version 1 of the This document provides a detailed specification of Version 1 of the
Temporally-Ordered Routing Algorithm (TORA)--a distributed routing Temporally-Ordered Routing Algorithm (TORA)--a distributed routing
protocol for mobile, multihop, wireless networks. Its intended use is protocol for mobile, multihop, wireless networks. Its intended use is
for routing of Internet Protocol (IP) datagrams within an autonmous for routing of Internet Protocol (IP) datagrams within an autonmous
system. The basic, underlying algorithm is neither a distance-vector system. The basic, underlying algorithm is neither a distance-vector
nor a link-state; it is one of a family of algorithms referred to as nor a link-state; it is one of a family of algorithms referred to as
''link reversal'' algorithms. The protocol's reaction is structured as ``link reversal'' algorithms. The protocol's reaction is structured as
a temporally-ordered sequence of diffusing computations, each a temporally-ordered sequence of diffusing computations, each
computation consisting of a sequence of directed link reversals. The computation consisting of a sequence of directed link reversals. The
protocol is highly adaptive, efficient and scalable; and is well- protocol is highly adaptive, efficient and scalable; and is well-
suited for use in large, dense, mobile networks. In these networks, suited for use in large, dense, mobile networks. In these networks,
the protocol's reaction to link failures typically involves only a the protocol's reaction to link failures typically involves only a
localized ''single pass'' of the distributed algorithm. This desirable localized ``single pass'' of the distributed algorithm. This desirable
behavior is achieved through the use of a physical or logical clock behavior is achieved through the use of a physical or logical clock
to establish the ''temporal order'' of topological change events. The to establish the ``temporal order'' of topological change events. The
established temporal ordering is subsequently used to structure (or established temporal ordering is subsequently used to structure (or
order) the algorithm's reaction to topological changes. order) the algorithm's reaction to topological changes.
1 Introduction 1 Introduction
The Temporally-Ordered Routing Algorithm (TORA) [1] is a highly The Temporally-Ordered Routing Algorithm (TORA) [1] is a highly
adaptive routing protocol, which has been tailored for operation in a adaptive routing protocol, which has been tailored for operation in a
Mobile Ad hoc Network (MANET). Such a network can be envisioned as a Mobile Ad hoc Network (MANET). Such a network can be envisioned as a
collection of routers (equipped with wireless receiver/transmitters), collection of routers (equipped with wireless receiver/transmitters),
which are free to move about arbitrarily. The status of the which are free to move about arbitrarily. The status of the
 End of changes. 

This html diff was produced by rfcdiff 1.23, available from http://www.levkowetz.com/ietf/tools/rfcdiff/