Topology dissemination based on reverse-path forwarding: Difference between revisions

Content deleted Content added

Inline

Revision as of 13:39, 25 May 2008

Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) is a link-state routing protocol for wireless mesh networks.

The obvious design for a wireless link-state protocol (such as OLSR) 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.

TBRPF is controlled under a US patent filed in December 2000 and assigned to SRI International (Patent ID 6845091, issued January 18, 2005).

Links

RFC 3684: Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)
Packethop Inc. website

References

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)," draft-ietf-manet-tbrpf-06.txt, (November) (work in progress).

@@ Line 1: / Line 1: @@
-'''Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)''' is a [[Link-state routing protocol]] for [[wireless mesh network]]s.
+'''Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)''' is a [[link-state routing protocol]] for [[wireless mesh network]]s.
 The obvious design for a wireless link-state protocol (such as [[OLSR]]) 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.
+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.