Low complexity set reconciliation using Bloom filters

Proceedings of the 7th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing, FOMC'11

Volumn , Issue , 2011, Pages 33-41

  Skjegstad, Magnus ^a   Maseng, Torleiv ^b  

^a UNIVERSITY OF OSLO   (Norway)

^b NORWEGIAN DEFENCE RESEARCH ESTABLISHMENT FFI   (Norway)

Author keywords

Bloom filters; distributed algorithms; dynamic networks; information dissemination; set reconciliation

Indexed keywords

ALTERNATIVE METHODS; BANDWIDTH REQUIREMENT; BANDWIDTH USAGE; BLOOM FILTERS; COMPUTATIONAL REQUIREMENTS; DATA ELEMENTS; DISTRIBUTED ALGORITHM; DISTRIBUTED PROTOCOLS; DYNAMIC NETWORK; DYNAMIC NETWORKS; ERROR CORRECTING CODE; LOW COMPLEXITY; MOBILE ENVIRONMENTS; MULTIPLE NODES; PROBABILISTIC MEMBERSHIPS; RADIO BROADCASTS; SET RECONCILIATION; STATE INFORMATION;

BANDWIDTH; BLOOMS (METAL); DYNAMICS; MOBILE COMPUTING; OPTIMIZATION; RADIO BROADCASTING; SYNCHRONIZATION;

INFORMATION DISSEMINATION;

EID: 79960677733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998476.1998483     Document Type: Conference Paper

References (22)

1. M. Abolhasan, B. Hagelstein, and J. C.-P. Wang. Real-world performance of current proactive multi-hop mesh protocols. In 15th Asia-Pacific Conference on Communications, pages 44-47, Shanghai, China, Oct. 2009.
2. S. Agarwal and A. Trachtenberg. Practical set reconciliation implementation. "http://ipsit.bu.edu/programs/reconcile/", v0.998, 2004 (downloaded 07.03.2011).
3. P. S. Almeida, C. Baquero, N. Preguiça, and D. Hutchison. Scalable Bloom Filters. Information Processing Letters, 101(6):255-261, 2007. (Pubitemid 46096511)
4. F. Bjurefors, P. Gunningberg, E. Nordström, and C. Rohner. Interest dissemination in a searchable data-centric opportunistic network. In Wireless Conference (EW), 2010 European, pages 889-895. IEEE.
5. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
6. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2004.
7. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery across adaptive overlay networks. Networking, IEEE/ACM Transactions on, 12(5):767-780, oct. 2004.
8. B. Cohen. Incentives build robustness in bittorrent. May 2003.
9. P. Costa, C. Mascolo, M. Musolesi, and G. Picco. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. Selected Areas in Communications, IEEE Journal on, 26(5):748-760, 2008. (Pubitemid 351780193)
10. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazon's highly available key-value store. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, SOSP '07, pages 205-220, New York, NY, USA, 2007. ACM.
11. D. Guo, J. Wu, H. Chen, and X. Luo. Theory and Network Applications of Dynamic Bloom Filters. In INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pages 1-12, april 2006.
12. F. Hao, M. Kodialam, and T. Lakshman. Incremental Bloom Filters. In INFOCOM 2008. The 27th Conference on Computer Communications. IEEE, pages 1067-1075, 13-18 2008.
13. A. Kirsch and M. Mitzenmacher. Less hashing, same performance: Building a better Bloom filter. Random Structures and Algorithms, 33(2):187-218, 2008.
14. D. Kostić, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: high bandwidth data dissemination using an overlay mesh. In Proceedings of the nineteenth ACM symposium on Operating systems principles, SOSP '03, pages 282-297, New York, NY, USA, 2003. ACM.
15. D. Kostić, A. C. Snoeren, A. Vahdat, R. Braud, C. Killian, J. W. Anderson, J. Albrecht, A. Rodriguez, and E. Vandekieft. High-bandwidth data dissemination for large-scale distributed systems. ACM Trans. Comput. Syst., 26:3:1-3:61, March 2008.
16. A. Lakshman and P. Malik. Cassandra: a decentralized structured storage system. SIGOPS Oper. Syst. Rev., 44:35-40, April 2010.
17. Y. Minsky and A. Trachtenberg. Practical set reconciliation. In 40th Annual Allerton Conference on Communication, Control, and Computing, volume 248, 2002.
18. Y. Minsky, A. Trachtenberg, and R. Zippel. Set reconciliation with nearly optimal communication complexity. IEEE Transactions on Information Theory, 49(9):2213-2218, 2003.
19. M. Mitzenmacher. Compressed Bloom filters. IEEE/ACM Transactions on Networking (TON), 10(5):604-612, 2002. (Pubitemid 35312139)
20. E. Nordström, P. Gunningberg, and C. Rohner. A search-based network architecture for mobile devices. Technical Report 2009-003, Department of Information Technology, Uppsala University, Jan. 2009.
21. M. Skjegstad, F. T. Johnsen, T. Hafsøe, and K. Lund. Robust and Efficient Service Discovery in Highly Mobile Radio Networks using the MIST Protocol. In MILCOM 2010. The 29th IEEE Military Communications Conference, San Jose, CA, USA, November 2010.
22. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Duke Tech Report CS-2000-06, 2000.