Update Propagation of Replicated Data in a Peer-to-Peer Environment 


Vol. 31,  No. 4, pp. 311-322, Apr.  2006


PDF
  Abstract

Peer-to-peer (P2P) systems have become a popular medium through which to share huge amounts of data. On the basis of network topology, P2P systems are divided into three types: centralized, structured distribution, unstructured distribution. Unstructured P2P systems such as Gnutella are novel in the sense that they are extensible and reliable. However, as the number of nodes increases, unstructured P2P systems would suffer from the high complexity of search operations that have to scan the network to find the required data items. Efficient replication of data items can reduce the complexity, but it introduces another problem of maintaining consistency among replicated data items when each data item could be updated. In this paper, we propose a new update propagation algorithm that propagates an updated data item to all of its replica. The proposed algorithm can reduce the message transfer overhead by adopting the notion of timestamp and hybrid push/pull messaging.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Choi and H. Cho, "Update Propagation of Replicated Data in a Peer-to-Peer Environment," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 311-322, 2006. DOI: .

[ACM Style]

Minyoung Choi and Haengrae Cho. 2006. Update Propagation of Replicated Data in a Peer-to-Peer Environment. The Journal of Korean Institute of Communications and Information Sciences, 31, 4, (2006), 311-322. DOI: .

[KICS Style]

Minyoung Choi and Haengrae Cho, "Update Propagation of Replicated Data in a Peer-to-Peer Environment," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 311-322, 4. 2006.