XBF: Scaling up Bloom-filter-based Source Routing

A well known drawback of IP-multicast is that it requires per-group state to be stored in the routers. Bloom-filter based source-routed multicast remedies this problem by moving the state from the routers to the packets. However, a fixed sized Bloom-filter can only store a limited number of items before the false positive ratio grows too high implying scalability issues. Several proposals have tried to address these scalability issues in Bloom-filter forwarding. These proposals, however, unnecessarily increase the forwarding complexity. In this paper, we present Extensible-Bloom-filter (XBF), a new framing and forwarding solution which effectively circumvents the aforementioned drawbacks. XBF partitions a network into sub-networks that reflect the network topology and traffic patterns, and uses a separate fixed-length Bloom-filter in each of these. We formulate this partition assignment problem into a balanced edge partitioning problem, and evaluate it with simulations on realistic topologies. Our results show that XBF scales to very large networks with minimal overhead and completely eliminates the false-positives that have plagued the traditional Bloom-filter-based forwarding protocols. It furthermore integrates with SDN environments, making it highly suitable for deployments in off-the-shelf SDN-based networks.

[1]  Tuomas Aura,et al.  Scaling Bloom filter based multicast with hierarchical tree splitting , 2012, 2012 IEEE International Conference on Communications (ICC).

[2]  Henry J. Fowler,et al.  Local Area Network Traffic Characteristics, with Implications for Broadband Network Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[3]  Andrei V. Gurtov,et al.  isBF: scalable in-packet bloom filter based multicast , 2013, SAC '13.

[4]  Leandro Navarro-Moldes,et al.  Topology patterns of a community network: Guifi.net , 2012, 2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[5]  Pekka Nikander,et al.  MPSS: Multiprotocol Stateless Switching , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[6]  Dan Li,et al.  ESM: Efficient and Scalable Data Center Multicast Routing , 2012, IEEE/ACM Transactions on Networking.

[7]  HyunYong Lee,et al.  Improving Bloom Filter Forwarding Architectures , 2014, IEEE Communications Letters.

[8]  Tuomas Aura,et al.  Denial-of-Service Attacks in Bloom-Filter-Based Forwarding , 2014, IEEE/ACM Transactions on Networking.

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

[10]  George Varghese,et al.  P4: programming protocol-independent packet processors , 2013, CCRV.

[11]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[12]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

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

[14]  Priya Mahadevan,et al.  The internet AS-level topology: three data sources and one definitive metric , 2005, Comput. Commun. Rev..

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

[16]  Scott Shenker,et al.  Revisiting IP multicast , 2006, SIGCOMM '06.

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

[18]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[19]  Dirk Trossen,et al.  Scalable forwarding for information-centric networks , 2013, 2013 IEEE International Conference on Communications (ICC).

[20]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[21]  Spiros Spirou,et al.  Stateless multicast switching in software defined networks , 2016, 2016 IEEE International Conference on Communications (ICC).

[22]  András Zahemszky,et al.  Fast reroute for stateless multicast , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[23]  Marc Lelarge,et al.  Balanced graph edge partition , 2014, KDD.

[24]  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).

[25]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

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

[27]  Janne Riihijärvi,et al.  IP over ICN - The better IP? , 2015, 2015 European Conference on Networks and Communications (EuCNC).

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

[29]  Fang Hao,et al.  Building high accuracy bloom filters using partitioned hashing , 2007, SIGMETRICS '07.

[30]  Joseph Gonzalez,et al.  PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs , 2012, OSDI.