Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/2772722.2772740acmconferencesArticle/Chapter ViewAbstractPublication PagesancsConference Proceedingsconference-collections
research-article

Synchronizing Namespaces with Invertible Bloom Filters

Published: 07 May 2015 Publication History

Abstract

Data synchronization--long a staple in file systems--is emerging as a significant communications primitive. In a distributed system, data synchronization resolves differences among distributed sets of information. In named data networking (NDN), an information-centric communications architecture, data synchronization between multiple nodes is widely used to support basic services, such as public key distribution, file sharing, and route distribution. While existing NDN synchronization schemes are functional, their implementations rely on log-based representations of information, which creates a limitation on their performance and scalability.
This paper presents iSync, a high performance synchronization protocol for NDN. iSync supports efficient data reconciliation by representing the synchronized datasets using a two-level invertible Bloom filter (IBF) structure. A set-differences can be found by subtracting a remote IBF from a local IBF. The protocol can obtain multiple differences from a single round of data exchange, and does not require prior context in most application scenarios. We evaluated iSync's performance by comparing it to the CCNx synchronization protocol. Experiments show that iSync is about eight times faster across a range of network topologies and sizes, and that it reduces the number of packets sent by about 90%.

References

[1]
Lixia Zhang, Deborah Estrin, and et al. Named data networking project. Relatório Técnico NDN-0001, Xerox Palo Alto Research Center-PARC, 2010.
[2]
Giulio Grassi, Davide Pesavento, Lucas Wang, Giovanni Pau, Rama Vuyyuru, Ryuji Wakikawa, and Lixia Zhang. Vehicular inter-networking via named data. arXiv preprint arXiv:1310.5980, 2013.
[3]
The dropbox website. https://www.dropbox.com/.
[4]
Michael T Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables. In Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on, pages 792--799. IEEE, 2011.
[5]
David Eppstein, Michael T Goodrich, and et al. What's the difference? efficient set reconciliation without prior context. In ACM SIGCOMM Computer Communication Review, volume 41, pages 218--229. ACM, 2011.
[6]
Content centric networking (CCNx) project website. http://www.ccnx.org.
[7]
Andrew Tridgell and Paul Mackerras. The rsync algorithm,"australian national university. Technical report, TR-CS-96-05, 1996.
[8]
Van Jacobson, Rebecca L Braynard, and et al. Custodian-based information sharing. Communications Magazine, IEEE, 50(7):38--43, 2012.
[9]
Zhenkai Zhu and Alexander Afanasyev. Let°Øs chronosync: Decentralized dataset state synchronization in named data networking. In Proceedings of the 21st IEEE International Conference on Network Protocols (ICNP 2013).
[10]
Zhenkai Zhu and Chaoyi et al. Bian. Chronos: Serverless multi-user chat over ndn. Technical report, Technical Report TR008, UCLA Named Data Networking Project, 2012.
[11]
Ralph C Merkle. A certified digital signature. In Advances in Cryptology Proceedings, pages 218--238. Springer, 1990.
[12]
Sachin Agarwal, Starobinski, and et al. On the scalability of data synchronization protocols for pdas and mobile devices. Network, IEEE, 16(4):22--28, 2002.
[13]
Cedric Westphal. Synchronizing state with strong similarity between local and remote systems. In Proceedings of the Third ACM Workshop on Mobile Cloud Computing and Services, MCS '12, pages 15--20, 2012.
[14]
Bittorrent sync website. http://www.bittorrent.com/sync.
[15]
The Google Drive website. http://www.google.com/drive/about.html.
[16]
NSF future Internet architecture project website. http://www.nets-fia.net/.
[17]
Ralph C Merkle. A fast software one-way hash function. Journal of Cryptology, 3(1):43--58, 1990.
[18]
Jean-Sébastien Coron, Yevgeniy Dodis, and et al. Merkle-damgård revisited: How to construct a hash function. In Advances in Cryptology--CRYPTO 2005, pages 430--448. Springer, 2005.
[19]
Gary D Knott. Expandable open addressing hash table storage and retrieval. In Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, pages 187--206. ACM, 1971.
[20]
Witold Litwin. Linear hashing: a new tool for file and table addressing. In VLDB, volume 80, pages 1--3, 1980.
[21]
Charlie Wiseman, Jonathan Turner, and et al. A remotely accessible network processor-based router for network experimentation. In Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pages 20--29. ACM, 2008.

Cited By

View all
  • (2018)NDNizing existing applicationsProceedings of the 5th ACM Conference on Information-Centric Networking10.1145/3267955.3267969(172-183)Online publication date: 21-Sep-2018
  • (2018)Decoupling information and connectivity via information-centric transportProceedings of the 5th ACM Conference on Information-Centric Networking10.1145/3267955.3267963(54-66)Online publication date: 21-Sep-2018
  • (2017)VectorSyncProceedings of the 4th ACM Conference on Information-Centric Networking10.1145/3125719.3132106(192-193)Online publication date: 26-Sep-2017
  • Show More Cited By

Index Terms

  1. Synchronizing Namespaces with Invertible Bloom Filters

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ANCS '15: Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems
    May 2015
    224 pages
    ISBN:9781467366328

    Sponsors

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 07 May 2015

    Check for updates

    Author Tags

    1. data synchronization
    2. high performance
    3. invertible bloom filters
    4. named data networking

    Qualifiers

    • Research-article

    Funding Sources

    • NSF

    Acceptance Rates

    Overall Acceptance Rate 88 of 314 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 26 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)NDNizing existing applicationsProceedings of the 5th ACM Conference on Information-Centric Networking10.1145/3267955.3267969(172-183)Online publication date: 21-Sep-2018
    • (2018)Decoupling information and connectivity via information-centric transportProceedings of the 5th ACM Conference on Information-Centric Networking10.1145/3267955.3267963(54-66)Online publication date: 21-Sep-2018
    • (2017)VectorSyncProceedings of the 4th ACM Conference on Information-Centric Networking10.1145/3125719.3132106(192-193)Online publication date: 26-Sep-2017
    • (2017)Controlling Strategy Retransmissions in Named Data NetworkingProceedings of the Symposium on Architectures for Networking and Communications Systems10.1109/ANCS.2017.17(70-81)Online publication date: 18-May-2017
    • (2016)Anticipating policy and social implications of named data networkingCommunications of the ACM10.1145/291591559:12(92-101)Online publication date: 1-Dec-2016

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media