Stateless overlay multicast with in-packet bloom filters

Abstract Due to the difficulty of deploying Internet protocol (IP) multicast on the Internet on a large scale, overlay multicast has been considered as a promising alternative to develop the multicast communication in recent years. However, the existing overlay multicast solutions suffer from high costs to maintain the state information of nodes in the multicast forwarding tree. A stateless overlay multicast scheme is proposed, in which the multicast routing information is encoded by a bloom filter (BF) and encapsulated into the packet header without any need for maintaining the multicast forwarding tree. Our scheme leverages the node heterogeneity and proximity information in the physical topology and hierarchically constructs the transit-stub overlay topology by assigning geometric coordinates to all overlay nodes. More importantly, the scheme uses BF technology to identify the nodes and links of the multicast forwarding tree, which improves the forwarding efficiency and decreases the false-positive forwarding loop. The analytical and simulation results show that the proposal can achieve high forwarding efficiency and good scalability.

[1]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[2]  Nalini Venkatasubramanian,et al.  Efficient and Reliable Application Layer Multicast for Flash Dissemination , 2014, IEEE Transactions on Parallel and Distributed Systems.

[3]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[4]  Kianoosh Mokhtarian,et al.  Minimum-Delay Multicast Algorithms for Mesh Overlays , 2015, IEEE/ACM Transactions on Networking.

[5]  Jörg Ott,et al.  Forwarding anomalies in Bloom filter-based multicast , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  Shervin Shirmohammadi,et al.  A survey of application-layer multicast protocols , 2007, IEEE Communications Surveys & Tutorials.

[7]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[8]  Christian Schindelhauer,et al.  Performance of distributed algorithms for topology control in wireless networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[9]  Kianoosh Mokhtarian,et al.  Minimum-delay overlay multicast , 2013, 2013 Proceedings IEEE INFOCOM.

[10]  Qinghua Zheng,et al.  An overlay multicast protocol for live streaming and delay-guaranteed interactive media , 2012, J. Netw. Comput. Appl..

[11]  Kamil Saraç,et al.  A survey on the design, applications, and enhancements of application-layer overlay networks , 2010, CSUR.

[12]  Sasu Tarkoma,et al.  Theory and Practice of Bloom Filters for Distributed Systems , 2012, IEEE Communications Surveys & Tutorials.

[13]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[14]  Xiaohua Tian,et al.  Loop mitigation in bloom filter based multicast: A destination-oriented approach , 2012, 2012 Proceedings IEEE INFOCOM.

[15]  Samir Khuller,et al.  OMNI: An efficient overlay multicast infrastructure for real-time applications , 2006, Comput. Networks.

[16]  George Xylomenos,et al.  Scaling Bloom filter-based multicast via filter switching , 2013, 2013 IEEE Symposium on Computers and Communications (ISCC).

[17]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[18]  Mario Gerla,et al.  A Scalable Overlay Multicast Architecture for Large-Scale Applications , 2007, IEEE Transactions on Parallel and Distributed Systems.

[19]  Alexander Wiesmaier,et al.  In-packet Bloom filters: Design and networking applications , 2011, Comput. Networks.

[20]  Pekka Nikander,et al.  LIPSIN: line speed publish/subscribe inter-networking , 2009, SIGCOMM '09.

[21]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[22]  Zhongcheng Li,et al.  Fast and proximity-aware multi-source overlay multicast under heterogeneous environment , 2009, Comput. Commun..

[23]  Péter Babarczi,et al.  Stateless multi-stage dissemination of information: Source routing revisited , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).