The problem of information dissemination in large scale unstructured environments is studied and tackled using scalable policies in order to reduce the various disadvantages of the traditional flooding and random walkers approaches.
Example of the complementary advertisement and searching phases of information dissemination. (a.) The total number of sent messages H(L) as a function of the number of hops L that the information will be located at most; and (b.) number of messages for advertisement (E_L) and for searching (Σ∀u∈J(h_u(L))).