Stateless multi-stage dissemination of information: Source routing revisited

TLDR: This paper revisits the idea of in-packet Bloom filters and source routing by enclosing limited information about the structure of the tree, namely its stage decomposition, which helps to get rid of typical Bloom filter illnesses as infinite loops and false positive forwarding.

Abstract: Large-scale information distribution has been increasingly attracting attention, be it through uptake in new services or through recent research efforts in fields like information-centric networking. The core issue to be addressed is the more efficient distribution of information to a large set of receivers. Avoiding state in the forwarding elements is crucial for any scheme to be successful. This paper addresses this challenge by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept which represent the trees flatly as sets, we build our filter by enclosing limited information about the structure of the tree, namely its stage decomposition, which helps to get rid of typical Bloom filter illnesses as infinite loops and false positive forwarding. Our analytical and simulation results show that by using this information we obtain more succinct tree representation while still maintaining forwarding efficiency.