Data Synchronization Methods Based on ShuffleNet and Hypercube for Networked Information Systems

– In contrast to a typical single source of data updates in Internet applications, data files in a networked information system are often distributed, replicated, accessed and updated by multiple nodes. Due to concurrent updates, replicated data files must be synchronized. For certain applications, stringent concurrency control must be employed to ensure data integrity, while for other applications, periodic data synchronization may enable very efficient data sharing. For the latter applications, this paper devises the ShuffleNet and hypercube schemes for data synchronization in such networked information systems. Their performance in terms of update delay, processing complexity, failure tolerance and growth complexity is examined. Our results reveal that the ShuffleNet and hypercube scheme provide identical maximum update delay and similar processing complexity. However, as the number of nodes in the system changes (e.g., due to failure or temporary out of service for maintenance)...

• Type: Conference
• Year: 2006
• Where: INFOCOM
• Authors: David J. Houck, Kin K. Leung, Peter Winkler
• Keywords: Communications, Data Files, Data Synchronization, Hypercube Scheme, INFOCOM 2006