A Way of Eliminating Errors When Using Bloom Filters for Routing in Computer Networks

A Bloom filter is a data type for storing sets. It can be considered as a data compression technique, but its more important feature is an extremely fast access to stored data. This is why it can be useful when calculation needs to be performed very quickly, for example, in an application to routing messages in a computer network. A well-known shortcoming of a Bloom filter are errors in the stored data. We present a way of labeling links in a computer network which prevents errors in Bloom filters in some routing scenarios and, therefore, results in a more efficient use of network resources.

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

[2]  James K. Mullin,et al.  A second look at bloom filters , 1983, CACM.

[3]  Laura Carrea,et al.  An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters , 2016, Eur. J. Oper. Res..

[4]  Yi Lu,et al.  Perfect Hashing for Network Applications , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

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

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

[8]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[9]  Lijuan Peng,et al.  Application of Bloom Filter in Grid Information Service , 2010, 2010 International Conference on Multimedia Information Networking and Security.

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

[11]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[12]  Tilman Wolf.  A Credential-Based Data Path Architecture for Assurable Global Networking , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[13]  George Varghese,et al.  Biff (Bloom filter) codes: Fast error correction for large data sets , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[14]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[15]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[16]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..