Scaling Bloom Filter Based Multicast With Hierarchical Tree Splitting

Bloom Filter based multicast has been proposed as a source-specific multicast solution to eliminate the multicast state requirements in the routers. However, the inherent limitation, the false positives, in the Bloom filter data structure amplifies the bandwidth wastage when the multicast tree scales to a large number of receivers. In this paper, the authors propose an algorithm which enhances the performance of the Bloom filter based multicast. It keeps the bandwidth waste below an acceptable upper bound while scaling the multicast tree for a large number of receivers.