Technology and engineering · 2004
RFC 3684: Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)
by R. Ogier, F. Templin, M. Lewis
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
Anyone can see what's on the shelves. Open a book with a free account, and stay in touch with its book club.
- First published
- 2004
- Status
- Experimental
- Pages
- 46
- Updated by
- RFC 9141
- Copyright
- ✓ Free to read · Copied in full, as published
Where it comes from
RFC Editor · IETF Datatracker · IETF Trust Legal Provisions
Copied in full and unchanged from the RFC Editor, with the RFC's own notices. © IETF Trust and the persons identified as the document authors. The IETF Trust allows copying and distributing an RFC in full and without modification, so Micwyn shows it exactly as published and makes no study guide, audio or other version of it.
Discuss a passage
Select any passage in the reader and press Discuss to talk about it in public.