isBF: scalable in-packet bloom filter based multicast

Authors:
Ilya Nikolaevskiy;Andrey Lukyanenko;Tatiana Polishchuk;Valentin Polishchuk;Andrei Gurtov
Affiliations:
Aalto University, Finland;Aalto University, Finland;Aalto University, Finland;University of Helsinki, Finland;HIIT/Centre for Wireless Communications, Oulu, Finland
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 5
Cited 0

Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Revisiting IP multicast

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A data-oriented (and beyond) network architecture

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
LIPSIN: line speed publish/subscribe inter-networking

Proceedings of the ACM SIGCOMM 2009 conference on Data communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bloom filter based forwarding was proposed recently in several protocol alternatives to IP multicast. Even though some of these protocols avoid the state in intermediate routers, they still have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we propose an architecture based on in-packet Bloom filter forwarding, in which the burden of scalability management is left to the multicast source and end-hosts. We present several algorithms to improve the scalability of multicast transmission and evaluate them in a real Internet topology. Our evaluation confirms the ability of the proposed stateless design to save up to 70% of traffic volume in the large scale topology for big groups of subscribers, and up to 30% for small groups.