DocumentCode
678578
Title
Set reconciliation in multi-node environment
Author
Selvan, Aravind
Author_Institution
CA Technol., India Technol. Center, Hyderabad, India
fYear
2013
fDate
4-6 July 2013
Firstpage
1
Lastpage
4
Abstract
Set reconciliation between nodes without prior context is an interesting problem that has numerous applications. Finding the set difference between two sets forms the basis of set reconciliation and de-duplication problems. As the number of devices spread across diverse networks required to be kept in sync is increasing, the cost of communication is increasingly proportionately. In this paper, I propose an effective scheme in terms of communication cost to reconcile the distributed data on all the nodes that don´t have any prior context of the other nodes.
Keywords
computer networks; data structures; deduplication problems; distributed data; diverse networks; multinode environment; set difference; set reconciliation; Computers; Context; Distributed databases; Indexes; Peer-to-peer computing; Software; Synchronization; algorithms; invertible bloom filters; set difference; set reconciliation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Communications and Networking Technologies (ICCCNT),2013 Fourth International Conference on
Conference_Location
Tiruchengode
Print_ISBN
978-1-4799-3925-1
Type
conf
DOI
10.1109/ICCCNT.2013.6726730
Filename
6726730
Link To Document