Abstract
In this paper, we propose a new collaborative caching strategy in a push-based broadcast environment where clients construct a peer-to-peer network by connecting with each other. In the proposed strategy, a client takes into account its own access probabilities and information on queries issued by other clients, and caches data items with large benefits of the response time. We confirm that the proposed strategy reduces the average response time by simulation experiments.
This is a preview of subscription content, log in via an institution to check access.
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
Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast Disks: Data Management for Asymmetric Communication Environments. In: Proc. ACM SIGMOD 1995, pp. 199–210 (1995)
Acharya, S., Franklin, M., Zdonik, S.: Prefetching from a Broadcast Disk. In: Proc. ICDE 1996, pp. 276–285 (1996)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-Peer Networks. In: Proc. ACM SIGCOMM 2002, pp. 177–190 (2002)
Dahlin, M., Wang, R., Anderson, T., Patterson, D.: Cooperative Caching: Using Remote Client Memory to Improve File System Performance. In: Proc. Symp. on Operating Systems Design and Implementation, pp. 267–280 (1994)
Fan, L., Cao, P., Almeida, J., Broder, A.: Summary Cache: A Scalable Wide-area Web Cache Sharing Protocol. In: Proc. ACM SIGCOMM 1998, pp. 254–265 (1998)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: Proc. ACM SIGCOMM 1999, pp. 251–262 (1999)
FreeNet, http://freenet.sourceforge.net
Gnutella, http://gnutella.wego.com
Hara, T.: Cooperative Caching by Mobile Clients in Push-based Information Systems. In: Proc. ACM CIKM 2002, pp. 186–193 (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. Int’l. Conf. on Supercomputing, pp. 84–95 (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network. In: Proc. ACM SIGCOMM 2001, pp. 161–172 (2001)
Sarkar, P., Hartman, J.: Efficient Cooperative Caching Using Hints. In: Proc. Symp. on Operating Systems Design and Implementation, pp. 35–46 (1996)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM 2001, pp. 149–160 (2001)
Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading (1949)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maeda, K., Uchida, W., Hara, T., Nishio, S. (2005). On a Collaborative Caching in a Peer-to-Peer Network for Push-Based Broadcast. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_86
Download citation
DOI: https://doi.org/10.1007/11546924_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)