Abstract
In a P2P network, it is common that data items are replicated on multiple peers for improving data availability. In such an environment, when a data item is updated, the update should be immediately propagated to other peers holding its replicas. In this paper, we propose two update propagation strategies considering the degree of change in data update in P2P networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. SIGCOMM 2002, pp. 177–190 (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. ICS 2002, pp. 84–95 (2002)
Wang, Z., Das, S.K., Kumar, M., Shen, H.: Update propagation through replica chain in decentralized and unstructured P2P systems. In: Proc. P2P 2004, pp. 64–71 (2004)
Watanabe, T., Kanzaki, A., Hara, T., Nishio, S.: An Update Propagation Strategy for Delay Reduction and Node Failure Tolerance in Peer-to-Peer Networks. In: Proc. FINA 2007, pp. 103–108 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, T., Kanzaki, A., Hara, T., Nishio, S. (2009). Update Propagation Strategies Considering Degree of Data Update in Peer-to-Peer Networks. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00887-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-00887-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00886-3
Online ISBN: 978-3-642-00887-0
eBook Packages: Computer ScienceComputer Science (R0)