RFC 3684: Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)
In plain English — editorial summary, not part of the RFC
Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) is a proactive, link-state routing protocol designed for mobile ad-hoc networks, which provides hop-by-hop routing along shortest paths to each destination. Each node running TBRPF computes a source tree (providing paths to all reachable nodes) based on partial topology information stored in its topology table, using a modification of Dijkstra's algorithm. To minimize overhead, each node reports only *part* of its source tree to neighbors. TBRPF uses a combination of periodic and differential updates to keep all neighbors informed of the reported part of its source tree. Each node also has the option to report additional topology information (up to the full topology), to provide improved robustness in highly mobile networks. TBRPF performs neighbor discovery using "differential" HELLO messages which report only *changes* in the status of neighbors. This results in HELLO messages that are much smaller than those of other link-state routing protocols such as OSPF. This memo defines an Experimental Protocol for the Internet community.
Document record
- Document ID
- RFC3684
- Published
- February 2004
- Authors
- R. Ogier; F. Templin; M. Lewis
- Status
- EXPERIMENTAL
- Stream
- IETF
- Area
- rtg
- Pages
- 46
- Also known as
- —
- Updated by:
- RFC 9141
Topics
Referenced by
One later RFC formally updates or obsoletes part of this document.
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 5614Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) FloodingUpdated
August 2009
- RFC 6779Definition of Managed Objects for the Neighborhood Discovery ProtocolObsoleted
October 2012
- RFC 7939Definition of Managed Objects for the Neighborhood Discovery ProtocolCurrent
August 2016
- RFC 4140Hierarchical Mobile IPv6 Mobility Management (HMIPv6)Obsoleted
August 2005
- RFC 4429Optimistic Duplicate Address Detection (DAD) for IPv6Updated
April 2006
- RFC 5121Transmission of IPv6 via the IPv6 Convergence Sublayer over IEEE 802.16 NetworksUpdated
February 2008
- RFC 6059Simple Procedures for Detecting Network Attachment in IPv6Current
November 2010
- RFC 6820Address Resolution Problems in Large Data Center NetworksCurrent
January 2013
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?