SIAM Journal on Computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication
ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Giggle: a framework for constructing scalable replica location services
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
The SDSC storage resource broker
CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
IEBS ticketing protocol as answer to synchronization issue
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Context modelling and management in ambient-aware pervasive environments
LoCA'05 Proceedings of the First international conference on Location- and Context-Awareness
Message-Based Approach to Master Data Synchronization among Autonomous Information Systems
International Journal of Enterprise Information Systems
| Hi-index | 0.01 |
We present nsync, a tool for synchronizing large replicated data sets in distributed systems. nsync computes nearly optimal synchronization plans based on a hierarchy of gossip algorithms that take the network topology into account. Our primary design goals were maximum performance and maximum scalability. We achieved these goals by exploiting parallelism in the planning and the synchronization phase, by omitting transfer of unnecessary metadata, by synchronizing at a block level rather than a file level, and by using sophisticated compression methods. With its relaxed consistency semantic, nsync neither needs a master copy nor a quorum for updating distributed replicas. Each replica is kept as an autonomous entity and can be modified with the usual tools.