|
[1] http://www.twnic.net.tw/dn/dn_g_01.htm#4 [2] http://www.sun.com/executives/sunjournal/v4n3/feature3.html [3] Napster website http://www.napster.com. [4] Morpheus website http://www.musiccity.com. [5] KaZaA website. http://www.kazaa.com. [6] Limewire website. http://www.limewire.com. [7] Seti@Home website http://setiathome.ssl.berkely.edu. [8] Folding@home. http://www.stanford.edu/group/pandegroup/Cosm. [9] PopularPower website. http://www.popularpower.com [10] Intel. Peer to Peer Computing: NetBatch Case Study. available in http://www.intel.com/eBusiness/pdf/it/wp014703.pdf ( August 2000). [11] AOL Instant Messenger. http://www.aim.com. [12] ICQ website http://www.icq.com/. [13] MSN Messenger website: http://www.msn.com/. [14] Jabber website. http://www.jabber.com. [15] Freehaven website. http://freehaven.net. [16] Publius website http://www.publius.com. [17] MojoNation website. http://www.mojonation.net. [18] Edonkey website. http://ed2k.ok.to. [19] Ezpeer website. http://www.ezpeer.com.tw. [20] Music.com.tw,. http://www.kuro.com.tw. [21] Gnutella website http://www.gnutella.com. [22] Freenet website http://freenet.sourceforge.com/. [23] WinMX website http://www.winmx.com/. [24] BearShare website http://www.bearshare.com/ [25] eMule website http://www.emule-project.net. [26] Stoica I., Morris R., Karger D., Kaashoek F. and Balakrishnan H. (2001) Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. ACM SIGCOMM 2001, pp. 160-177., San Diego. [27] Zhao B. Y., Kubiatowicz J. D. and Joseph A. D. (2001) Tapestry: An infrastructure for fault-resilient wide-area location and routing, Tech. Rep. UCB//CSD-01-1141, U. C. Berkeley, April 2001. [28] Rowstron A. and Druschel P. (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany. [29] Ratnasamy S., Francis P., Handley M., Karp R. and Shenker S. (2001) A scalable content addressable network. ACM SIGCOMM 2001, pp. 149-160, San Diego, CA. [30] Plaxton C., Rajaraman R. and Richa A. (1997) Accessing nearby copies of replicated objects in a distributed environment. Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA97), pp. 311-320, Newport, Rhode Island. [31] Druschel P. and Rowstron A. (2001) PAST: A large-scale, persistent peer-to-peer storage utility. Eighth Workshop on Hot Topics in Operating Systems (HotOS-VIII, 2001), Schloss Elmau, Germany. [32] Daswani N., Garcia-Molina H. and Yang B. (2003) Open Problems in Data-Sharing Peer-to-Peer Systems. 9th International Conference on Database Theory (ICDT03), Siena, Italy. [33] Ratnasamy S., Shenker S. and Stoica I. (2002) Routing Algorithms for DHT: Some Open Questions. IPTPS 2002. [34] Malkhi D., Naor M. and Ratajczak D. (2002) Viceroy: A Scalable and Dynamic Lookup Network. 21st ACM Symposium on Principles of Distributed Computing (PODC02), Monterey, CA, USA. [35] H.J. Siegel. (1979) Interconnection networks for SIMD machines. IEEE Computer 12(6):57-65, 1979. [36] J. Kleinberg. (200) The small world phenomenon: An algorithmic perspective. 32nd ACM Symposium on Theory of Computing , May 2000, pp. 163-170. [37] Manku G. S., Bawa M. and Raghavan P. (2003) Symphony: Distributed Hashing In a Small World. 4th USENIX Symposium on Internet Technologies and Systems (USITS03), Seattle, WA. [38] Considine J. and FLorio T. A. (2002) Scalable Peer-to-Peer Indexing with Constant State, Technical Report, 2002. [39] Pandurangan G., Raghavan P. and Upfal E. (2001) Building lowdiameter peer-to-peer networks. 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS01). [40] Ripeanu M., Foster I. and Iamnitchi A. (2002) Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing 6(1). [41] Saroiu S., Gummadi P. and Gribble S. (2002) A Measurement Study of Peer-to-Peer File Sharing Systems. Multimedia Computing and Networking (MMCN02), San Jose, CA. [42] Sen S. and Wang J. (2002) Analyzing peer-to-peer traffic across large networks. ACM SIGCOMM Internet Measurement Workshop(IMW02). [43] Ratnasamy S., Handley M., Karp R. and Shenker S. (2002) Topologically-Aware Overlay Construction and Server Selection. INFOCOM 2002. [44] Yang B. and Garcia-Molina H. (2003) Designing a super-peer network. ICDE 2003. [45] Yang B. and Garcia-Molina H. (2001) Comparing hybrid peer-to-peer systems. Tweenty-first International Conference on Very Large Databases (VLDB01). [46] Krishnamurthy B., Wang J. and Xie Y. (2001) Early Measurements of a CLuster-based Architecture for P2P Systems. ACM SIGCOMM Internet Measurement Workshop(IMW01). [47] Ganesan P., Sun Q. and Garcia-Molina H. (2003) YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. INFOCOM 2003. [48] Fiat A. and Saia J. (2002) Censorship Resistant Peer-to-Peer Content Addressable Networks. Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA02). [49] Datar M. (2002) Butterfliers and Peer-to-Peer Networks. 10th European Symposium on Algorithms (ESA02). [50] http://home.pchome.com.tw/cute/xian2/S-picture/eDonkey2000/P2P.htm
|