对等社会网络中信息传播及信誉机制的建模与研究
|
摘要
在线社会网络(Online Social Network, OSN)为用户提供了分享、组织、查找资料的重要途径,是一种备受用户青睐的网络交流方式。在线社会网络已成为社会网络(Social Network, SN)、复杂网络以及Internet应用的研究热点。但是在线社会网络中存在着数据集中存储以及用户隐私数据泄漏的问题。本文利用社会学、数据挖掘中的社会网络分析(Social Network Analysis, SNA)方法以及图论、概率论等研究方法,针对在线社会网络存在的上述问题进行深入研究,取得了如下创新性成果:
1.建立了一种基于对等计算模式以及网络节点社会属性的对等社会网络(P2P Social Network, P2P SN)。该网络具有两层结构,底层为根据节点社会相似性建立的社区网络,上层是基于Chord的结构化P2P网络。此种层次化的分布式社会网络,变集中式数据管理为分布式数据管理,解决了目前在线社会网络中数据集中存储所带来的弊端。
2.提出了一种能够适用于对等社会网络中资源搜索与资源发布的高效的社会感知(social-aware)路由算法。根据节点间的社会距离和社会相似性建立信息传播机制,确定出网络中的关键节点和桥梁节点,并通过关键节点或桥梁节点分别在网内或网间进行资源和消息的转发,从而减少了查询开销,提高了信息传播效率。
3.构建了对等社会网络的信誉模型,建立了网络节点信誉评价体系。充分利用节点的社会关系确定节点的信誉值、评价节点的信誉度,并设计出一种每次交易后节点信誉值(含社会信誉及交易信誉)的更新算法。根据节点信誉度确定访问权限以实现授权访问,减少了节点的恶意行为,有效防止了用户隐私数据泄漏。
课题结合理论分析、仿真及实验对模型进行了评价和验证。课题研究为优化在线社会网络提供了理论基础和方法支持,因而具有理论意义和实用价值。
Online Social Network (OSN) provides the primary method for sharing and constructing and searching information to users. It is becoming increasing popular network communication. Online Social Network has been a research hot spot in social network and complicated network and Internet application. In Online Social Network, data privacy caused by data centralized management is a major challenge. In this project, using Social Network Analysis (SNA) in sociology and Data Mining and Graph theory and probability theory, we do more research on the proposed problem in Online Social Network and obtained the innovative research result with theoretical value and practical significance.
1. The distributed P2P Social Network based on peer-to-peer computing model is built up. Using Social Network Analysis (SNA), we establish a hierarchical P2P Social Network model according to the social distance showing social similarity of peers and the centrality metric showing the importance of peers, which changes the centralized data management into distributed management, to resolve the inherent disadvantage of centralized data management.
2. We propose highly efficient social-aware routing algorithm on resource searching and publishing in P2P Social Network. Information dissemination mechanisms are set up by using social distance and social similarity among peers. The resource and messages are forwarded through the key peers and bridge peers in the network. The routing algorithm deduces searching overhead and improves information transmission efficiency.
3. The trust model is constructed in P2P Social Network, and the trust evaluation mechanism on peer is set up. We exploit social relationship among peers to set the reputation and evaluate the trust, and design trust (including social-trust and transaction-trust) updating algorithm after each transaction. According to peer trust we define the access authority in order to achieve authorized access and deduce the malicious behavior, and effectively avoid the leaking of users’data privacy.
Through theoretical analysis and simulation evaluation, we will validate the proposed model and schemes. The research will provide a theoretical foundation and method support for the optimization of next-generation social networks, thus with theoretical significance and practical value.
1.建立了一种基于对等计算模式以及网络节点社会属性的对等社会网络(P2P Social Network, P2P SN)。该网络具有两层结构,底层为根据节点社会相似性建立的社区网络,上层是基于Chord的结构化P2P网络。此种层次化的分布式社会网络,变集中式数据管理为分布式数据管理,解决了目前在线社会网络中数据集中存储所带来的弊端。
2.提出了一种能够适用于对等社会网络中资源搜索与资源发布的高效的社会感知(social-aware)路由算法。根据节点间的社会距离和社会相似性建立信息传播机制,确定出网络中的关键节点和桥梁节点,并通过关键节点或桥梁节点分别在网内或网间进行资源和消息的转发,从而减少了查询开销,提高了信息传播效率。
3.构建了对等社会网络的信誉模型,建立了网络节点信誉评价体系。充分利用节点的社会关系确定节点的信誉值、评价节点的信誉度,并设计出一种每次交易后节点信誉值(含社会信誉及交易信誉)的更新算法。根据节点信誉度确定访问权限以实现授权访问,减少了节点的恶意行为,有效防止了用户隐私数据泄漏。
课题结合理论分析、仿真及实验对模型进行了评价和验证。课题研究为优化在线社会网络提供了理论基础和方法支持,因而具有理论意义和实用价值。
Online Social Network (OSN) provides the primary method for sharing and constructing and searching information to users. It is becoming increasing popular network communication. Online Social Network has been a research hot spot in social network and complicated network and Internet application. In Online Social Network, data privacy caused by data centralized management is a major challenge. In this project, using Social Network Analysis (SNA) in sociology and Data Mining and Graph theory and probability theory, we do more research on the proposed problem in Online Social Network and obtained the innovative research result with theoretical value and practical significance.
1. The distributed P2P Social Network based on peer-to-peer computing model is built up. Using Social Network Analysis (SNA), we establish a hierarchical P2P Social Network model according to the social distance showing social similarity of peers and the centrality metric showing the importance of peers, which changes the centralized data management into distributed management, to resolve the inherent disadvantage of centralized data management.
2. We propose highly efficient social-aware routing algorithm on resource searching and publishing in P2P Social Network. Information dissemination mechanisms are set up by using social distance and social similarity among peers. The resource and messages are forwarded through the key peers and bridge peers in the network. The routing algorithm deduces searching overhead and improves information transmission efficiency.
3. The trust model is constructed in P2P Social Network, and the trust evaluation mechanism on peer is set up. We exploit social relationship among peers to set the reputation and evaluate the trust, and design trust (including social-trust and transaction-trust) updating algorithm after each transaction. According to peer trust we define the access authority in order to achieve authorized access and deduce the malicious behavior, and effectively avoid the leaking of users’data privacy.
Through theoretical analysis and simulation evaluation, we will validate the proposed model and schemes. The research will provide a theoretical foundation and method support for the optimization of next-generation social networks, thus with theoretical significance and practical value.
引文
[1] http://en.wikipedia.org/wiki/Social_network/
[2] Wasserman S, Faust K. Social Network Analysis: Methods and Applications [M]. Cambridge, NY: Cambridge University
[3] Milgram, S. The small-world problem [J]. Psychology Today, 1967, 2: 60-67
[4] Kleinberg J. The small-world phenomenon:An algorithmic perspective. ACM Symp on Theory of Computing, 2000. 820828
[5] http://www.yahoo.cn/
[6] http://www.stanfordblog.com/
[7] http://www.1inkedin.com/
[8] http://home.spaces.1ive.com/
[9] http://www.facebook.com/
[10] http://www.renren.com/
[11] http://www.myspace.com/
[12] http://youtube.com/
[13] http://www.flickr.com/
[14] Adamic, L.A. The Small World Web. In Proceedings of the Third European Conference on Research and Advanced Technologh for Digital Libraries (ECDL’99), Paris, France, Sep 1999
[15] Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, et al. Geographic routing in social networks. Proceedings of National Academy of Sciences, 2005, 102(33) 11,623–11,628
[16] Kumar, R., Novak, J., Tomkins, A. Structure and evolution of online social networks. Proceedings of 12th International Conference on Knowledge Discovery in Data Mining. New York: ACM Press, 2006, 611-617
[17] Mislove A,Marcon M,Gummadi K P,et al.Measurement and analysis of online social networks[C], Proceedings of the 7th ACM SIGCOMM Confereace on Internet Measurement.New York:ACM Press,2007:29-42
[18] Buchegger Sonja, Datta Anwitaman. A Case for P2P Infrastructure for Social Networks - Opportunities & Challenges. In Proceedings of WONS 2009, the Sixth International Conference on Wireless On-demand Network Systems and Services, Snowbird, Utah, USA , 2009
[19] Keith W.Ross, Dan Rubenstein. Tutorial on P2P systems[C]. Presented at Infocom 2003, San Francisco, California, USA, 2003
[20] Barnes, J.A. Class and committees in a Norwegian island parish. In Human Relations, No. 7. (1954), pp. 39-58
[21] http://en.wikipedia.org/wiki/Social_network/
[22] Golbeck, Jennifer A. Computing and applying trust in web-based social networks. College Park, MD, USA, Diplomarbeit, 2005
[23] Sonja Buchegger, Doris Schi?berg, Le Hung Vu, Anwitaman Datta. PeerSON: P2P Social Networking - Early Experiences and Insights. In Proceedings of SocialNets 2009, the 2nd Workshop on Social Network Systems, Nuernberg, Germany, 2009
[24] http://www.opendht.org/
[25] Kalofonos Dimitris N., Antoniou Zoe, Reynolds Franklin D., Van-Kleek Max, Strauss Jacob, Wisner Paul. MyNet: A Platform for Secure P2P Personal and Social Networking Services. In proceedings of PerCom 2008, the Sixth Annual IEEE International Conference on Pervasive Computing and Communications, Hong Kong, 2008
[26] Ford Bryan, Strauss Jacob, Lesniewski-Laas Chris, Rhea Sean, Kaashoek Frans, Morris Robert. Persistent personal names for globally connected mobile devices. In Proceedings of OSDI’06, the 7th USENIX Symposium on Operating Systems Design and Implement, Seattle, WA, 2006
[27] Kalofonos Dimitris N., Antoniou Zoe. A Hybrid P2P/Infrastructure Platform for Personal and Social Internet Services. In Proceedings of PIMRC’08, the 19th IEEE Personal, Indoor, and Mobile Radio Communications, Cannes, France, 2008
[28] Oliver Schneider. Trust Aware Social Networking: A Distributed Storage System based on Social Trust and Geographical Proximity. Diplomarbeit thesis, 2009
[29]罗家德.社会网络分析讲义[M].北京:社会科学文献出版社, 2005:150-156
[30]温粉莲,唐常杰,乔少杰等.基于社会网络最短路径挖掘犯罪集团核心[J].计算机科学, 2006, 33(11):266-268
[31]陈君,唐雁.基于Web社会网络的个性化Web信息推荐模型[J].计算机科学,2006,33(4): 185-187,193
[32]周卫国,史戎坚,叶婷.基于Web2.0网站中社会网络的信息挖掘[J].微计算机信息, 2009, 25(2-3):146-147
[33]胡海波,王科,徐玲,汪小帆.基于复杂网络理论的在线社会网络分析[J].复杂系统与复杂性科学, 2008, 5(2): 1-14
[34] D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393
[35] A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509～512, 1999
[36] http://www.sciencetimes.com.cn/
[37]汪小帆,李翔,陈冠荣.复杂网络理论极其应用[M].北京:清华大学出版社, 2006 [ 38 ] A. L. Barabasi and R. Albert. Exploring complex networks. Nature, 410(6825):268-276, 2001
[39] GranovetterM S. The strength of weak ties[J]. American Journal of Sociology, 1973, 78 (6) : 1360 - 1380
[40] Newman M. E J. Assortative mixing in networks[J]. Phys Rev Lett, 2002, 89: 208701
[41] Newman M. E J , Park J. Why social networks are different from other types of networks[J]. Phys Rev E, 2003, 68: 036122
[42] Radcliffe-Brown, A. R. On Social Structure. Journal of Royal Anthropological Institute of Great Britain and Ireland, 1940, 70(1):1-12
[43] Karl Aberer, Manfred Hauswirth. Peer-to-Peer Information Systems: Concepts and Models, State-of-the-Art, and Future Systems[C]. Tutorial at the 18th International Conference on Data Engineering (ICDE), San Jose, California, 2002
[44]罗杰文. Peer-to-Peer综述. 2006, http://www.intsci.ac.cn/users/luojw/P2P/
[45]徐恪,熊勇强.对等网络研究综述. 2005, http://bigpc.net.pku.edu.cn:8080/paper/surveyP2P.pdf
[46] S. Androutsellis Theotokis, D. Spinellis. A Survey of Peer-to-Peer File Sharing Technologies. White paper. Electronic Trading Research Unit (ELTRUN), Athens University for Economics and Business. 2002.
[47] Eng Keong Lua, J. Crowcroft, M. Pias. A survey and comparison of peer to peer overlay network schemes. IEEE Communications Surveys & Tutorials. 2005. 7(2):72-93
[48] Gnutella Development. Home page: http://gnutella.wego.com
[49] Freenet. Home Page: http://freenet.sourceforge.com
[50] Frank Dabek, M.Frans Kaashoek, David Karger et al. Wide-area cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles(SOSP’01), New York: ACM Press. 2001
[51] P. Druschel, A. Rowstron. Past: Persistent and anonymous storage in a peer to peer networking environment.In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems(HotOS 2001). Germany :Elmau / Oberbayern. 2001. 65~70.
[52] Kubiatowicz, J. Bindel, D. Chen, et al. OceanStore: An architecture for global-scale persistent storage. In: Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems(ASPLOS 2000). NewYork: ACM Press 2000. 190~201.
[53] Ratnasamy S., Handley M., Karp R. et al. Application-level Multicast using Content-Addressable Networks. Lecture Notes in Computer Science. Berlin: Springer. 2001. 2233: 14~19
[54] S. Zhuang, B. Zhao, A. D. Joseph et al. Bayeux: An architecture for wide-area, fault-tolerant data dissemination.In Proceedings of Proceedings of the 11th International Workshop Network and Operating Systems Support for Digital Audio and Video. New York. 2001.
[55] A. Rowstron, A-M. Kermarrec et al. Scribe: The design of a large-scale event notification infrastructure. Lecture Notes in Computer Science. Berlin: Springer. 2001. 2233: 30-43.
[56] L. F. Cabrera, M. B. Jones, M. Theimer. .Herald: Achieving a global event notification service.In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems(HotOS-VIII). Germany: Elmau/Oberbayern. 2001. 87~92
[57] Castro, M., Druschel, P., Hu, Y. C., and Rowstron, A. Exploiting network proximity in peer-to-peer overlay networks[R]. Tech. Rep. MSR-TR 2002-82, Microsoft, 2002
[58] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker. A Scalable Content-Addressable Network[C]. SIGCOMM'01, August 27-31, 2001, San Diego, California, USA
[59] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications[C]. SIGCOMM'01, August 2731, 2001, San Diego, California, USA
[60] Zhao B, Kubiatowicz J. Joseph A. Tapestry:an infrastructure for fault-resilient wide-area location and routing[R]. UC Berkeley, Technical Report UCB//CSD-01-1141. April 2001
[61] Antony Rowstron1 and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[C]. Appears in Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001). Heidelberg, Germany, November 2001
[62] F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS[C]. In Proc. ACM SOSP'01, Banff, Canada, Oct. 2001.
[63] Jeremy Stribling, Jinyang Li, Isaac G. Councill, M. Frans Kaashoek, and Robert Morris. OverCite: A Distributed, Cooperative CiteSeer. In the Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI '06), San Jose, CA, May 2006.
[64] Lorrain H.C; and White. [J].Journal of Mathematical Sociology,1971(1):49-80
[65] Knoke David, Kuklinski James H. Network analysis. Beverly Hills, Calif. Sage Publications,1982:37-44
[66] John Scott, Social Network Analysis: A Handbook, London, Sage Publications, 2000, p.83
[67] Freeman C. Centrality in Social Networks: Conceptual Clarification. Social Networks, 1978, 1(3): 215-239
[68] Everett M, Sinclair P, Dankelmann P. Some centrality results new and old. Journal Of Mathematical Sociology, 2004, 28(4):215-227
[69] Carrington P. Scott J. Wasserman S. Models and Methods in Social Network Analysis. New York:Cambridge University Press, 2005
[70] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks[C]. In Proceedings of the 16th annual ACM International Conference on Supercomputing, 2002
[71] OceanStore工程, http://oceanstore.cs.berkeley.edu/info/overview.html
[72] C. Greg Plaxton, Rajmohan Rajaraman, and Andrea W. Richa. Accessing nearby copies of replicated objects in a distributed environment[C]. In Proceedings of ACM SPAA. ACM, June 1997
[73]肖明军,黄刘生.容迟网络路由算法[J].计箅机研究与发展, 46(7):1065-1073. 2009
[74] Vahdat A, Becker D. Epidemic routing for partiallyconnected ad hoc networks, C5-2000-06[R]. Durham,NC: Duke University, 2000
[75] Spyropoulos T, Psounis K. Raghavendra C S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks[c]. Proc of the ACM SIGCOMM Workshop on Delay-Tolerant Networking(WDTN 2005).New York: ACM,2005: l 252-259 [ 76 ] Spyropoulos T, Psounis K , Raghavendra C. Spray and focusl Effident mobility-assisted routing for heterogeneous and correlated mobility[C]. Proc of the IEEE PerCom. Piscataway, NJ: IEEE, 2007:79-85
[77] Lindgren A. Doria A. Schelen O. Probabilistic routing in intermittently connected networks[G]. LNCS3126. Berlin: Springer, 2004: l 239-254
[78] Burns B, Brock O, Levine B N. MV routing and capacity building in disruption tolerant networks[C]. Proc of the IEEE INFOCOM 2005.Piscataway, NJ: IEEE, 2005: 398-408
[79] S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigen trust algorithm for reputation management in P2P networks. In: Proceedings of the twelfth international conference on World Wide Web. New York:ACM Press. 2003. 640~651
[80]窦文,信任敏感的P2P拓扑构造及其相关技术研究:[博士学位论文],长沙:国防科技大学. 2003
[81] A. A. Selcuk, E.Uzun, M. R. Pariente. A Reputation-Based Trust Management System for P2P Networks. In: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid. Washington DC: IEEE Computer Society. 2004. 251~258 [ 82 ] L. Xiong, L. Liu. PeerTrust: Supporting Reputation-based Trust to P2P E-Communities. IEEE Trans. Knowledge and Data Engineering. 2004. 843~857
[83] Li Xiong, Ling Liu. A reputation-based trust model for peer-to-peer ecommerce communities. In: Proceedings the 4th ACM Conference on Electronic Commerce. New York: ACM Press. 2003. 228-229
[84] L. Xiong, L. Liu. PeerTrust: A trust mechanism for an open peer-to-peer information system. Technical Report GIT-CC-02-29. Georgia Institute of Technology, College of Computing. 2002
[85] Wang Yao, Vassileva Julita. Bayesian network trust model in peer-to-peer networks Agents and Peer-to-Peer. Lecture Notes in Computer Science. Berlin: Springer. 2005. 2872:23-34
[86] K. Aberer, Z. Despotovic, Managing trust in a peer-2-peer information system. In: Proceedings of the tenth international conference on Information and knowledge management. New York: ACM Press. 2001. 310~317
[87] S. Wasserman and K. Faust, Social Network Analysys:Methods and Applications, Cambridge, Cambridge University Press, 1994, p.249
[88]李景涛, P2P环境下信任模型与副本方案研究: [博士学位论文],上海:复旦大学, 2006
[2] Wasserman S, Faust K. Social Network Analysis: Methods and Applications [M]. Cambridge, NY: Cambridge University
[3] Milgram, S. The small-world problem [J]. Psychology Today, 1967, 2: 60-67
[4] Kleinberg J. The small-world phenomenon:An algorithmic perspective. ACM Symp on Theory of Computing, 2000. 820828
[5] http://www.yahoo.cn/
[6] http://www.stanfordblog.com/
[7] http://www.1inkedin.com/
[8] http://home.spaces.1ive.com/
[9] http://www.facebook.com/
[10] http://www.renren.com/
[11] http://www.myspace.com/
[12] http://youtube.com/
[13] http://www.flickr.com/
[14] Adamic, L.A. The Small World Web. In Proceedings of the Third European Conference on Research and Advanced Technologh for Digital Libraries (ECDL’99), Paris, France, Sep 1999
[15] Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, et al. Geographic routing in social networks. Proceedings of National Academy of Sciences, 2005, 102(33) 11,623–11,628
[16] Kumar, R., Novak, J., Tomkins, A. Structure and evolution of online social networks. Proceedings of 12th International Conference on Knowledge Discovery in Data Mining. New York: ACM Press, 2006, 611-617
[17] Mislove A,Marcon M,Gummadi K P,et al.Measurement and analysis of online social networks[C], Proceedings of the 7th ACM SIGCOMM Confereace on Internet Measurement.New York:ACM Press,2007:29-42
[18] Buchegger Sonja, Datta Anwitaman. A Case for P2P Infrastructure for Social Networks - Opportunities & Challenges. In Proceedings of WONS 2009, the Sixth International Conference on Wireless On-demand Network Systems and Services, Snowbird, Utah, USA , 2009
[19] Keith W.Ross, Dan Rubenstein. Tutorial on P2P systems[C]. Presented at Infocom 2003, San Francisco, California, USA, 2003
[20] Barnes, J.A. Class and committees in a Norwegian island parish. In Human Relations, No. 7. (1954), pp. 39-58
[21] http://en.wikipedia.org/wiki/Social_network/
[22] Golbeck, Jennifer A. Computing and applying trust in web-based social networks. College Park, MD, USA, Diplomarbeit, 2005
[23] Sonja Buchegger, Doris Schi?berg, Le Hung Vu, Anwitaman Datta. PeerSON: P2P Social Networking - Early Experiences and Insights. In Proceedings of SocialNets 2009, the 2nd Workshop on Social Network Systems, Nuernberg, Germany, 2009
[24] http://www.opendht.org/
[25] Kalofonos Dimitris N., Antoniou Zoe, Reynolds Franklin D., Van-Kleek Max, Strauss Jacob, Wisner Paul. MyNet: A Platform for Secure P2P Personal and Social Networking Services. In proceedings of PerCom 2008, the Sixth Annual IEEE International Conference on Pervasive Computing and Communications, Hong Kong, 2008
[26] Ford Bryan, Strauss Jacob, Lesniewski-Laas Chris, Rhea Sean, Kaashoek Frans, Morris Robert. Persistent personal names for globally connected mobile devices. In Proceedings of OSDI’06, the 7th USENIX Symposium on Operating Systems Design and Implement, Seattle, WA, 2006
[27] Kalofonos Dimitris N., Antoniou Zoe. A Hybrid P2P/Infrastructure Platform for Personal and Social Internet Services. In Proceedings of PIMRC’08, the 19th IEEE Personal, Indoor, and Mobile Radio Communications, Cannes, France, 2008
[28] Oliver Schneider. Trust Aware Social Networking: A Distributed Storage System based on Social Trust and Geographical Proximity. Diplomarbeit thesis, 2009
[29]罗家德.社会网络分析讲义[M].北京:社会科学文献出版社, 2005:150-156
[30]温粉莲,唐常杰,乔少杰等.基于社会网络最短路径挖掘犯罪集团核心[J].计算机科学, 2006, 33(11):266-268
[31]陈君,唐雁.基于Web社会网络的个性化Web信息推荐模型[J].计算机科学,2006,33(4): 185-187,193
[32]周卫国,史戎坚,叶婷.基于Web2.0网站中社会网络的信息挖掘[J].微计算机信息, 2009, 25(2-3):146-147
[33]胡海波,王科,徐玲,汪小帆.基于复杂网络理论的在线社会网络分析[J].复杂系统与复杂性科学, 2008, 5(2): 1-14
[34] D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393
[35] A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509～512, 1999
[36] http://www.sciencetimes.com.cn/
[37]汪小帆,李翔,陈冠荣.复杂网络理论极其应用[M].北京:清华大学出版社, 2006 [ 38 ] A. L. Barabasi and R. Albert. Exploring complex networks. Nature, 410(6825):268-276, 2001
[39] GranovetterM S. The strength of weak ties[J]. American Journal of Sociology, 1973, 78 (6) : 1360 - 1380
[40] Newman M. E J. Assortative mixing in networks[J]. Phys Rev Lett, 2002, 89: 208701
[41] Newman M. E J , Park J. Why social networks are different from other types of networks[J]. Phys Rev E, 2003, 68: 036122
[42] Radcliffe-Brown, A. R. On Social Structure. Journal of Royal Anthropological Institute of Great Britain and Ireland, 1940, 70(1):1-12
[43] Karl Aberer, Manfred Hauswirth. Peer-to-Peer Information Systems: Concepts and Models, State-of-the-Art, and Future Systems[C]. Tutorial at the 18th International Conference on Data Engineering (ICDE), San Jose, California, 2002
[44]罗杰文. Peer-to-Peer综述. 2006, http://www.intsci.ac.cn/users/luojw/P2P/
[45]徐恪,熊勇强.对等网络研究综述. 2005, http://bigpc.net.pku.edu.cn:8080/paper/surveyP2P.pdf
[46] S. Androutsellis Theotokis, D. Spinellis. A Survey of Peer-to-Peer File Sharing Technologies. White paper. Electronic Trading Research Unit (ELTRUN), Athens University for Economics and Business. 2002.
[47] Eng Keong Lua, J. Crowcroft, M. Pias. A survey and comparison of peer to peer overlay network schemes. IEEE Communications Surveys & Tutorials. 2005. 7(2):72-93
[48] Gnutella Development. Home page: http://gnutella.wego.com
[49] Freenet. Home Page: http://freenet.sourceforge.com
[50] Frank Dabek, M.Frans Kaashoek, David Karger et al. Wide-area cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles(SOSP’01), New York: ACM Press. 2001
[51] P. Druschel, A. Rowstron. Past: Persistent and anonymous storage in a peer to peer networking environment.In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems(HotOS 2001). Germany :Elmau / Oberbayern. 2001. 65~70.
[52] Kubiatowicz, J. Bindel, D. Chen, et al. OceanStore: An architecture for global-scale persistent storage. In: Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems(ASPLOS 2000). NewYork: ACM Press 2000. 190~201.
[53] Ratnasamy S., Handley M., Karp R. et al. Application-level Multicast using Content-Addressable Networks. Lecture Notes in Computer Science. Berlin: Springer. 2001. 2233: 14~19
[54] S. Zhuang, B. Zhao, A. D. Joseph et al. Bayeux: An architecture for wide-area, fault-tolerant data dissemination.In Proceedings of Proceedings of the 11th International Workshop Network and Operating Systems Support for Digital Audio and Video. New York. 2001.
[55] A. Rowstron, A-M. Kermarrec et al. Scribe: The design of a large-scale event notification infrastructure. Lecture Notes in Computer Science. Berlin: Springer. 2001. 2233: 30-43.
[56] L. F. Cabrera, M. B. Jones, M. Theimer. .Herald: Achieving a global event notification service.In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems(HotOS-VIII). Germany: Elmau/Oberbayern. 2001. 87~92
[57] Castro, M., Druschel, P., Hu, Y. C., and Rowstron, A. Exploiting network proximity in peer-to-peer overlay networks[R]. Tech. Rep. MSR-TR 2002-82, Microsoft, 2002
[58] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker. A Scalable Content-Addressable Network[C]. SIGCOMM'01, August 27-31, 2001, San Diego, California, USA
[59] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications[C]. SIGCOMM'01, August 2731, 2001, San Diego, California, USA
[60] Zhao B, Kubiatowicz J. Joseph A. Tapestry:an infrastructure for fault-resilient wide-area location and routing[R]. UC Berkeley, Technical Report UCB//CSD-01-1141. April 2001
[61] Antony Rowstron1 and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[C]. Appears in Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001). Heidelberg, Germany, November 2001
[62] F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS[C]. In Proc. ACM SOSP'01, Banff, Canada, Oct. 2001.
[63] Jeremy Stribling, Jinyang Li, Isaac G. Councill, M. Frans Kaashoek, and Robert Morris. OverCite: A Distributed, Cooperative CiteSeer. In the Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI '06), San Jose, CA, May 2006.
[64] Lorrain H.C; and White. [J].Journal of Mathematical Sociology,1971(1):49-80
[65] Knoke David, Kuklinski James H. Network analysis. Beverly Hills, Calif. Sage Publications,1982:37-44
[66] John Scott, Social Network Analysis: A Handbook, London, Sage Publications, 2000, p.83
[67] Freeman C. Centrality in Social Networks: Conceptual Clarification. Social Networks, 1978, 1(3): 215-239
[68] Everett M, Sinclair P, Dankelmann P. Some centrality results new and old. Journal Of Mathematical Sociology, 2004, 28(4):215-227
[69] Carrington P. Scott J. Wasserman S. Models and Methods in Social Network Analysis. New York:Cambridge University Press, 2005
[70] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks[C]. In Proceedings of the 16th annual ACM International Conference on Supercomputing, 2002
[71] OceanStore工程, http://oceanstore.cs.berkeley.edu/info/overview.html
[72] C. Greg Plaxton, Rajmohan Rajaraman, and Andrea W. Richa. Accessing nearby copies of replicated objects in a distributed environment[C]. In Proceedings of ACM SPAA. ACM, June 1997
[73]肖明军,黄刘生.容迟网络路由算法[J].计箅机研究与发展, 46(7):1065-1073. 2009
[74] Vahdat A, Becker D. Epidemic routing for partiallyconnected ad hoc networks, C5-2000-06[R]. Durham,NC: Duke University, 2000
[75] Spyropoulos T, Psounis K. Raghavendra C S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks[c]. Proc of the ACM SIGCOMM Workshop on Delay-Tolerant Networking(WDTN 2005).New York: ACM,2005: l 252-259 [ 76 ] Spyropoulos T, Psounis K , Raghavendra C. Spray and focusl Effident mobility-assisted routing for heterogeneous and correlated mobility[C]. Proc of the IEEE PerCom. Piscataway, NJ: IEEE, 2007:79-85
[77] Lindgren A. Doria A. Schelen O. Probabilistic routing in intermittently connected networks[G]. LNCS3126. Berlin: Springer, 2004: l 239-254
[78] Burns B, Brock O, Levine B N. MV routing and capacity building in disruption tolerant networks[C]. Proc of the IEEE INFOCOM 2005.Piscataway, NJ: IEEE, 2005: 398-408
[79] S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigen trust algorithm for reputation management in P2P networks. In: Proceedings of the twelfth international conference on World Wide Web. New York:ACM Press. 2003. 640~651
[80]窦文,信任敏感的P2P拓扑构造及其相关技术研究:[博士学位论文],长沙:国防科技大学. 2003
[81] A. A. Selcuk, E.Uzun, M. R. Pariente. A Reputation-Based Trust Management System for P2P Networks. In: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid. Washington DC: IEEE Computer Society. 2004. 251~258 [ 82 ] L. Xiong, L. Liu. PeerTrust: Supporting Reputation-based Trust to P2P E-Communities. IEEE Trans. Knowledge and Data Engineering. 2004. 843~857
[83] Li Xiong, Ling Liu. A reputation-based trust model for peer-to-peer ecommerce communities. In: Proceedings the 4th ACM Conference on Electronic Commerce. New York: ACM Press. 2003. 228-229
[84] L. Xiong, L. Liu. PeerTrust: A trust mechanism for an open peer-to-peer information system. Technical Report GIT-CC-02-29. Georgia Institute of Technology, College of Computing. 2002
[85] Wang Yao, Vassileva Julita. Bayesian network trust model in peer-to-peer networks Agents and Peer-to-Peer. Lecture Notes in Computer Science. Berlin: Springer. 2005. 2872:23-34
[86] K. Aberer, Z. Despotovic, Managing trust in a peer-2-peer information system. In: Proceedings of the tenth international conference on Information and knowledge management. New York: ACM Press. 2001. 310~317
[87] S. Wasserman and K. Faust, Social Network Analysys:Methods and Applications, Cambridge, Cambridge University Press, 1994, p.249
[88]李景涛, P2P环境下信任模型与副本方案研究: [博士学位论文],上海:复旦大学, 2006