Topology dissemination based on reverse-path forwarding
The obvious design for a wireless link-state protocol (such as the optimized link-state routing protocol) transmits large amounts of routing data, and this limits the utility of a link-state protocol when the network is made of moving nodes. The number and size of the routing transmissions make the network unusable for any but the smallest networks.
The conventional solution is to use a distance-vector routing protocol such as AODV, which usually transmits no data about routing. However, distance-vector routing requires more time to establish a connection, and the routes are less optimized than a link-state router.
TBRPF transmits only the differences between the previous network state and the current network state. Therefore, routing messages are smaller, and can therefore be sent more frequently. This means that nodes' routing tables are more up-to-date.
||This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (July 2013)|
- B. Bellur, and R.G. Ogier. 1999. "A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks," Proc. IEEE INFOCOMM ’99, pp. 178–186.
- R.G. Ogier, M.G. Lewis, F.L. Templin, and B. Bellur. 2002. "Topology Broadcast based on Reverse Path Forwarding (TBRPF)," RFC 3684.
- RFC 3684: Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)
- Packethop Inc. website
- "Topology Broadcast based on Reverse-Path Forwarding (TBRPF)". Engineering & Systems Group. SRI International. Archived from the original on 2012-01-13.