參考文獻 |
[1] J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” in Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 85-97, 1998.
[2] I. Clarke, O. Sandberg, B. Wiley, and T. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” in Proceedings of the International Computer Science Institute (ICSI) Workshop on Design Issues in Anonymity and Unobservability, pp. 311-320, July 2000.
[3] S. Daswani and A. Fisk, Gnutella UDP Extension for Scalable Searches v0.1.
[4] eDonkey, http://www.edonkey2000.com/.
[5] eMule, http://www.emule-project.net/.
[6] F. P. Franciscani, M. A. Vasconcelos, R. P. Couto, and A. A. F. Loureiro, “Peer-to-Peer over Ad Hoc Networks: (Re)Configuration Algorithms,” in Proceedings of the International Parallel and Distributed Processing Symposium, pp.32.2, 2003.
[7] Gnutella, The Gnutella Protocol Specification v0.4.
[8] Gnutella2, The Gnutella2 Protocol Specification.
[9] S. K. Goel, M. Singh, and D. Xu, “Efficient Peer-to-Peer Data Dissemination in Mobile Ad-Hoc Networks,” in Proceedings of the International Conference on Parallel Processing Workshops, pp. 152-158, 2002.
[10] Y. Guo, K. Suh, J. Kurose, and D. Towsley, “P2Cast: Peer-to-peer Patching Scheme for VoD Service,” in Proceedings of the International Conference on World Wide Web, pp. 301-309, 2003.
[11] D. Hand, H. Mannila, and P. Smyth, “Principles of Data Mining,” MIT Press, 2001.
[12] D. B. Johnson, D. A. Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks” in Ad Hoc Networking, Edited by Charles E. Perkins, Chapter 5, pp. 139-172, Addison-Wesley, 2001
[13] K. Kant, R. Iyer, and V. Tewari, “A Framework for Classifying Peer-to-Peer Technologies”, in Proceedings of the Second IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 338-345, 2002.
[14] D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 654-663, 1997.
[15] KaZaA, http://www.kazaa.com/.
[16] T. Lin and H. Wang, “Search Performance Analysis in Peer-to-Peer Networks,” in Proceedings of the Third International Conference on Peer-to-peer Computing, pp. 204-205, 2003.
[17] C. Lindemann and O. P. Waldhorst, “A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications,” in Proceedings of the Second International Conference on Peer-to-Peer Computing, pp. 73-80, 2002.
[18] N. Minar, “Distributed Systems Topologies,” in Proceedings of the O'Reilly Peer-to-Peer and Web Services Conference, 2001.
[19] Morpheus, http://www.morpheus.com/.
[20] Napster, http://www.napster.com.
[21] A. Oram, “Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology,” O’Reilly & Associates, Inc, 2001.
[22] M. Papadopouli, and H. Schulzrinne, “Effects of Power Conservation, Wireless Coverage and Cooperation on Data Dissemination among Mobile Devices,” in Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 117-127, 2001.
[23] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” in Proceedings of ACM SIGCOMM'94, pp. 234-244, 1994.
[24] C. E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” in Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 90-100, 1999.
[25] G. P. Premkumar, “Alternate Distribution Strategies for Digital Music,” Communications of the ACM, Vol. 46, No. 9, pp. 89-95, September 2003.
[26] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” in Proceedings of ACM SIGCOMM 2001, pp. 161-172, 2001.
[27] M. Rieanu, “Peer-to-Peer Architecture Case Study: Gnutella Network,” in Proceedings of the First International Conference on Peer-to-Peer Computing, pp. 99-100, 2001.
[28] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems,” in Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329-350, November 2001.
[29] R. Schollmeier, I. Gruber, and M. Finkenzeller, “Routing in Mobile Ad Hoc and Peer-to-Peer Networks. A Comparison,” in Proceedings of International Workshop on Peer-to-Peer Computing, 2002.
[30] A. Silberschatz, G. Gagne, and P. B. Galvin, “Operating System Concepts,” John Wiley & Sons, Inc., Sixth Edition, 2002.
[31] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” IEEE/ACM Transactions on Networking, Vol. 11, No. 1, pp. 17-32, February 2003.
[32] Y. Wang and J. Vassileva, “Trust and Reputation Model in Peer-to-Peer Networks,” in Proceedings of the Third International Conference on Peer-to-peer Computing, pp. 150-157, 2003.
[33] J. Xiao, Y. Zhang, X. Jia, and T. Li, “Measuring Similarity of Interests for Clustering Web-Users,” in Proceedings of the 12th Australasian Database Conference, pp. 107-114, 2001. |