1.6 Applicability Statement

The protocol is intended for a setting in which all nodes in a graph have symmetric connectivity--any node can successfully form a TCP connection to any other node. To the extent that this is not true, the reliability and efficiency characteristics of a graph degrade.

Because there is redundancy inherent in the record flooding protocol, the Peer-to-Peer Graphing Protocol is better suited to smaller chunks of data. For example, using a graph for distribution of file metadata is more appropriate than using a graph for file distribution.

The Peer-to-Peer Graphing Protocol is equally suited to scenarios where one node is a broadcaster and all others are receivers and scenarios where all nodes are equally publishing.