Topology Dissemination Based on Reverse-Path Forwarding (TBRPF): Correctness and Simulation Evaluation

DMCA

Topology Dissemination Based on Reverse-Path Forwarding (TBRPF): Correctness and Simulation Evaluation (2003)

Cached

Download Links

by R. Ogier , F. Templin , M. Lewis

Citations:

114 - 0 self

BibTeX

@TECHREPORT{Ogier03topologydissemination,
    author = {R. Ogier and F. Templin and M. Lewis},
    title = {Topology Dissemination Based on Reverse-Path Forwarding (TBRPF): Correctness and Simulation Evaluation},
    institution = {},
    year = {2003}
}

OpenURL

Abstract

This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (2004). All Rights Reserved. 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

Keyphrases

reverse-path forwarding topology dissemination simulation evaluation source tree right reserved reachable node internet community topology table copyright notice copyright dijkstra algorithm experimental protocol internet society mobile ad-hoc network partial topology information internet standard link-state routing protocol

DMCA