Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)

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.

[1]  Thomas Narten,et al.  Neighbor Discovery for IP Version 6 (IPv6) , 1996, RFC.

[2]  Randall J. Atkinson,et al.  IP Encapsulating Security Payload (ESP) , 1995, RFC.

[3]  John Moy,et al.  OSPF for IPv6 , 1999, RFC.

[4]  Jon Postel,et al.  Internet Protocol , 1981, RFC.

[5]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[6]  IPv6 Neighbor Discovery trust models and threats Status of this Memo , 2002 .

[7]  Stephen E. Deering,et al.  Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.

[8]  Stephen T. Kent,et al.  IP Authentication Header , 1995, RFC.

[9]  R. G. Ogier Efficient routing protocols for packet-radio networks based on tree sharing , 1999, 1999 IEEE International Workshop on Mobile Multimedia Communications (MoMuC'99) (Cat. No.99EX384).

[10]  Pekka Nikander,et al.  SEcure Neighbor Discovery (SEND) , 2005, RFC.

[11]  David C. Plummer,et al.  Ethernet Address Resolution Protocol: Or Converting Network Protocol Addresses to 48.bit Ethernet Address for Transmission on Ethernet Hardware , 1982, RFC.

[12]  Hugo Krawczyk,et al.  A Security Architecture for the Internet Protocol , 1999, IBM Syst. J..

[13]  Stephen T. Kent,et al.  Security Architecture for the Internet Protocol , 1998, RFC.

[14]  Fred Baker,et al.  Requirements for IP Version 4 Routers , 1995, RFC.

[15]  Charles E. Perkins,et al.  IP Mobility Support , 1996, RFC.

[16]  Robert T. Braden,et al.  Requirements for Internet Hosts - Communication Layers , 1989, RFC.

[17]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[18]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[19]  Scott O. Bradner,et al.  Key words for use in RFCs to Indicate Requirement Levels , 1997, RFC.

[20]  Charles E. Perkins,et al.  IP Flooding in Ad hoc Mobile Networks , 2005 .

[21]  Charles E. Perkins,et al.  IP Mobility Support for IPv4 , 2002, RFC.

[22]  Richard G. Ogier,et al.  A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).