结构化P2P覆盖网络路由算法及安全相关技术研究
|
摘要
P2P覆盖网络(peer-to-peer overlay networks)具有自组织和分布式的特点,能够充分利用Internet环境中的边缘实体进行大规模的协同计算和资源共享,近年来得以快速发展,在文件共享、搜索引擎、分布式存储、分布式计算等领域都有广泛的应用。从拓扑的角度划分,P2P网络可以分为非结构化P2P和结构化P2P。目前较为流行的是结构化P2P网络,也是第三代P2P网络。
由于结构化P2P覆盖网络规模的不断增长,要求更高的网络路由性能。传统的结构化P2P路由算法一般通过O(logn)路由指针项获得O(logn)的路由长度,并且在节点加入和退出时带来O(logn)的网络抖动。如何利用更少的路由指针获得更长的路由长度以及降低网络抖动,是目前结构化P2P网络路由算法研究的热点。另外,由于对等端的开放性、对等性、随意性以及无监督性给P2P网络带来了许多亟待解决的安全问题,如恶意节点攻击、团队恶意欺骗、知识产权问题等。本文围绕结构化P2P网络路由算法和P2P安全相关技术两方面内容展开了深入研究,取得了如下创新性研究成果：
(1)提出了一种新的结构化P2P覆盖网络路由算法CSSP。该路由算法采用全分布式的单环拓扑,设计了缓存节点、后继节点和动态超级节点,提出了节点的缓存策略、节点加入和离开的路由维护算法以及超级节点的分布式选举算法,保证了CSSP的自组织。仿真和分析证明了CSSP的正确性,相比传统路由算法,CSSP通过O(L+2)的路由指针可获得O(N)的路由长度,路由平均在O(2)跳内完成,具有快速路由、低抖动和高容错特性,是一种有效的路由算法。
(2)提出了一种基于节点通信历史聚类的结构化P2P路由算法K-CSSP。该路由算法通过对节点通信历史的分布式存储来计算节点的稳定性,利用K-means算法按稳定性对节点进行聚类,将CSSP划分为K个具有稳定核心并相互连通的域,通过O(L+K)的路由维护开销获得O(N)的路由长度,路由在O(K)跳内完成。给出了K-CSSP的分布式聚类模型,设计了节点加入和离开时的路由维护算法以及聚簇中心的更新算法来保证K-CSSP的自组织。实验及分析表明K-CSSP设计正确,具有较快的聚类收敛速度和稳定的路由性能,拓扑具有高稳定性,是一种高效的路由算法。
(3)提出了一种新的P2P分布式信任模型NBRTrust.在节点通信历史分布式存储基础上构造了节点局部信任度评价分布式存储网β-list,通过分布式计算节点信任评价行为的相关度,得到节点相关度加权的全局信任模型NBRTrust,用于评估节点的可信程度；定义了模型的数学表述和分布式计算方法,设计基于NBRTrust信任模型的P2P通信模型。仿真分析表明,相比传统的局部信任模型和全局信任模型,NBRTrust信任模型更客观,能够有效抵御单个恶意节点和团队恶意节点的欺骗行为,是一种有效的信任模型。
(4)提出了一种基于生物特征的结构化P2P内容控制方法HFFCSC。通过获取使用者的人脸生物特征生成256位密钥及256位随机IV序列对P2P内容进行分布式加解密,并且设计了包含使用者人脸参数的P2P响应报文,利用人脸生物特征对P2P内容进行版权控制。实验和分析表明,HFFCSC是有效的P2P内容控制方法。
Peer-to-Peer overlay network, which is self-organized and distributed, can make full use of the edge system entities in Internet-scale to construct large-scale cooperating and resource sharing environments. With fast development in recent years, the p2p technology is used widely in many application areas like file sharing, search engine, distributed storage, distributed computing and etc. The p2p network can be classified into unstructured p2p and structured p2p in terms of the topology, and the structured p2p network is the third generation p2p network and more popular used, while the unstructured p2p is the first and second generation.
As the network scale increasing continuously, the structured p2p network requests more efficient routing performance, while the traditional structured p2p routing protocols using O (logn) routing fingers to get O (logn) routing path and spending O (logn) network churning. In order to improve the routing algorithm efficiency of the structured peer-to-peer overlay networks, using much less routing fingers to get longer routing path and reducing the network churning, the routing algorithms are studied hotly. Because of the openness, reciprocity, random and spontaneous joining of the nodes and the lack of centralized system management in the structured distributed p2p system, some urgent problems regarding the availability and security of p2p network remain to be solved, such as evil node attacking, team evils cheating, intellectual property rights in p2p and etc. This paper presents in-depth study on p2p routing algorithms and p2p security technologies for structured p2p network, and makes some creative research results as follows:
(1) Presented a new routing algorithm of structured p2p overlay networks, called CSSP. This routing algorithm use single-circle topology with cache nodes, successor nodes and a super node. The CSSP can get O (N) routing path only use O (L+2) routing fingers, and the routing operations can finished in O (2) hops. Cache policy, routing maintenance algorithms for nodes' joining and leaving and election algorithms for super node were presented to ensure the self-organization. Simulations and analysis showed that the CSSP is an efficient route algorithm with quickly routing speed, lower churning count and high fault-tolerance.
(2) Presented a new routing algorithm K-CSSP of structured p2p overlay networks based on clustering the nodes'communication history. This routing algorithm computing the nodes'stability via storing the nodes'communication history distributed. The K-CSSP uses the K-means algorithm to cluster the CSSP nodes by the stabilities into K regions which inter-linked each other by steady kernel node, and it can get O (N) routing path only use O (L+K) routing fingers, and the routing operations can finished in O (K) hops. A distributed cluster model, routing maintenance algorithms for nodes' joining and leaving and cluster-center node's updating algorithm were presented to ensure the self-organization. Simulations and analysis prove the rightness and efficiency with fast cluster constringency, steady routing performance and topology.
(3) Presented a new distributed p2p trust model NBRTrust. Constructed the distributed local trust degree appraising networkβ-list based on the distributed storage for the nodes'communication history, the NBRTrust trust model, which was proposed to quantify and evaluate the trustworthiness of nodes, was formed by global trust model with nodes'correlative similarity weighted which was distributed computed from theβ-list. A mathematical description and a distributed implementation were defined, and a p2p communication model based on the NBRTrust model was designed. Simulations and analysis proved the NBRTrust was more impersonality comparing with traditional local trust model and global trust model, and it can withstand simple evil node's attacking and team evil nodes'cheating also. The NBRTrust is an efficient global trust model.
(4) Presented a new content controlling method HFFCSC based on biometric for structured p2p overlay networks. The HFFCSC generated 256 bits key and 256 bits IV sequence by obtaining the user's human-face feature to encrypting and decrypting the p2p content. A p2p response message was designed which including user's human-face parameter, to control the copyright of shared files. Experiment and analysis prove the rightness, and the HFFCSC is a valid content controlling method for structured p2p overlay networks.
由于结构化P2P覆盖网络规模的不断增长,要求更高的网络路由性能。传统的结构化P2P路由算法一般通过O(logn)路由指针项获得O(logn)的路由长度,并且在节点加入和退出时带来O(logn)的网络抖动。如何利用更少的路由指针获得更长的路由长度以及降低网络抖动,是目前结构化P2P网络路由算法研究的热点。另外,由于对等端的开放性、对等性、随意性以及无监督性给P2P网络带来了许多亟待解决的安全问题,如恶意节点攻击、团队恶意欺骗、知识产权问题等。本文围绕结构化P2P网络路由算法和P2P安全相关技术两方面内容展开了深入研究,取得了如下创新性研究成果：
(1)提出了一种新的结构化P2P覆盖网络路由算法CSSP。该路由算法采用全分布式的单环拓扑,设计了缓存节点、后继节点和动态超级节点,提出了节点的缓存策略、节点加入和离开的路由维护算法以及超级节点的分布式选举算法,保证了CSSP的自组织。仿真和分析证明了CSSP的正确性,相比传统路由算法,CSSP通过O(L+2)的路由指针可获得O(N)的路由长度,路由平均在O(2)跳内完成,具有快速路由、低抖动和高容错特性,是一种有效的路由算法。
(2)提出了一种基于节点通信历史聚类的结构化P2P路由算法K-CSSP。该路由算法通过对节点通信历史的分布式存储来计算节点的稳定性,利用K-means算法按稳定性对节点进行聚类,将CSSP划分为K个具有稳定核心并相互连通的域,通过O(L+K)的路由维护开销获得O(N)的路由长度,路由在O(K)跳内完成。给出了K-CSSP的分布式聚类模型,设计了节点加入和离开时的路由维护算法以及聚簇中心的更新算法来保证K-CSSP的自组织。实验及分析表明K-CSSP设计正确,具有较快的聚类收敛速度和稳定的路由性能,拓扑具有高稳定性,是一种高效的路由算法。
(3)提出了一种新的P2P分布式信任模型NBRTrust.在节点通信历史分布式存储基础上构造了节点局部信任度评价分布式存储网β-list,通过分布式计算节点信任评价行为的相关度,得到节点相关度加权的全局信任模型NBRTrust,用于评估节点的可信程度；定义了模型的数学表述和分布式计算方法,设计基于NBRTrust信任模型的P2P通信模型。仿真分析表明,相比传统的局部信任模型和全局信任模型,NBRTrust信任模型更客观,能够有效抵御单个恶意节点和团队恶意节点的欺骗行为,是一种有效的信任模型。
(4)提出了一种基于生物特征的结构化P2P内容控制方法HFFCSC。通过获取使用者的人脸生物特征生成256位密钥及256位随机IV序列对P2P内容进行分布式加解密,并且设计了包含使用者人脸参数的P2P响应报文,利用人脸生物特征对P2P内容进行版权控制。实验和分析表明,HFFCSC是有效的P2P内容控制方法。
Peer-to-Peer overlay network, which is self-organized and distributed, can make full use of the edge system entities in Internet-scale to construct large-scale cooperating and resource sharing environments. With fast development in recent years, the p2p technology is used widely in many application areas like file sharing, search engine, distributed storage, distributed computing and etc. The p2p network can be classified into unstructured p2p and structured p2p in terms of the topology, and the structured p2p network is the third generation p2p network and more popular used, while the unstructured p2p is the first and second generation.
As the network scale increasing continuously, the structured p2p network requests more efficient routing performance, while the traditional structured p2p routing protocols using O (logn) routing fingers to get O (logn) routing path and spending O (logn) network churning. In order to improve the routing algorithm efficiency of the structured peer-to-peer overlay networks, using much less routing fingers to get longer routing path and reducing the network churning, the routing algorithms are studied hotly. Because of the openness, reciprocity, random and spontaneous joining of the nodes and the lack of centralized system management in the structured distributed p2p system, some urgent problems regarding the availability and security of p2p network remain to be solved, such as evil node attacking, team evils cheating, intellectual property rights in p2p and etc. This paper presents in-depth study on p2p routing algorithms and p2p security technologies for structured p2p network, and makes some creative research results as follows:
(1) Presented a new routing algorithm of structured p2p overlay networks, called CSSP. This routing algorithm use single-circle topology with cache nodes, successor nodes and a super node. The CSSP can get O (N) routing path only use O (L+2) routing fingers, and the routing operations can finished in O (2) hops. Cache policy, routing maintenance algorithms for nodes' joining and leaving and election algorithms for super node were presented to ensure the self-organization. Simulations and analysis showed that the CSSP is an efficient route algorithm with quickly routing speed, lower churning count and high fault-tolerance.
(2) Presented a new routing algorithm K-CSSP of structured p2p overlay networks based on clustering the nodes'communication history. This routing algorithm computing the nodes'stability via storing the nodes'communication history distributed. The K-CSSP uses the K-means algorithm to cluster the CSSP nodes by the stabilities into K regions which inter-linked each other by steady kernel node, and it can get O (N) routing path only use O (L+K) routing fingers, and the routing operations can finished in O (K) hops. A distributed cluster model, routing maintenance algorithms for nodes' joining and leaving and cluster-center node's updating algorithm were presented to ensure the self-organization. Simulations and analysis prove the rightness and efficiency with fast cluster constringency, steady routing performance and topology.
(3) Presented a new distributed p2p trust model NBRTrust. Constructed the distributed local trust degree appraising networkβ-list based on the distributed storage for the nodes'communication history, the NBRTrust trust model, which was proposed to quantify and evaluate the trustworthiness of nodes, was formed by global trust model with nodes'correlative similarity weighted which was distributed computed from theβ-list. A mathematical description and a distributed implementation were defined, and a p2p communication model based on the NBRTrust model was designed. Simulations and analysis proved the NBRTrust was more impersonality comparing with traditional local trust model and global trust model, and it can withstand simple evil node's attacking and team evil nodes'cheating also. The NBRTrust is an efficient global trust model.
(4) Presented a new content controlling method HFFCSC based on biometric for structured p2p overlay networks. The HFFCSC generated 256 bits key and 256 bits IV sequence by obtaining the user's human-face feature to encrypting and decrypting the p2p content. A p2p response message was designed which including user's human-face parameter, to control the copyright of shared files. Experiment and analysis prove the rightness, and the HFFCSC is a valid content controlling method for structured p2p overlay networks.
引文
1. Touch, J. Overlay networks [J].Computer Networks.36 (2),2001:115-116.
2. Nakashima T, Ono A, Sueyoshi T. Performance framework for P2P overlay network[C].2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP). Piscataway, NJ, USA. 2008:101-104.
3. A. Oram. Peer-to-Peer:Harnessing the Power of Disruptive Technologies, O'Reilly & Associates, Inc., Sebastopol, CA, USA,2001.
4. R. Steinmetz, K. Wehrle. Peer-to-Peer Networking&Computing. Springer Heidelberg, Informatik-Spektrum,2004,27(1):51-54.
5. John M G, Suresh C R. Choosing Client/Server Architecture. Information Systems Management,1996,12(2):67-76.
6.罗杰文.Peer-To-Peer综述. http://www.intsci.ac.cn/users/luojw/p2p/,2006.
7.徐恪,熊勇强.对等网络研究综述.http://bigpc.net.pku.edu.cn:8080/paper/surveyP2P.pdf,2005.
8. Vishnumurthy V, Francis P. A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection[C].2007 USENIX Annual Technical Conf. Berkeley, CA, USA.2007:309-322.
9. Kantere Verena, Tsoumakos Dimitrios, Roussopoulos Nick. Querying structured data in an unstructured P2P system[C]. Proceedings of the Int. Workshop on Web Information and Data Management. Washington, DC, United States.2004:64-71.
10. Napster, "Napster Messages", http://opennap.sourceforge.net/napster.txt,2000.
11. I Clarke. Freenet's Next Generation Routing Protocol. http://freenet.sourceforge.net/ind--ex.php?page=ngrouting,2003.
12. I Clarke, S G. Miller, T W Hong, O Sandberg, et al. Protecting Free Expression Online with Freenet [J]. IEEE Internet Computing,2002,6(1):40-49.
13. Freenet, "Freenet Homepage", http://freenetproject.org/cgi-bin/twiki/view/Main/WebHome,2001.
14. iMesh, "iMesh homepage",www.imesh.com,2004.
15. Kazaa, "Kazaa Homepage", http://www.kazaa.com/us/index.htm,2003.
16. Clip2, "The Gnutella protocol Specification v0.4(Document Revision 1.2)", http://www.--clip2.com/Gnutellaprotoco104.pdf,2001.
17. Chawathe Y, Sylvia Ratnasamy, Breslau L, et al. Making Gnutella-like P2P systems scalable[C]. ACM SIGCOMM 2003:Conference on Computers. ACM, USA.2003.
18. KaZaA Lite, http://k-litetk.com.
19. Skype, "Skype Homepage", http://www.skype.com/,2004.
20. eMule, "eMule Project Team Homepage", http://www.emule-project.net,2002.
21. MetaSearch Inc. "edonkey2000 Homepage", http://www.edonkey2000.com,2003.
22. Alima Luc Onana, Ghodsi Ali, Haridi Seif. A framework for structured peer-to-peer overlay networks [C].2nd IST/FET International Workshop on Global Computing, GC 2004. Rovereto, Italy.2004:223-249.
23. Zhao Ben Y, Kubiatowicz John D, Joseph Anthony D. Tapestry:A fault-tolerant wide-area application infrastructure [J].2002,32(1):81.
24. Wells C. The oceanstore archive:Goals, structures, and self-repair [D]. UCBerkeley:University of California,2002.
25. Kubiatowicz J, Wells C, Zhao B, et al. OceanStore:An architecture for global-scale persistent storage[C]. Proc.of the 9th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems.2000:190-201.
26. I Stoica, R Morris, D Karger, et al. Chord:A Scalable Peer-To-Peer Lookup Service for Internet Applications[C]. Proceedings of the 2001 ACM Sigcomm Conference. ACM Press, USA.2001:149-160.
27. Andersen David, Balakrishnan Hari, Kaashoek Frans, et al. Resilient overlay networks[C].18th ACM Symposium on Operating Systems Principles (SOSP'01). Banff, Alta, Canada.2001:131-145.
28. S Ratnasamy, P Francis, M Handley, et al. A Scalable Content-Addressable Network[C]. In SIGCOMM, ACM Press.2001:161-172.
29. http://iris.lcs.mit.edu/
30. B Traversat, A Arora, M Abdelaziz, et al. Project JXTA 2.0 Super-Peer Virtual Network. http://www.jxta.org/project/www/docs/JXTA2.0protocolsl.pdf,2003.
31. http://maze.tianwang.com/.
32. Zheng W, Hu J, Li M. Granary:Architecture of object oriented Internet storage service[C]. Proc.of the IEEE Int'l Conf.on E-Commerce Technology for Dynamic E-Business.2004:294-297.
33. http://hpc.es.tsinghua.edu.en/granary/.
34. Xiaofei Liao, Hai Jin, Yunhao Liu, et al. AnySee:peer-to-peer live streaming[C]. 25th IEEE INFOCOM Conference. Barcelona, Spain.2411-2420.
35. Lu Tian-bo, Fang Bin-xing, Sun Yu-zhong, et al. Analysis of anonymity protocol WonGoo with probabilistic model checking [J]. China:Mini-Micro Systems. 2006,27(4):646-50.
36. http://p2p.grids.cn.
37. Groove Networks, http://www.groove.net,2004.
38. Ralf Steinmetz, Klaus Wehrle. Peer-to-Peer Systems and Applications [J]. Springer-Verlag Berlin Heidelberg.2005:10-13,100-110.
39.徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M],北京：机械工业出版社,2003：130-149.
40. Chu Jacky, Labonte Kevin, Levine Brian Neil. An evaluation of Chord using traces of peer-to-peer files sharing[C]. SIGMETRICS 2004/Performance 2004: Joint International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery, New York, NY 10036-5701, United States.2004:432-433.
41. A Rowstron, P Druschel. Pastry:Scalable, Distributed Object Location and routing for Large-Scale Peer-to-Peer Systems[C]. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Springer Heidelberg, Germany.2001:329-350.
42. Delmastro Franca. From pastry to CrossROAD:CROSS-layer ring overlay for ad hoc networks[C]. Third IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom 2005 Workshops. IEEE Computer Society, Piscataway, NJ 08855-1331, United States.2005:60-64.
43. A Orlowski. I poisoned P2P networks for the RIAA-whistleblower,2003.
44. I Stoica, R Morris, D Liben-Nowell, et al. Chord:A scalable Peer-to-Peer Lookup Service for Internet Applications [J]. IEEE Transactions on Networking,2003, 11(1):17-32.
45. E Sit, R Morris. Security Considerations for Peer-to-Peer Distributed Hash Tables. In IPTPS 2002.
46. J Douceur. The Sybil Attack[C]. In 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), Springer,2002.
47. D Anderson. SETI@home[M], O'Reilly, Sebastopol,2001:67-76.
48. A Back. Hash cash-a denial of service counter-measure,2002.
49. Hewlett-Packard Company & WaveSystem Corporation. The EMBASSY E-Commerce System, http://www.wave.com/technology/embassy.html,2004.
50. P R Zimmermann. The official PGP user's guide [M], The MIT Press, Cambridge, MA, USA,1995.
51. Kaliski B S. RSA digital signatures [J]. Dr. Dobb's Journal. Miller Freedman Inc. May 2001.26(5):30.
52. I Clarke, O Sandberg, B Wiley, et al. Freenet:A Distributed Anonymous Information Storage and Retrieval System[C]. In ICSI Workshop on Design Issues in Anonymity and Unobservability,2000.
53. I Clarke, O Sandberg, B Wiley, et al. Freenet:A Distributed Anonymous Information Storage and Retrieval System[C]. In ICSI Workshop on Design Issues in Anonymity and Unobservability,2000.
54. P F Syverson, D M Goldschlag, M G Reed. Anonymous Connections and Onion Routing[C]. In IEEE Symposium on Security and Privacy, Oakland, California, 1997:44-54.
55.胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报.2006,16(5)：991-999.
56. Zhao B, Kubiatowicz J, Joseph A. Tapestry:An infrastructure for fault-tolerant wide-area location and routing [J]. Technical Report, Berkeley Computer Science Division, University of California,2001.
57. Sushant Jain, Ratul Mahajan, David Wetherall. A Study of the Performance Potential of DHT-based Overlays[C].4th USENIX Symposium on Internet Technologies and Systems, USITS 2003,2003.3.
58. Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays[C]. In:Proc. of the 9th Workshop on Hot Topics in Operating Systems.2003. http://www.usenix.org/events/hotos03/.
59. Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks[C]. In:Proc.of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies.2003. http://www.ieee-infocom.org/2003/.
60. Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience[C]. In:Proc. of the SIGCOMM 2003.2003. http://www.acm.org/silts/sigcomm/sigcomm2003/.
61. Gupta I, Binnan K, Linga P, et al. Kelips:Building an efficient and stable P2P DHT through increased memory and background overhead[C]. In:Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems.2003. http://iptps03.cs.berkeley.edu/.
62. Gummadi K, Gummadi R, Gribble S, et al. The impact of DHT routing geometry on resilience and proximity[C]. In:Proc. of the SIGCOMM 2003.2003. http://www.acm.org/silts/sigcomm/sigcomm2003/.
63. Chang E G, Roberts R. An improved algorithm for decentralized extrema-finding in circular configurations of processors [J]. Communications of the ACM,1979, 22(5):281-282.
64.戴彬,王芙蓉,刘见.基于自组织P2P实时应用的可扩展路由算法[J].华中科技大学学报(自然科学版).2007,35(4)：40-43.
65. Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer. Meridian:a light weight network location service without virtual coordinates[C] SIGCOMM.Phila-delphia:ACM Press.2005:85-96.
66.周晓波,周健,卢汉成,洪佩琳.一种基于层次化兴趣的非结构化P2P拓扑形成模型[J].软件学报,2007,18(2)：3131-3138.
67.欧阳竟成,林亚平,周四望,等.P2P环境下的全局信任值分级计算方法[J].通信学报,2008,29(8)：38-45.
68.陈明,鹿旸.基于语义相似度的P2P平衡路由网络[J].微电子学与计算机, 2007,24(10)：26-28.
69. LIU Ye, YANG Peng. An Advanced Algorithm to P2P Semantic Routing Based on the Topologically-Aware Clustering in Self-Organizing Mode [J]. Journal of software,2006,17(2):339-348.
70.张骞,张霞,刘积仁.混合P2P环境下有效的访问控制机制[J].东北大学学报(自然科学版),2007,28(5)：643-647.
71.谭振华,程维,常桂然等.基于词汇相关度模型的个性化信息检索算法[J].东北大学学报(自然科学版),2008.4,29(4)：504-507.
72. R Agrawal, J Gehrke, D Gunopulos, and et al. Automatic subspace clustering of high dimensional data for data mining applications[C]. In Proc. ACM-SIGMOD Int. Conf. Management of Data, Seattle, Washington, June 1998:94-105.
73. M Ankerst, M Breunig, H P Kriegel, et al. Optics:Ordering points to identify the clustering structure[C]. In Proc. of 1999 ACM-SIGMOD Int. Conf Management of Data, Philadelphia, PA. June 1999:49-60.
74. P Cheeseman, J Stutz. Bayesian classification (AutoClass):Theory and results [M]. Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996:153-180.
75. Z Huang. Extensions to the k-means algorithm for clustering large data sets with categorical values [M]. Data Mining and Knowledge Discovery.1998(2): 283-304.
76. G.Karypis, E H Han, V Kumar. CHAMELEON:A hierarchical clustering algorithm using dynamic modeling. COMPUTER,1999(32):6875.
77. Nasser Alissar, Hamad Denis, Nasr Chaiban. K-means clustering algorithm in projected spaces[C].2006 9th International Conference on Information Fusion, FUSION. IEEECS, Piscataway, US.2006:4086023.
78. Pelleg Dan, Baras Dorit. K-means with large and noisy constraint sets[C].18th European Conference on Machine Learning, ECML 2007. Springer Verlag, Heidelberg, D-69121, Germany.2007:674-682.
79. Justin Zhan. Privacy preserving k-medoids clustering[C]. IEEE International Conference on Systems, Man and Cybernetics,2007. Piscataway, NJ, USA.2007: 3600-3603.
80. Ng R T, Jiawei Han. CLARANS:a method for clustering objects for spatial data mining [J]. IEEE Transactions on Knowledge and Data Engineering.2002, 14(5):1003-1016.
81. ZHENG Xiao-ming, LV Shi-ying, WANG Xiao-dong.Clustering with Immunity-Vaccination Based on Particle Swarm Optimization Algorithm [J]. Journal of University of Electronic Science and Technology of China.2007, 36(6):1264-1267.
82. E A Bernardo, A Huberman. Free Riding on Gnutella. Tech rept:SSL-00-63, Xerox PARC,2000.
83. http://www.sig2dat.com.
84. Li Xiong, k Ling Liu. A Reputation-Based Trust Model for Peer-to-Peer eCommerce Communities[C]. In:Proc. Of the ACM Conference on Electronic Commerce. CA:IEEE Press.2003:275-284.
85. Karl Aberer, Zoran Despotovic. Managing Trust in a Peer-2-Peer Information System[C]. In:Proc. Of the ACM CIKM International Conference on Information and Knowledage Management.2001:310-317.
86. R Chen, Yeager W, Poblano. A Distributed Trust Model for P2P Networks. Sun Microsystem, Palo Alto, Tech Rept:TR-I4-02-08,2002.
87. S Ratnasamy, S Shenker, I Stoica. Routing algorithms for DHTs:Some open questions.First International Workshop on Peer-to-Peer Systems (IPTPS)[C], LNCS 2429,Springer-Verlag Press.2002:45-52.
88. Dou W, Wang HM, Jia Y, Zou P. A recommendation-based peer-to-peer trust model. Journal of Software,2004,15(4):571-583.
89. Altman J. PKI Security for JXTA overlay networks. Technical Report, TR-410, Swiss Federal Institute of Technology,2003.
90. Byeong-Thaek Oh, Sang-Bong Lee, Ho-Jin Park. A peer mutual authentication method using PKI on super peer based peer-to-peer systems[C].2008 10th International Conference on Advanced Communication Technology. Piscataway, NJ, USA.2008:2221-2225.
91. Albrecht K, Ruedi AR. Clippee:A large-scale client/peer system. Technical Report, TR-410, Swiss Federal Institute of Technology,2003.
92. F Cornelli. Choosing Reputable Servents in a P2P Network[C]. In Lassner. D ed. Eleventh International World Wide Web Conference. Hawaii, ACM Press, 2002:441-449.
93. Bleul Holger, Rathgeb Erwin P, Zilling Stefan. Advanced P2P multiprotocol traffic analysis based on application level signature detection. Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. IEEE, Piscataway, NJ 08855-1331, United States.2007:4082404.
94. Khambatti M, Dasgupta P, Ryu KD. A role-based trust model for Peer-to-Peer communities and dynamic coalitions[C]. In:Proc. of the 2nd IEEE International Information Assurance Workshop. New York:IEEE Press,2004:141-154.
95. Gao Ying, Cheng Tao-yuan. Bayesian network-based multiple granularity trust model in P2P [J]. Computer Engineering and Applications.2007,43(13):11-13,21.
96. Wang Y, Vassileva J. Bayesian network trust model in peer-to-peer networks[C]. In:Moro G, ed. Proc. of the 2nd Int'l Workshop on Agents and Peer-to-Peer Computing. Berlin:Springer-Verlag,2004:23-34.
97. Dou W. The research on trust-aware P2P topologies and constructing technologies [D]. Changsha:National University of Defense Technology,2003.
98. Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks[C]. Proc. of the 12th Int'l World Wide Web Conf. Budapest:ACM Press,2003:640-651.
99. Li JT, Jing YN, Xiao XC. A Trust Model Based on Similarity-Weighted Recommendation for P2P Environments.
100.郭磊涛,杨寿保,王菁等.P2P网络中基于矢量空间的分布式信任模型[J].计算机研究与发展,2006,43(9)：1564-1570.
101. Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks. Proc. of the 12th Int'l World Wide Web Conf. Budapest:ACM Press,2003:640-651.
102. Dou W, Wang HM, Jia Y, et al. A recommendation-based peer-to-peer trust model. Journal of Software,2004,15(4):571-583.
103. LI Jing-Tao, JING Yi-Nan, XIAO Xiao-Chun, et al. A Trust Model Based on Similarity-Weighted Recommendation for P2P Environments [J]. Journal of Software.2007,18(1):157-167.
104. Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks[C]. Proc. Of the 12th Int'l World Wide Web Conf. Budapest:ACM Press,2003:640-651.
105.邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法[J].软件学报.2003,14(9)：1621-1628.
106. Sarwar B, Karypis G, Konstan J, et al. Item-Based collaborative filtering recommendation algorithms[C]. In:Proceedings of the 10th International World Wide Web Conference.2001:285～295.
107. Breese J, Hecherman D, Kadie C. Empirical analysis of predictive algorithms for collaborative filtering[C]. In:Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI'98).1998:43～52.
108. Benesty J, Jingdong Chen, Yiteng Huang. On the importance of the Pearson correlation coefficient in noise reduction [J]. IEEE Transactions on Audio, Speech & Language Processing.2008,16(4):757-765.
109. Neto A Miranda, Rittner L, Leite N, et al. Pearson's correlation coefficient for discarding redundant information in real time autonomous navigation system[C]. 16th IEEE International Conference on Control Applications, CCA 2007. Part of IEEE Multi-conference on Systems and Control. IEEE, New York, NY 10016-5997, United States.2007:426-431.
110.张宇镭,党琰,贺平安.利用Pearson相关系数定量分析生物亲缘关系[J].计算机工程与应用.2005,33：79-82,99.
111.林闯,封富君,李俊山.新型网络环境下的访问控制技术[J].软件学报.2007,18(4)：955-966.
112.贾宁.密码算法的研究综述[J].现代电子技术.2007,11：59-61.
113.王宇洁,许占文,郑守春.密码技术综述[J].沈阳工业大学学报.2000,22(4)：406-409.
114.杨景辉,王丽娜,于戈AES—Rijndael算法综述[J].计算机科学,2002,29(4)：48-49,34.
¨5.田捷,杨鑫.生物特征加密技术概述[J].中国自动识别技术.2008(2)：98-101.
116. Hoque Sanaul, Fairhurst Michael, Howells Gareth. Evaluating biometric encryption key generation using handwritten signatures[C]. Proceedings BLISS 2008-2008 ECSIS Symposium on Bio-inspired, Learning, and Intelligent Systems for Security. IEEE, Piscataway, NJ 08855-1331, United States. 2008:17-22.
117. CHANG Yaojen, ZHANG Wende, CHEN Tsuhan. Biometrics-based cryptographic key generation[C]. Proc of IEEE International Conf. on Multimedia and Expo[C]. Taiwan,2004:2203-2206.
118. MONROSE F, RETTER M K, LI Q W,et al. Cryptographic key generation from voice[C]. Proc of IEEE Symposium on Security and Privacy. Oakland,2001: 202-213.
119. SIYAL.M Y, AHMED. F. A biometric-based scheme for enhancing security of cryptographic keys[C]. Proc of the 10th IEEE Region Conference.IEEE, Piscatawang NJ USA,2004:407-410.
120. JIN TAB, LING. D C L, GOH A. Personalized cryptographic key generation based on face hashing [J]. Computers&Security,2004,23(7):606-614.
121. Eiido H, Kawahara Y, Asami T. A self-encryption based private storage system over P2P distributed file sharing infrastructure[C]. First ITU-T Kaleidoscope Academic Conference. Innovations in NGN. Future Network and Services. Piscataway, NJ, USA.2008:69-76.
122. Watanabe Y, Numao M. Access control for encrypted data in P2P data sharing [J]. Transactions of the Information Processing Society of Japan,2003:4437-2443.
123.赵恒,权义宁,胡予濮.一种新的P2P数据共享解密授权方案[J].西安电子科技大学学报(自然科学版).2005,32(5)：781-785.
124.尹毅峰,薛鸿民.利用P2P的网络特性构造多态性密码[J].微计算机信息.2007,23(7)：74-75.
125. Youngho Park, Jung-Hwa Shin, Kyung-Hyune Rhee. Design of a secure digital contents delivery system in P2P networks[C]. Berlin, Germany.2006:311-321.
126. Ahmad W, Khokhar A. SAMcast-a scalable, secure and authenticated multicast protocol for large scale P2P networks[C].2007 IEEE International Conference on Communications. Piscataway, NJ, USA.2008:1478-1483.
127. Lee Ho Gyun, Nam Taek Yong, Jang Jong Soo. The method of P2P traffic detecting for P2P harmful contents prevention[C].7th International Conference on Advanced Communication Technology, ICACT 2005.2005:777-780.
128. C Batten, K Barr, A Saraf and et al. pStore:A Secure Peer-to-Peer Backup System [J]. Technical Memo MIT-LCS-TM-632, Massachusetts Institute of Technology Laborotory for Computer Science,2002.
129. M Lillibridge, S Elnikety, A Birrell and et al. A Cooperative Internet Backup Schema[C]. In USENIX 2003 Annual Technical Conference. HP System Research Center, Palo Alto, USA.2002:29-42.
130. L P Cox, B D noble. Pastiche:Making backup cheap and easy[C]. In Fifth USENIX Symposium on Operating Systems Desing and Implementation. New York, NY, USA, ACM Press.2002:285-298.
2. Nakashima T, Ono A, Sueyoshi T. Performance framework for P2P overlay network[C].2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP). Piscataway, NJ, USA. 2008:101-104.
3. A. Oram. Peer-to-Peer:Harnessing the Power of Disruptive Technologies, O'Reilly & Associates, Inc., Sebastopol, CA, USA,2001.
4. R. Steinmetz, K. Wehrle. Peer-to-Peer Networking&Computing. Springer Heidelberg, Informatik-Spektrum,2004,27(1):51-54.
5. John M G, Suresh C R. Choosing Client/Server Architecture. Information Systems Management,1996,12(2):67-76.
6.罗杰文.Peer-To-Peer综述. http://www.intsci.ac.cn/users/luojw/p2p/,2006.
7.徐恪,熊勇强.对等网络研究综述.http://bigpc.net.pku.edu.cn:8080/paper/surveyP2P.pdf,2005.
8. Vishnumurthy V, Francis P. A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection[C].2007 USENIX Annual Technical Conf. Berkeley, CA, USA.2007:309-322.
9. Kantere Verena, Tsoumakos Dimitrios, Roussopoulos Nick. Querying structured data in an unstructured P2P system[C]. Proceedings of the Int. Workshop on Web Information and Data Management. Washington, DC, United States.2004:64-71.
10. Napster, "Napster Messages", http://opennap.sourceforge.net/napster.txt,2000.
11. I Clarke. Freenet's Next Generation Routing Protocol. http://freenet.sourceforge.net/ind--ex.php?page=ngrouting,2003.
12. I Clarke, S G. Miller, T W Hong, O Sandberg, et al. Protecting Free Expression Online with Freenet [J]. IEEE Internet Computing,2002,6(1):40-49.
13. Freenet, "Freenet Homepage", http://freenetproject.org/cgi-bin/twiki/view/Main/WebHome,2001.
14. iMesh, "iMesh homepage",www.imesh.com,2004.
15. Kazaa, "Kazaa Homepage", http://www.kazaa.com/us/index.htm,2003.
16. Clip2, "The Gnutella protocol Specification v0.4(Document Revision 1.2)", http://www.--clip2.com/Gnutellaprotoco104.pdf,2001.
17. Chawathe Y, Sylvia Ratnasamy, Breslau L, et al. Making Gnutella-like P2P systems scalable[C]. ACM SIGCOMM 2003:Conference on Computers. ACM, USA.2003.
18. KaZaA Lite, http://k-litetk.com.
19. Skype, "Skype Homepage", http://www.skype.com/,2004.
20. eMule, "eMule Project Team Homepage", http://www.emule-project.net,2002.
21. MetaSearch Inc. "edonkey2000 Homepage", http://www.edonkey2000.com,2003.
22. Alima Luc Onana, Ghodsi Ali, Haridi Seif. A framework for structured peer-to-peer overlay networks [C].2nd IST/FET International Workshop on Global Computing, GC 2004. Rovereto, Italy.2004:223-249.
23. Zhao Ben Y, Kubiatowicz John D, Joseph Anthony D. Tapestry:A fault-tolerant wide-area application infrastructure [J].2002,32(1):81.
24. Wells C. The oceanstore archive:Goals, structures, and self-repair [D]. UCBerkeley:University of California,2002.
25. Kubiatowicz J, Wells C, Zhao B, et al. OceanStore:An architecture for global-scale persistent storage[C]. Proc.of the 9th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems.2000:190-201.
26. I Stoica, R Morris, D Karger, et al. Chord:A Scalable Peer-To-Peer Lookup Service for Internet Applications[C]. Proceedings of the 2001 ACM Sigcomm Conference. ACM Press, USA.2001:149-160.
27. Andersen David, Balakrishnan Hari, Kaashoek Frans, et al. Resilient overlay networks[C].18th ACM Symposium on Operating Systems Principles (SOSP'01). Banff, Alta, Canada.2001:131-145.
28. S Ratnasamy, P Francis, M Handley, et al. A Scalable Content-Addressable Network[C]. In SIGCOMM, ACM Press.2001:161-172.
29. http://iris.lcs.mit.edu/
30. B Traversat, A Arora, M Abdelaziz, et al. Project JXTA 2.0 Super-Peer Virtual Network. http://www.jxta.org/project/www/docs/JXTA2.0protocolsl.pdf,2003.
31. http://maze.tianwang.com/.
32. Zheng W, Hu J, Li M. Granary:Architecture of object oriented Internet storage service[C]. Proc.of the IEEE Int'l Conf.on E-Commerce Technology for Dynamic E-Business.2004:294-297.
33. http://hpc.es.tsinghua.edu.en/granary/.
34. Xiaofei Liao, Hai Jin, Yunhao Liu, et al. AnySee:peer-to-peer live streaming[C]. 25th IEEE INFOCOM Conference. Barcelona, Spain.2411-2420.
35. Lu Tian-bo, Fang Bin-xing, Sun Yu-zhong, et al. Analysis of anonymity protocol WonGoo with probabilistic model checking [J]. China:Mini-Micro Systems. 2006,27(4):646-50.
36. http://p2p.grids.cn.
37. Groove Networks, http://www.groove.net,2004.
38. Ralf Steinmetz, Klaus Wehrle. Peer-to-Peer Systems and Applications [J]. Springer-Verlag Berlin Heidelberg.2005:10-13,100-110.
39.徐恪,吴建平,徐明伟.高等计算机网络——体系结构、协议机制、算法设计与路由器技术[M],北京：机械工业出版社,2003：130-149.
40. Chu Jacky, Labonte Kevin, Levine Brian Neil. An evaluation of Chord using traces of peer-to-peer files sharing[C]. SIGMETRICS 2004/Performance 2004: Joint International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery, New York, NY 10036-5701, United States.2004:432-433.
41. A Rowstron, P Druschel. Pastry:Scalable, Distributed Object Location and routing for Large-Scale Peer-to-Peer Systems[C]. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Springer Heidelberg, Germany.2001:329-350.
42. Delmastro Franca. From pastry to CrossROAD:CROSS-layer ring overlay for ad hoc networks[C]. Third IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom 2005 Workshops. IEEE Computer Society, Piscataway, NJ 08855-1331, United States.2005:60-64.
43. A Orlowski. I poisoned P2P networks for the RIAA-whistleblower,2003.
44. I Stoica, R Morris, D Liben-Nowell, et al. Chord:A scalable Peer-to-Peer Lookup Service for Internet Applications [J]. IEEE Transactions on Networking,2003, 11(1):17-32.
45. E Sit, R Morris. Security Considerations for Peer-to-Peer Distributed Hash Tables. In IPTPS 2002.
46. J Douceur. The Sybil Attack[C]. In 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), Springer,2002.
47. D Anderson. SETI@home[M], O'Reilly, Sebastopol,2001:67-76.
48. A Back. Hash cash-a denial of service counter-measure,2002.
49. Hewlett-Packard Company & WaveSystem Corporation. The EMBASSY E-Commerce System, http://www.wave.com/technology/embassy.html,2004.
50. P R Zimmermann. The official PGP user's guide [M], The MIT Press, Cambridge, MA, USA,1995.
51. Kaliski B S. RSA digital signatures [J]. Dr. Dobb's Journal. Miller Freedman Inc. May 2001.26(5):30.
52. I Clarke, O Sandberg, B Wiley, et al. Freenet:A Distributed Anonymous Information Storage and Retrieval System[C]. In ICSI Workshop on Design Issues in Anonymity and Unobservability,2000.
53. I Clarke, O Sandberg, B Wiley, et al. Freenet:A Distributed Anonymous Information Storage and Retrieval System[C]. In ICSI Workshop on Design Issues in Anonymity and Unobservability,2000.
54. P F Syverson, D M Goldschlag, M G Reed. Anonymous Connections and Onion Routing[C]. In IEEE Symposium on Security and Privacy, Oakland, California, 1997:44-54.
55.胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报.2006,16(5)：991-999.
56. Zhao B, Kubiatowicz J, Joseph A. Tapestry:An infrastructure for fault-tolerant wide-area location and routing [J]. Technical Report, Berkeley Computer Science Division, University of California,2001.
57. Sushant Jain, Ratul Mahajan, David Wetherall. A Study of the Performance Potential of DHT-based Overlays[C].4th USENIX Symposium on Internet Technologies and Systems, USITS 2003,2003.3.
58. Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays[C]. In:Proc. of the 9th Workshop on Hot Topics in Operating Systems.2003. http://www.usenix.org/events/hotos03/.
59. Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks[C]. In:Proc.of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies.2003. http://www.ieee-infocom.org/2003/.
60. Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience[C]. In:Proc. of the SIGCOMM 2003.2003. http://www.acm.org/silts/sigcomm/sigcomm2003/.
61. Gupta I, Binnan K, Linga P, et al. Kelips:Building an efficient and stable P2P DHT through increased memory and background overhead[C]. In:Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems.2003. http://iptps03.cs.berkeley.edu/.
62. Gummadi K, Gummadi R, Gribble S, et al. The impact of DHT routing geometry on resilience and proximity[C]. In:Proc. of the SIGCOMM 2003.2003. http://www.acm.org/silts/sigcomm/sigcomm2003/.
63. Chang E G, Roberts R. An improved algorithm for decentralized extrema-finding in circular configurations of processors [J]. Communications of the ACM,1979, 22(5):281-282.
64.戴彬,王芙蓉,刘见.基于自组织P2P实时应用的可扩展路由算法[J].华中科技大学学报(自然科学版).2007,35(4)：40-43.
65. Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer. Meridian:a light weight network location service without virtual coordinates[C] SIGCOMM.Phila-delphia:ACM Press.2005:85-96.
66.周晓波,周健,卢汉成,洪佩琳.一种基于层次化兴趣的非结构化P2P拓扑形成模型[J].软件学报,2007,18(2)：3131-3138.
67.欧阳竟成,林亚平,周四望,等.P2P环境下的全局信任值分级计算方法[J].通信学报,2008,29(8)：38-45.
68.陈明,鹿旸.基于语义相似度的P2P平衡路由网络[J].微电子学与计算机, 2007,24(10)：26-28.
69. LIU Ye, YANG Peng. An Advanced Algorithm to P2P Semantic Routing Based on the Topologically-Aware Clustering in Self-Organizing Mode [J]. Journal of software,2006,17(2):339-348.
70.张骞,张霞,刘积仁.混合P2P环境下有效的访问控制机制[J].东北大学学报(自然科学版),2007,28(5)：643-647.
71.谭振华,程维,常桂然等.基于词汇相关度模型的个性化信息检索算法[J].东北大学学报(自然科学版),2008.4,29(4)：504-507.
72. R Agrawal, J Gehrke, D Gunopulos, and et al. Automatic subspace clustering of high dimensional data for data mining applications[C]. In Proc. ACM-SIGMOD Int. Conf. Management of Data, Seattle, Washington, June 1998:94-105.
73. M Ankerst, M Breunig, H P Kriegel, et al. Optics:Ordering points to identify the clustering structure[C]. In Proc. of 1999 ACM-SIGMOD Int. Conf Management of Data, Philadelphia, PA. June 1999:49-60.
74. P Cheeseman, J Stutz. Bayesian classification (AutoClass):Theory and results [M]. Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996:153-180.
75. Z Huang. Extensions to the k-means algorithm for clustering large data sets with categorical values [M]. Data Mining and Knowledge Discovery.1998(2): 283-304.
76. G.Karypis, E H Han, V Kumar. CHAMELEON:A hierarchical clustering algorithm using dynamic modeling. COMPUTER,1999(32):6875.
77. Nasser Alissar, Hamad Denis, Nasr Chaiban. K-means clustering algorithm in projected spaces[C].2006 9th International Conference on Information Fusion, FUSION. IEEECS, Piscataway, US.2006:4086023.
78. Pelleg Dan, Baras Dorit. K-means with large and noisy constraint sets[C].18th European Conference on Machine Learning, ECML 2007. Springer Verlag, Heidelberg, D-69121, Germany.2007:674-682.
79. Justin Zhan. Privacy preserving k-medoids clustering[C]. IEEE International Conference on Systems, Man and Cybernetics,2007. Piscataway, NJ, USA.2007: 3600-3603.
80. Ng R T, Jiawei Han. CLARANS:a method for clustering objects for spatial data mining [J]. IEEE Transactions on Knowledge and Data Engineering.2002, 14(5):1003-1016.
81. ZHENG Xiao-ming, LV Shi-ying, WANG Xiao-dong.Clustering with Immunity-Vaccination Based on Particle Swarm Optimization Algorithm [J]. Journal of University of Electronic Science and Technology of China.2007, 36(6):1264-1267.
82. E A Bernardo, A Huberman. Free Riding on Gnutella. Tech rept:SSL-00-63, Xerox PARC,2000.
83. http://www.sig2dat.com.
84. Li Xiong, k Ling Liu. A Reputation-Based Trust Model for Peer-to-Peer eCommerce Communities[C]. In:Proc. Of the ACM Conference on Electronic Commerce. CA:IEEE Press.2003:275-284.
85. Karl Aberer, Zoran Despotovic. Managing Trust in a Peer-2-Peer Information System[C]. In:Proc. Of the ACM CIKM International Conference on Information and Knowledage Management.2001:310-317.
86. R Chen, Yeager W, Poblano. A Distributed Trust Model for P2P Networks. Sun Microsystem, Palo Alto, Tech Rept:TR-I4-02-08,2002.
87. S Ratnasamy, S Shenker, I Stoica. Routing algorithms for DHTs:Some open questions.First International Workshop on Peer-to-Peer Systems (IPTPS)[C], LNCS 2429,Springer-Verlag Press.2002:45-52.
88. Dou W, Wang HM, Jia Y, Zou P. A recommendation-based peer-to-peer trust model. Journal of Software,2004,15(4):571-583.
89. Altman J. PKI Security for JXTA overlay networks. Technical Report, TR-410, Swiss Federal Institute of Technology,2003.
90. Byeong-Thaek Oh, Sang-Bong Lee, Ho-Jin Park. A peer mutual authentication method using PKI on super peer based peer-to-peer systems[C].2008 10th International Conference on Advanced Communication Technology. Piscataway, NJ, USA.2008:2221-2225.
91. Albrecht K, Ruedi AR. Clippee:A large-scale client/peer system. Technical Report, TR-410, Swiss Federal Institute of Technology,2003.
92. F Cornelli. Choosing Reputable Servents in a P2P Network[C]. In Lassner. D ed. Eleventh International World Wide Web Conference. Hawaii, ACM Press, 2002:441-449.
93. Bleul Holger, Rathgeb Erwin P, Zilling Stefan. Advanced P2P multiprotocol traffic analysis based on application level signature detection. Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. IEEE, Piscataway, NJ 08855-1331, United States.2007:4082404.
94. Khambatti M, Dasgupta P, Ryu KD. A role-based trust model for Peer-to-Peer communities and dynamic coalitions[C]. In:Proc. of the 2nd IEEE International Information Assurance Workshop. New York:IEEE Press,2004:141-154.
95. Gao Ying, Cheng Tao-yuan. Bayesian network-based multiple granularity trust model in P2P [J]. Computer Engineering and Applications.2007,43(13):11-13,21.
96. Wang Y, Vassileva J. Bayesian network trust model in peer-to-peer networks[C]. In:Moro G, ed. Proc. of the 2nd Int'l Workshop on Agents and Peer-to-Peer Computing. Berlin:Springer-Verlag,2004:23-34.
97. Dou W. The research on trust-aware P2P topologies and constructing technologies [D]. Changsha:National University of Defense Technology,2003.
98. Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks[C]. Proc. of the 12th Int'l World Wide Web Conf. Budapest:ACM Press,2003:640-651.
99. Li JT, Jing YN, Xiao XC. A Trust Model Based on Similarity-Weighted Recommendation for P2P Environments.
100.郭磊涛,杨寿保,王菁等.P2P网络中基于矢量空间的分布式信任模型[J].计算机研究与发展,2006,43(9)：1564-1570.
101. Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks. Proc. of the 12th Int'l World Wide Web Conf. Budapest:ACM Press,2003:640-651.
102. Dou W, Wang HM, Jia Y, et al. A recommendation-based peer-to-peer trust model. Journal of Software,2004,15(4):571-583.
103. LI Jing-Tao, JING Yi-Nan, XIAO Xiao-Chun, et al. A Trust Model Based on Similarity-Weighted Recommendation for P2P Environments [J]. Journal of Software.2007,18(1):157-167.
104. Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks[C]. Proc. Of the 12th Int'l World Wide Web Conf. Budapest:ACM Press,2003:640-651.
105.邓爱林,朱扬勇,施伯乐.基于项目评分预测的协同过滤推荐算法[J].软件学报.2003,14(9)：1621-1628.
106. Sarwar B, Karypis G, Konstan J, et al. Item-Based collaborative filtering recommendation algorithms[C]. In:Proceedings of the 10th International World Wide Web Conference.2001:285～295.
107. Breese J, Hecherman D, Kadie C. Empirical analysis of predictive algorithms for collaborative filtering[C]. In:Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI'98).1998:43～52.
108. Benesty J, Jingdong Chen, Yiteng Huang. On the importance of the Pearson correlation coefficient in noise reduction [J]. IEEE Transactions on Audio, Speech & Language Processing.2008,16(4):757-765.
109. Neto A Miranda, Rittner L, Leite N, et al. Pearson's correlation coefficient for discarding redundant information in real time autonomous navigation system[C]. 16th IEEE International Conference on Control Applications, CCA 2007. Part of IEEE Multi-conference on Systems and Control. IEEE, New York, NY 10016-5997, United States.2007:426-431.
110.张宇镭,党琰,贺平安.利用Pearson相关系数定量分析生物亲缘关系[J].计算机工程与应用.2005,33：79-82,99.
111.林闯,封富君,李俊山.新型网络环境下的访问控制技术[J].软件学报.2007,18(4)：955-966.
112.贾宁.密码算法的研究综述[J].现代电子技术.2007,11：59-61.
113.王宇洁,许占文,郑守春.密码技术综述[J].沈阳工业大学学报.2000,22(4)：406-409.
114.杨景辉,王丽娜,于戈AES—Rijndael算法综述[J].计算机科学,2002,29(4)：48-49,34.
¨5.田捷,杨鑫.生物特征加密技术概述[J].中国自动识别技术.2008(2)：98-101.
116. Hoque Sanaul, Fairhurst Michael, Howells Gareth. Evaluating biometric encryption key generation using handwritten signatures[C]. Proceedings BLISS 2008-2008 ECSIS Symposium on Bio-inspired, Learning, and Intelligent Systems for Security. IEEE, Piscataway, NJ 08855-1331, United States. 2008:17-22.
117. CHANG Yaojen, ZHANG Wende, CHEN Tsuhan. Biometrics-based cryptographic key generation[C]. Proc of IEEE International Conf. on Multimedia and Expo[C]. Taiwan,2004:2203-2206.
118. MONROSE F, RETTER M K, LI Q W,et al. Cryptographic key generation from voice[C]. Proc of IEEE Symposium on Security and Privacy. Oakland,2001: 202-213.
119. SIYAL.M Y, AHMED. F. A biometric-based scheme for enhancing security of cryptographic keys[C]. Proc of the 10th IEEE Region Conference.IEEE, Piscatawang NJ USA,2004:407-410.
120. JIN TAB, LING. D C L, GOH A. Personalized cryptographic key generation based on face hashing [J]. Computers&Security,2004,23(7):606-614.
121. Eiido H, Kawahara Y, Asami T. A self-encryption based private storage system over P2P distributed file sharing infrastructure[C]. First ITU-T Kaleidoscope Academic Conference. Innovations in NGN. Future Network and Services. Piscataway, NJ, USA.2008:69-76.
122. Watanabe Y, Numao M. Access control for encrypted data in P2P data sharing [J]. Transactions of the Information Processing Society of Japan,2003:4437-2443.
123.赵恒,权义宁,胡予濮.一种新的P2P数据共享解密授权方案[J].西安电子科技大学学报(自然科学版).2005,32(5)：781-785.
124.尹毅峰,薛鸿民.利用P2P的网络特性构造多态性密码[J].微计算机信息.2007,23(7)：74-75.
125. Youngho Park, Jung-Hwa Shin, Kyung-Hyune Rhee. Design of a secure digital contents delivery system in P2P networks[C]. Berlin, Germany.2006:311-321.
126. Ahmad W, Khokhar A. SAMcast-a scalable, secure and authenticated multicast protocol for large scale P2P networks[C].2007 IEEE International Conference on Communications. Piscataway, NJ, USA.2008:1478-1483.
127. Lee Ho Gyun, Nam Taek Yong, Jang Jong Soo. The method of P2P traffic detecting for P2P harmful contents prevention[C].7th International Conference on Advanced Communication Technology, ICACT 2005.2005:777-780.
128. C Batten, K Barr, A Saraf and et al. pStore:A Secure Peer-to-Peer Backup System [J]. Technical Memo MIT-LCS-TM-632, Massachusetts Institute of Technology Laborotory for Computer Science,2002.
129. M Lillibridge, S Elnikety, A Birrell and et al. A Cooperative Internet Backup Schema[C]. In USENIX 2003 Annual Technical Conference. HP System Research Center, Palo Alto, USA.2002:29-42.
130. L P Cox, B D noble. Pastiche:Making backup cheap and easy[C]. In Fifth USENIX Symposium on Operating Systems Desing and Implementation. New York, NY, USA, ACM Press.2002:285-298.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |