參考目錄 參考目錄 參考目錄
[1] Gnutella http://www.gnutella.com.
[2] Freenet http://freenet.sourceforge.com [3] Bittorrent http://www.bittorrent.com/
[4] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable content-addressable network. In Proceedings of the 2001 conference on appli-cations, technologies, architectures, and
protocols for computer communications (SIG-COMM), pages 161–172. ACM Pres, August 2001.
[5] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pages 149–160. ACM Press, Auguest 2001.
[6] Antony Rowstron and Peter Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceeding of IFIP/ACM International Conference on Distributed Systems Platforms, pages 329–350, November 2001.
[7] C. Greg Plaxyon, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceeding of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), pages 311~320. ACM Press, June 1997.
[8] E. P. Markatos. Tracing a large-scale peer to peer system: An hour in the life of gnutella. In Proceedings of the 2nd IEEE / ACM International Symposium Cluster Computing and the GRID (CCGRID 2002), page 65-74. IEEE Computer Society, 2002.
[9] C. Wang, L.Xiao, Y. Liu, and P. Zheng. Distributed caching and adaptive search in multiplayer P2P networks. In Proceeding of 24th International Conference on Distributed Computing Systems (IDCS’04), 2004
[10] S. Patro and Y. C. Hu. Transparent query caching in peer-to-peer overlay networks. In Proceedings of International Parallel and Distributed Processing Symposium (IDCS’03), 2003
[11] B. M. Duska, D. Marwood, and M. J. Freeley. The measured access characteristics of World-Wide-Web client proxy caches. In Proceedings of the USENIX Symposium on Internet Technologies and Systems (ITS’97), 1997 [12] M. Kacimi and K. Yetongnon. Evaluation study of a distributed caching
- 68 -
based on query similarity in P2P network. In Proceedings of The 2nd
International Conference on Scalable Information Systems (INFOSCALE 2007), 2007
[13] L. Fan, P. Cao, J. Almeida and A. Z. Border. Summary Cache: A scalable wide-area Web cache sharing protocal. In IEEE/ACM Transactions on
networking, 8(3): 281-293, 2000
[14] D. Karger, E. Lehman, F. L. Leighton, M. Levine, D. Lewin and R.
Panigrahy. Consistent hashing and random tree: Distributed caching protocals for relieving hot spots on the World Wide-Web. In Proceedings of the 29th ACM Symposium on Theory of Computing, 1997.
[15] S. Iyer, A. Rowstron and P. Druschel, Squirrel: A decentralized peer-to-peer web cache. In Proceedings of the 21th ACM Symposium on Principles of Distributed Computing (PODC 2002), page 213-222, 2002 [16] P. Linga, I. Gupta and K, Birman. A churn-resistant peer-to-peer web caching system, In Proceedings of ACM workshop on Survivable and
self-regenerative systems, 2003
[17] M. Roussopoulos and M. Baker. CUP: Controlled Update Propagation in Peer-to-Peer Networks. In Proceeding of International Workshop on
Peer-to-Peer Systems (IPTPS’04), 2004
[18] R. P. Zhao, J. D. Kibiatowicz, and A. D. Joseph. Tapestry: An infrastructure for faul-tolerant wide-area location androuting. Technical report, University of California, Berkeley, April 04, 2001
[19] R. Bhagwan, K. Tati, Y. C. Cheng, S. Savage, and G.M. Voelker. Total Recall: System support for automated availability management. In
Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI), 2004
[20] D. J. Watts*, S. H. Strogatz. Collective dynamics of ‘small-world’
networks. In Nature, 1998
[21] J. Kleinberg. The Small-world Phenomenon: An Algorithmic Perspective*.
In Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
[22] H. Zhang, A. Goel, R.Govindan, Using the small-world model to improve Freenet performance. In Science Direct-Computer Network 46: 555-574, 2004 [23] S. Merugu*, S. Srinivasan, E. Zegura. Adding structure to unstructured peer-to-peer networks: the use of small-world graphs. In J. Parallel Distrib. Comput. 65(2005) p.142~p.153
[24] K. Sripanidkulchai, B. Maggs, H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. . . . In INFOCOM 2003.
Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE
[25] M. Berry, Z. Drmac, and E. Jessup, Matrices, Vector Spaces, and Information Retrieval, In SIAM Review, 41(2):335-362, 1999.
[26] M. W. Berry, S. T. Dumais, and G. W. O'Brien, Using Linear Algebra for Intelligent Information Retrieval, In SIAM Review, 37(4):573-595, 1995.
[27] BRITE. http://www.cs.bu.edu./brite/, 2003.
[28] Yi-Fang Chou, Donuts: A Network-Aware and Load-Balanced System for Range Query
[29] Wing Tat Wong, A Proximity-Aware and Group-based Peer to Peer System for Range Query.
[30] J. Aspenes and G. Shah. Skip graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pages 384~393.
Society for Industrial and Applied Mathematics, Jan. 2003.
[31] S. Podlipnig, and L. Ormenyi. A Survey of Web Cache Replacement Strategies. In ACM Computing Surveys (CSUR), pages 374~398, 2003 [32] Abrams M., Standridge C. R., Abdulla G., and Williams S. Caching proxies: Limitations and potentials. In Proceedings of the 4th International World Wide Web Conference. 1995
[33] AGGARWAL,C.C.,WOLF ,J.L., AND YU, P. S. 1999. Caching on the World Wide Web. IEEE Trans. Knowl. Data Eng. 11, 1 (Jan.), 94–107.
[34] ARLITT , M., FRIEDRICH, R., AND JIN, T. 1999a. Workload
characterization of a Web proxy in a cable modem environment. ACM SIGMETRICS Perform. Eval. Rev. 27, 2, 25–36.
[35] REDDY,M. AND FLETCHER, G. P. 1998. Intelligent Web caching using document life histories: A comparison with existing cache management techniques. In Proceedings of the 3rd International Web Caching Workshop.
[36] CHANG, C.-Y., MCGREGOR,T., AND HOLMES, G. 1999. The LRU* WWW proxy cache document replacement algorithm. In Proceedings of the Asia Pacific Web Conference.
[37] RIZZO,L. AND VICISANO, L. 2000. Replacement policies for a proxy cache.
IEEE/ACM Trans. Netw. 8, 2 (Apr.), 158–170.
[38] S. Saroiu, P. K. Gummadi, and S. D. Gribble, A Measurement Study of Peer-to-Peer File Sharing Systems. In ACM SIGCOMM Computer Communication Review, Jan. 2002.
[39] A. Medina, I. Matta and John Byers. On the Origin of Power Laws in Internet Topologies*. ACM SIGCOMM Computer Communication Review, April
- 70 -
2000
[40] J. C. Chu, K. S. Labonte, and B. N. Levine. Availability and locality measurements of peer-to-peer file systems. In Proceedings of SPIE Vol. 4868, 2002
[41] Zhiyong Xu and Yiming Hu. Exploiting Spatial Locality to Improve Peer-to-Peer System Performance. In Proceedings of the The Third IEEE Workshop on Internet Applications (WIAPP), 2003
[42] J. Wang. A survey of web caching schemes for the internet. ACMComputer Communication Review, 29(5):36–46, 1999
[43] A. Mahanti,D. Eager and C. Williamson. Temporal locality and its impact on Web proxy cache performance. Special issue on internet performance modeling, pages: 187 - 203,2000
[44] A.R. Bharambe, M. Agrawal and S. Seshen. Mercury: supporting scalable multi-attribute range queries. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications. Pages 353~366, 2004
[45] Rizzo L. and Vicisano L. Replacement policy for a proxy cache. In Networking, IEEE/ACM Transactions on, April 2000.