Optimization of Multicast Source-Routing Based on Bloom Filter

In multicast source-routing scheme, packet encodes the generated multicast tree at the header, and can be delivered successfully by checking the encoded tree. Traditional multicast source-routing uses a single Bloom filter (BF) to represent the multicast tree, which incurs high false positive rate and inefficient space utilization. In this letter, we propose two multicast source-routing using multiple BFs (MSRM), which generate multiple BFs and each BF only records one sub-tree of the multicast tree. In addition, we optimize the parameter settings with a given constraint on the number of false positives. The evaluation results show that MSRM gains great performance.

[1]  Roberto B. Martinez-Aguilar,et al.  Implementation of stateless routing mechanisms for multicast traffic on NetFPGA card , 2015, IEEE Colombian Conference on Communication and Computing (IEEE COLCOM 2015).

[2]  Pekka Nikander,et al.  Developing Information Networking Further: From PSIRP to PURSUIT , 2010, BROADNETS.

[3]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[4]  Péter Babarczi,et al.  Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding , 2015, IEEE/ACM Transactions on Networking.

[5]  Zhong Liu,et al.  Comparing set reconciliation methods based on bloom filters and their variants , 2016 .

[6]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

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

[8]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[9]  Yunhao Liu,et al.  On the Feasibility of Gradient-Based Data-Centric Routing Using Bloom Filters , 2014, IEEE Transactions on Parallel and Distributed Systems.

[10]  Laura Carrea,et al.  Optimized hash for network path encoding with minimized false positives , 2014, Comput. Networks.

[11]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[12]  Christian Esteve Rothenberg,et al.  In-packet Bloom filter based data center networking with distributed OpenFlow controllers , 2010, 2010 IEEE Globecom Workshops.

[13]  Hyesook Lim,et al.  Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters , 2014 .

[14]  Laura Carrea,et al.  Yes-no Bloom filter: A way of representing sets with fewer false positives , 2016, ArXiv.

[15]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.