On-line decision making often involves significant amount of time-varying data, which can be regarded as dynamic data. Maintaining dynamic data consistency in existing P2P systems is often inefficient. Most of the previous P2P research works are predominantly remaining at the static files management. In this paper, we focus on the problem of maintaining consistency of dynamic data items in an overlay network of cooperating peers. We present CC-Buddy, an adaptive framework for efficiently disseminating dynamic data in P2P environments. Our approach combines application-level multicasting and demand-driven dissemination filtering techniques. We evaluate CC-Buddy with a prototype system built on top of BestPeer infrastructure. We examine our approach using real-world traces of dynamically changing data items. The results show our techniques can efficiently satisfy the consistency requirements by different users. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Gao, S., Ng, W. S., & Qian, W. (2004). Preserving consistency of dynamic data in peer-based caching systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3180, 622–633. https://doi.org/10.1007/978-3-540-30075-5_60
Mendeley helps you to discover research relevant for your work.