近年來由於資訊量的蓬勃發展，點對點的搜尋成為一個很熱門且很有潛力的研究議題。點對點的搜尋提供了一種新型的資源分享方式而且帶來了許多具有吸引力的特性，例如它提供了一種快速且方便使用的檔案分享方式並且分享相當大量的資源以及一種負載平衡的機制等等。無論如何它還是面臨了一項重大的挑戰，那就是要如何有效的在廣大的點對點網路中找到所需的資源。
在社會網路中，人們通常利用兩種方法來來找到他們想要的資源，一種是問他們所認識且具有那些資源的相關知識的人，第二種方法是尋求他們朋友的幫助。無論如何點對點網路就是缺乏這種社會網路的特性，所以導致點對點的搜尋相當的沒有效率。所以我們提出一種社會學的方法去解決這個問題，在這裡節點就好像社會網路中的人而連線就好像是社會網路裡面的關係，我們去模仿人類獲取資源的行為來彌補點對點網路的不足。我們利用超級節點的結構去建構出具有相似喜好及背景的群組並藉由節點跟節點之間的互動來維持這些群組，讓節點可以將查詢詢問具有適合知識的群組以及尋求朋友節點的幫助。
這個研究的結果說明了將社會網路的特性導入點對點網路中確實能有效的減短節點的查詢路徑並且使點對點的搜尋更加的有效率。

Recently, peer-to-peer (P2P) search is becoming a popular and potential research topic. It offers a new way for resource sharing and many attractive features, such as speedy and convenient file sharing method, more resources, load-balancing, etc. However, it also faces the important challenge that how to discover the resource in the huge P2P network.
For resource discover in social networks, people always have two common approaches, one is asking the acquaintances with the knowledge about the resource, the other is seeking helps from his friends. However, the peer in the P2P network is lack the social characters, it making the queries routing inefficiently. So we present the social approach which imitates the human behaviors in social networks where peers are people and connections are relationships to enhance the search performance in P2P network. So we utilize the super-peer architecture to create preference groups and maintain the group by the interactions from peers. Therefore peer can query the peers in the relevant groups and route to its friend peer to seek helps.
Results of this research demonstrate that applying social networks in P2P networks can shorten the length of routes and make the search more efficient.

[1] Adamic, L. (1999). The small world web, In Proc. of 3rd European Conf. Research and Advanced Technology for Digital Libraries, ECDL.
[2] Adamic, L., Lukose, R., Puniyani, A., & Hubeman, B. (2001). Search in Power-Law Networks. The American Physical Society. Vol. 64, 46135-46143,
[3] Bernstein, P. A., Giunchiglia, F., Kementsietsidis, A., Mylopoulos, J., Serafini, L., & Zaihrayeu, I. (2002, June). Data management for peer-to-peer computing: A vision. In Proceedings of the Fifth International Workshop on the Web and Databases, Madison, Wisconsin.
[4] Borch, N. T. (2005). Improving semantic routing efficiency. Proceedings of the 2005 Second International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P''05).
[5] Brase, J., and Painter, M. (2004). Inferring Metadata for a Semantic Web Peer-to-Peer Environment. Educational Technology & Society, 7 (2), 61-67.
[6] Cao, P., Cohen, E., Felten, E., Li, X. & Shenker, S. (2002). Search and replication in unstructured peer-to-peer networks. In Proc SIGMETRICS. 2002 ACM.
[7] Cai, M. and Frank, M. (2004). RDFPeers: A Scalable Distributed RDF Repository based on A Structured Peer-to-Peer Network. In Proceedings International WWW Conference, New York, USA.
[8] Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., & Shenker, S. (2003, Aug.). Making Gnutella-like P2P Systems Scalable. In Proceedings of ACM SIGCOMM 2003
[9] Cho, H., Gay, G., Davidson, B., & Ingraffea, A., (2005, July). Social networks, communication styles, and learning performance in a CSCL community. Computers & Education., New York, NY, USA,
[10] Clarke I, Sandberg O, Wiley B, & Hong T. (2000). Freenet: A distributed anonymous information storage and retrieval system. ICSI Workshop on Design Issues in Anonymity and Unobservability.
[11] Cohen, E., Fiat, A., & Kaplan, H. (2003). Associative search in peer to peer networks: Harnessing latent semantics. In Proceedings of IEEE INFOCOM.
[12] Crespo, A., & Molina, H. G. (2002, July.). Routing Indices for Peer-to-Peer Systems. In ICDCS.
[13] Crespo, A., & Molina, H. G. (2003, Jan.). Semantic overlay networks for P2P systems, Technical Report, Stanford University.
[14] Dodds, P. S., Muhamad, R., & Watts, D. J. (2003). An experimental study of search in global social networks. Science, Vol. 301, 827–829.
[15] Gkantsidis, C., Mihail, M., & Saberi, A. (2004). Random walks in peer-to-peer networks. In Proceedings of IEEE INFOCOM’04
[16] Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., & Stoica, I. (2003). The impact of DHT routing geometry on resilience and proximity, In SIGCOMM ’03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. 381–394, New York, NY, USA,
[17] Hassan, J., & Jha, S. (2004). Optimizing Expanding Ring Search for Multi-Hop Wireless Networks. In Proceedings of IEEE Globecom’04.
[18] Heine, F. (2006). Scalable p2p based RDF querying. Proceedings of the 1st international conference on Scalable information systems.
[19] Iyer, S., Rowstron, A. & Druschel, P. (2002). Squirrel: A decentralized peer-to-peer Web cache. In Proceedings of ACM Symposium on Principles of Distributed Computing, PODC.
[20] Lamnitchi, A., Ripeanu, M., & Foster, I. (2002). Locating data in Peer-to-Peer scientific collaborations. In Proceedings of the First International Workshop on Peer-to-Peer Systems.
[21] Lamnitchi, A., Ripeanu, M., & Foster, I. (2004). Small-world file-sharing communities”. In Proceedings of IEEE INFOCOM’04.
[22] Liebig, H. & Effelsberg, W. (2004). Computer-supported Formation of Virtual Learning Groups based on Proficiency Levels. World Conference on Educational Multimedia, Hypermedia and Telecommunications 2004, 1171-1178.
[23] Loo, b. T., Huebsch, r., Stoica,i., & Hellerstein, j. (2004). The Case for a Hybrid P2P Search Infrastructure. In Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS04).
[24] Jelasity, M., & Montresor, A. (2004). Computer Society IEEE. Epidemic-style proactive aggregation in large overlay networks. In Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS’04,) 102–109.
[25] Jesi, G. P., Montresor, A., & Babaoglu, O. (2006, July). Proximity-Aware Superpeer Overlay Topologies. In Proceedings of SelfMan''06, volume 3996 of Lecture Notes in Computer Science, 43-57.
[26] Joseph, S. (2005, May). Semantically Routing Queries in Peer-to-Peer Networks. In Proceedings of the International Workshop on Peer-to-Peer Computing, Pisa, Italy.
[27] Kalogeraki, V., Gunopulos, D., & Zeinalipour-Yazti, D. (2002). A Local Search Mechanism for Peer-to-Peer Networks. Proceedings of the eleventh international conference on Information and knowledge management, 300-307.
[28] Kosala, R., & Blockeel, H. (2000). Web mining Research: A Survey. R. ACM SIGKDD Explorations, vol. 2, no. 1, 1–15.
[29] Kobayashi, H., Takizawa, H., Inaba, T., & Takizawa, Y. (2005). A Self-Organizing Overlay Network to Exploit the Locality of Interests for Effective Resource Discovery in P2P Systems. In Proceedings of the 2005 Symposium on Applications and the Internet (SAINT’05).
[30] Kreijns, K., Kirschner, P., Jochems, W., van Buuren H., (2005, May). Measuring perceived sociability of computer-supported collaborative learning environments. Computers & Education.
[31] Kumar, A., Xu, J., & Zzgnra, E. W. (2003). Efficient and scalable query routing for unstructured peer-to-peer networks. Georgia Institute of Technology Tech. Rep. available at http://www.cc.gatech.edu/ akumar.
[32] Li, J., & Vuong, S. (2004). ECSP:an efficient clustered super peer architecture for P2P networks. Proceedings of the 18th International Conference on Advanced Information Networking and Application.
[33] Liu, L., Antonopoulos, N., Mackin, S. (2007, Feb.). Social Peer-to-Peer for Resource Discovery. This paper appears in: Parallel, Distributed and Network-Based Processing, 2007. PDP ''07. 15th EUROMICRO International Conference.
[34] Lv, Q., Cao, P., Cohen, E., Li, K., & Shenker, S. (2002, June). Search and replication in unstructured peer-to-peer networks”, Proceedings of the 16th ACM International Conference on Supercomputing (ICS’02).
[35] Mahadevan V., Bin, Y., & Munindar, P. S. (2000). Trust and reputation management in a small-world network. Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000).
[36] Martínez, A., Dimitriadis, Y., Rubia, B., Gómez, E., & de la Fuente, P. (2003, Dec.). Computers & Education. Combining qualitative evaluation and social network analysis for the study of classroom social interactions, 353-368.
[37] Maymounkovand, P., & Mazieres, D. (2002). Kademlia: A peer-to-peer information system based on the xor metric. In International Peer-to-Peer Symposium (IPTPS02).
[38] Merugu, S., Srinivasan, S., & Zegura, E. W. (2003) Adding structure to unstructured peer-to-peer networks: the role of overlay topology. In Proceedings of Networked Gmup Communication (NGC).
[39] Milgram, S. (1967). The Small World Problem. Psychology Today, 60-67.
[40] Montresor, A. (2004, Aug.). A robust protocol for building superpeer overlay topologies. In Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P 2004). Zurich, Switzerland, IEEE , 202–209.
[41] Nejdl, W., Wolf, B., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palm´er, M. & Risch, T. (2002, May). EDUTELLA: a P2P Networking Infrastructure based on RDF. In WWW 11 Conference Proceedings, Hawaii, USA,
[42] Neidl, W., Wolf, B., Siberski, W., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palmer, M. and Risch, T. (2003) EDUTELLA: P2P Networking for the Semantic Web. Computer Networks Journal (special issue on Semantic Web).
[43] Newman, M. E. J. (2000), Models of the Small World: A Review, Journal of Statistical Physics, 101, 819-841.
[44] Nielson, S., Crosby, S., & Wallach, D. (2005, feb). Kill the messenger: A taxonomy of rational attacks. In Proc. of the 4th International Workshop on Peer-to-Peer Systems (IPTPS).
[45] Obrst, L. (2003). Ontologies for semantically interoperable systems. Proceedings of the twelfth international conference on Information and knowledge management, 366-393.
[46] Ravishankar, C. V. (2002, march 21), The Gnutella Protocol Specification verson0.4.
[47] Ratnasamy, S., Francis, M., Handley, P., Karp, R., & Schenker, S. (2001). A scalable content addressable network, In SIGCOMM ’01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications,161–172, New York.
[48] Ratnasamy, S., Shenker, S., & Stoica, I. (2002). Routing algorithms for DHTs: Some open questions. In Proc. of International Peer-To-Peer Workshop.
[49] Rhea, S., Geels, D., Roscoe, T., & Kubiatowicz, J. (2004, June). Handling churn in a DHT. In Proceedings of the 2004 USENIX Annual Technical Conference, Boston, Massachusetts.
[50] Ripeanu, M., Foster, I., & Iamnitchi, A. (2002). Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal, vol. 6, no. 1.
[51] Rowstron, A., & Druschel, P. (2001, Nov.). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM Middleware, Germany.
[52] Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001). Measurement study of peer-to-peer file sharing systems. In Proceedings of the International Society for Optical Engineering.
[53] Schlosser, M., Sintek, M., Decker, S., & Nejdl, W. (2002, July). HyperCuP—Hypercubes, Ontologies and Efficient Search on P2P Networks. In International Workshop on Agents and Peer-to-Peer Computing, Bologna, Italy.
[54] Sripanidkulchai, K., Maggs, B., & Zhang, H. (2003). Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In Proceedings of IEEE INFOCOM’ 03.
[55] Stoica, I., Morris, R., Karger, D., Kaashoek, F., & Balakrishnan, H. (2001, October). Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of ACM SIGCOMM Comput. Commun., 31(4):149–160,
[56] Tang, C. Q., Xu, Z. C., & Dwarkadas, S. (2003, Aug.). Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. In Proceedings of ACM SIGCOMM’ 03, Karlsruhe, Germany,
[57] Tong, X., Zhang, D., Yang, Z. (2005, Oct.). Efficient Content Location Based On Interest-Cluster in Peer-to-Peer System. In e-Business Engineering, 2005. ICEBE 2005. IEEE International Conference.
[58] Tsoumakos, D., & Roussopoulos, N.(2003). Adaptive Probabilistic Search for Peer-to-Peer Networks. In 3rd IEEE Intl Conference on P2P Computing
[59] Tsoumakos, D., & Roussopoulos, N,(2003). A Comparison of Peer-to-Peer Search Methods, In Proceedings of Sixth International Workshop on Web and Databases, San Diego.
[60] Tsoumakos, D., & Roussopoulos, N. (2006). Analysis and comparison of P2P search methods. Proceedings of the 1st international conference on Scalable information systems
[61] Upadrashta, Y., Vassileva,J., & hicss, W. (2005). Social networks in peer-to-peer systems. Proceedings of the 38th Hawaii International Conference on System Sciences.
[62] Watts, D., & Strogatz, S. (1998). Collective dynamics of ’smallworld ’ networks. Proceedings of the Nature © Macmillan Publishers Ltd 1998 ,440–442 .
[63] Wellman, B (19997). An Electronic Group is Virtually a Social Network. Culture of the Internet, Lawrence Erlbaum, Hillsdale, NJ. 179-205.
[64] Xu, Z. Y., & Hu, Y. M. (2003). Exploiting Spatial Locality to Improve Peer-to-Peer System Performance. In Proceedings of the Third IEEEWorkshop on Internet Applications (WIAPP’03).
[65] Xue, G. T., You, J. Y., & Jia, Z. Q. (2004). An Interest Group Model for Content Location in Peer-to-Peer Systems. In Proceedings of the IEEE CEC-East.
[66] Yang, B., & Hector G. M. Proceedings. (2003). Designing a super-peer network. In Proceedings of the 19th International Conference on Data Engineer03.
[67] Yang, B., & Hector, G. M. (2002). Improving Search in Peer-to-Peer Networks. In Proc. of the 22nd Int''l Conf. on Distributed Computing Systems. Vienna: IEEE Computer Society (ICDCS).
[68] Yang, J., Zhong, Y., Zhang, S. (2003). An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks. Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing.
[69] Yang, S.J.H. (2006, Sep.). Context Aware Ubiquitous Learning Environments for Peer-to-Peer Collaborative Learning. Journal of Educational Technology and Society, 188-201.
[70] Yang, S.J.H, Chen, I., & Shao, N. (2004). Ontological Enabled Annotations and Knowledge Management for Collaborative Learning in Virtual Learning Community. Journal of Educational Technology and Society Vol.7, No.4, 70-81.
[71] Yu, Y., & Jin, H. (2006, Jan.). Building a Semantic P2P Scientific References Sharing System with JXTA. Proceeding of the Eighth Asia Pacific Web Conference (APWeb2006), Harbin, China, 937-942.
[72] Zhang,R. M., & Hu, Y. C. (2005). Assisted Peer-to-Peer Search with Partial Indexing. In Proceedings of IEEE INFOCOM’05
[73] Zhao, B., Kubiatowicz, J., & Joseph, A. (2001, April). Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley.
[74] Zhang, H., GelUsing, A. (2003, Oct.). The Small-World Model to Improve Freenet Performance. This paper appears in: Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference on.
[75] Zhu, Y., & Hu, Y. (2006, Dec.). Enhancing Search Performance on Gnutella-Like P2P Systems. In IEEE Transactions on Parallel and Distributed Systems.
Web Page：
[76] ACM Computing Classification System 1998 Version ,http://www.acm.org/class/1998/
[77] Freenet website in the freenet project from http://freenet.sourceforge.net.
[78] Gnutella website in Gnutella.com from http://www.gnutella.com.
[79] Gnutella2 Specifications Part One: from http://www.gnutella2.com/gnutella2 search.htm.
[80] Gnucleus website in Gnucleus from http://www.gnucleus.com/.
[81] KaZaA website in Kazaa from http://www.kazaa.com./us.
[82] Microsoft .NET in Microsoft .NET Homepage from
http://www.microsoft.com/net.
[83] Napster website in Napster from http://www.napster.com.
[84] Project JXTA in JXTA.org from http://www.jxta.org.
[85] Wiki website in wikipedia from http://en.wikipedia.org/wiki/Gnutella