P2P电子商务信誉模型研究
|
摘要
随着对P2P网络技术研究的逐渐深入,P2P作为一种分布式网络技术在许多领域的得到了广泛的应用,其中也包括在电子商务领域中的应用。然而P2P网络技术存在的固有安全性问题已成为制约P2P电子商务发展的关键因素。信誉模型的研究为解决P2P电子商务中的信誉保障问题提供了一种方案。信誉模型的主要功能是完成对P2P电子商务中用户信誉度的评估,为用户之间的交易提供安全的信任关系。而目前主要地将信誉模型没有提出一套完整的信誉管理机制和信誉评估机制有机结合的信誉模型,多数信誉模型只侧重解决其中一个方面。针对上述问题,本文以P2P电子商务为研究背景,从信誉管理机制和信誉评估机制两个方面构建一种基于簇域的信誉模型。论文的主要工作包括以下几个方面:
①分析当前主要的P2P信誉模型。在学习和掌握P2P网络技术的特点和网络拓扑的基础上,分析了信任特征和信任模型结构,对已有的信誉模型进行了分类,总结了当前主要的信誉模型的优缺点,为本文构建基于簇域的P2P电子商务信誉模型奠定基础。
②针对分布式P2P电子商务系统的信誉管理机制,提出一种基于簇域的信誉管理模型。在分析现有集中式和分布式网络在信誉管理系统的优缺点后,提出了一种基于簇域的信誉管理网络拓扑结构。利用簇域子网层和索引网络层完成了P2P电子商务网络中的商品发布和搜索流程,实现电子商务的在线交易。利用拓扑结构中的信誉代理节点实现分布式信誉数据的高效存取,为信誉评估模型实现奠定基础。
③针对分布式P2P电子商务系统的信誉评估机制,提出一种基于簇域的信誉评估模型P2P-CRep。针对现有信誉评估机制中普遍存在的问题,本文的P2P-CRep信誉模型作了进一步地改进。具体改进措施包括:针对电子商务中交易的多因素性和层次性,利用模糊综合评判法对交易进行评价;直接信任度、推荐信誉和综合信誉的计算中引入了较多的影响因素;根据节点之间的评估误差和簇域相似度计算推荐节点的推荐可信度;根据平均推荐可信度和平均交易量两个因素计算置信因子,再利用置信因子法综合计算节点的信誉度;针对电子商务网络中的累积小交易信誉行骗和共谋欺诈恶意行为,在P2P-CRep信誉评估算法中引入了对这两种恶意行为的抵御机制。
④模型分析和仿真实验。通过数学分析,证明了基于簇域的信誉管理模型网络具有一定的网络动态性和扩展性,且具有较高网络路由性能。通过仿真实验,验证了P2P-CRep信誉模型能够提高电子商务网络中交易的成功率,且对共谋欺诈和累积小交易信誉行骗的恶意行为具有有效的抵御能力。
最后在总结本文工作的基础上,提出了若干有待进一步深入研究和探讨的问题。
With the development of the P2P network technology, as a distributed network technology P2P has been widely used in many fields which including e- commerce. However for the inherent security problems of the P2P network technology, it is difficult to provide e-commerce transactions security. It has become a key factor that constrains the development of e-commerce. Reputation model can address this problem by assess users’reputation and provider users a security relationship. At present, most reputation model does not formulate a complete reputation system which combines reputation management mechanism and reputation evaluation mechanism. Most reputation model focus one aspect of them. To address this issue, this paper in P2P e-commerce background proposed a P2P e-commerce reputation model based on the cluster from two aspects: reputation management mechanism and reputation evaluation mechanism. We have done the work below:
①Study and analyze existing model of the major P2P reputation. In the base of studying the characteristics of P2P network technology and network topology, we analyze the characteristics of trust, the composition of the mechanism of trust and the sort the current reputation model. Then we analyze the advantages and disadvantages of the main reputation models. So these works lays a foundation for our reputation model.
②For achieving the reputation management mechanism for distributed P2P network, we proposed a reputation management model based on cluster. In the analysis of existing centralized and distributed network management system, we set forth a reputation management network topology. In order to achieve e-commerce online transactions, we publish and search the message of goods through domain cluster subnet and index subnet. Using the agent nodes in distributed P2P network we achieve the storage and access reputation data. Also agent nodes can assist the reputation assessment in the reputation evaluation model.
③For achieving the reputation assessment mechanism based on the reputation management model, we proposed a reputation evaluation model P2P-CRep. Address the common problems of existing reputation evaluation model, we made much improvement in our P2P-CRep model. For e-commerce transactions’multiple factors and different levels, we evaluate the transaction by fuzzy comprehensive evaluation; in calculating of the direct trust, recommended reputation and comprehensive reputation, we introduce many factors; according to the assessment error and cluster similarity, we calculates the reliable the recommend; using confidence factors to calculates the comprehensive reputation; for the acts of fraud and defraud by accumulating small-scale transactions’reputation, we set some mechanism to defense malicious acts.
④The analysis and simulation experiments. Firstly we can verify the reputation management model has highly dynamic, network scalable and high performance network routing through mathematical analysis. The simulation experiment shows that our P2P-CRep can improve the successful rate of transaction and can defense the malicious of fraud act and defraud by accumulating small-scale transactions’reputation.
In the last part of dissertation, several issues for further research are given.
①分析当前主要的P2P信誉模型。在学习和掌握P2P网络技术的特点和网络拓扑的基础上,分析了信任特征和信任模型结构,对已有的信誉模型进行了分类,总结了当前主要的信誉模型的优缺点,为本文构建基于簇域的P2P电子商务信誉模型奠定基础。
②针对分布式P2P电子商务系统的信誉管理机制,提出一种基于簇域的信誉管理模型。在分析现有集中式和分布式网络在信誉管理系统的优缺点后,提出了一种基于簇域的信誉管理网络拓扑结构。利用簇域子网层和索引网络层完成了P2P电子商务网络中的商品发布和搜索流程,实现电子商务的在线交易。利用拓扑结构中的信誉代理节点实现分布式信誉数据的高效存取,为信誉评估模型实现奠定基础。
③针对分布式P2P电子商务系统的信誉评估机制,提出一种基于簇域的信誉评估模型P2P-CRep。针对现有信誉评估机制中普遍存在的问题,本文的P2P-CRep信誉模型作了进一步地改进。具体改进措施包括:针对电子商务中交易的多因素性和层次性,利用模糊综合评判法对交易进行评价;直接信任度、推荐信誉和综合信誉的计算中引入了较多的影响因素;根据节点之间的评估误差和簇域相似度计算推荐节点的推荐可信度;根据平均推荐可信度和平均交易量两个因素计算置信因子,再利用置信因子法综合计算节点的信誉度;针对电子商务网络中的累积小交易信誉行骗和共谋欺诈恶意行为,在P2P-CRep信誉评估算法中引入了对这两种恶意行为的抵御机制。
④模型分析和仿真实验。通过数学分析,证明了基于簇域的信誉管理模型网络具有一定的网络动态性和扩展性,且具有较高网络路由性能。通过仿真实验,验证了P2P-CRep信誉模型能够提高电子商务网络中交易的成功率,且对共谋欺诈和累积小交易信誉行骗的恶意行为具有有效的抵御能力。
最后在总结本文工作的基础上,提出了若干有待进一步深入研究和探讨的问题。
With the development of the P2P network technology, as a distributed network technology P2P has been widely used in many fields which including e- commerce. However for the inherent security problems of the P2P network technology, it is difficult to provide e-commerce transactions security. It has become a key factor that constrains the development of e-commerce. Reputation model can address this problem by assess users’reputation and provider users a security relationship. At present, most reputation model does not formulate a complete reputation system which combines reputation management mechanism and reputation evaluation mechanism. Most reputation model focus one aspect of them. To address this issue, this paper in P2P e-commerce background proposed a P2P e-commerce reputation model based on the cluster from two aspects: reputation management mechanism and reputation evaluation mechanism. We have done the work below:
①Study and analyze existing model of the major P2P reputation. In the base of studying the characteristics of P2P network technology and network topology, we analyze the characteristics of trust, the composition of the mechanism of trust and the sort the current reputation model. Then we analyze the advantages and disadvantages of the main reputation models. So these works lays a foundation for our reputation model.
②For achieving the reputation management mechanism for distributed P2P network, we proposed a reputation management model based on cluster. In the analysis of existing centralized and distributed network management system, we set forth a reputation management network topology. In order to achieve e-commerce online transactions, we publish and search the message of goods through domain cluster subnet and index subnet. Using the agent nodes in distributed P2P network we achieve the storage and access reputation data. Also agent nodes can assist the reputation assessment in the reputation evaluation model.
③For achieving the reputation assessment mechanism based on the reputation management model, we proposed a reputation evaluation model P2P-CRep. Address the common problems of existing reputation evaluation model, we made much improvement in our P2P-CRep model. For e-commerce transactions’multiple factors and different levels, we evaluate the transaction by fuzzy comprehensive evaluation; in calculating of the direct trust, recommended reputation and comprehensive reputation, we introduce many factors; according to the assessment error and cluster similarity, we calculates the reliable the recommend; using confidence factors to calculates the comprehensive reputation; for the acts of fraud and defraud by accumulating small-scale transactions’reputation, we set some mechanism to defense malicious acts.
④The analysis and simulation experiments. Firstly we can verify the reputation management model has highly dynamic, network scalable and high performance network routing through mathematical analysis. The simulation experiment shows that our P2P-CRep can improve the successful rate of transaction and can defense the malicious of fraud act and defraud by accumulating small-scale transactions’reputation.
In the last part of dissertation, several issues for further research are given.
引文
[1]沈鸿[美].电子商务—基础篇[M].北京:电子工业出版社,1998:1~8.
[2]沈红芳,杨道良,沈玉春.电子商务理论与实践[M].人民邮电出版社,2001:46~47.
[3]王庆波,代亚非,田敬.Peer计算技术的应用领域与典型问题讨论[J].计算机科学,2003,30(6):10-12.
[4] L.Xiong,L.Liu.PeerTrust:Supporting Reputation-Based Trust for Peer-to-Peer Communities[C]. IEEE Transactions on Knowledge and Data Engineering,2004,16(7):843~857.
[5] S.D.Kamvar,M.Schlosser,H.Garcia-Molina.The EigenTrust Algorithm for Reputation Management in P2P Networks[C]. In:Proceedings of the 12th international conference on World Wide Web.New York,USA:ACM Press,2003.640~651.
[6] Y.Teng,V.Phoha,B.Choi.Design of Trust Metrics Based on Dempster-Shafer Theory[C]. In:Proceedings of the 39th Annual ACM Southeast Conference.New York, USA:ACM Press, 2001.178~189.
[7] B.Yu,M.P.Singh.An Evidential Model of Distributed Reputation Management[C]. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems.New York,USA:ACM Press,2002.294~301.
[8] B.Yu,M.P.Singh.A Social Mechanism of Reputation Management in Electronic Communities[J]. Lecture Notes in Computer Science,2004,18(6):154~165.
[9] C.Dellarocas,P.Resnick.Online Reputation Mechanisms-A Roadmap for Future Research[C]. In:Proceedings of First Interdisciplinary Symposium on Online Reputation Mechanism.Los Alamitos,CA,USA:IEEE Press,2003.12~13.
[10] A.Abdul-Rahman,S.Hailes.Supporting Trust in Virtual Communities[C]. In:Proceedings of HICSS33. Los Alamitos,CA,USA:IEEE Press,2000.132~133.
[11] I. Stoica, R. Morris, D. Karger, et.al. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications[C]. In SIGGCOMM 2001, San Diego, California, USA, 2001.
[12] S.Ratnasamy,P.Francis,M.Handley,etal.A scalable content-addressable network[C]. In: Proceedings of the 2001 SIGCOMM Conference.New York,USA:ACM Press,2001.161~172.
[13] Antony Rowstronl,Peter Druschel.Pastry:Scalable,Decentralized object locationand routing for large-scale peer-to-peer systems[J].Lecture Notes in Computer Science,2001,22(18):329~330.
[14] Ben Y.Zhao,Ling Huang,Jeremy Stribling,et al.Tapestry:A Resilient Global-Scale Overlay for Service Deployment[C].In:Nicholas F.Maxemchuk.IEEE Journal on Selected Areas in Communications. USA:IEEE Press,2004.41~53.
[15]欧阳柏成.非结构化P2P中搜索算法的性能分析[J].计算机工程与科学,2009.6.
[16]陈刚,吴国新,杨望. G-Chord:一种基于Chord的路由改进算法[J].东南大学学报(自然科学版) , 2007,(01).
[17]陈东锋,杨寿保,彭小燕. TaChord:利用拓扑相关路由算法和超级节点的Chord系统(英文)[J]. Journal of Southeast University , 2004,(03).
[18] Debojyoti Dutta.The Design of A Distributed Rating Scheme for Peer-to-Peer Systems[J]. California:Department of Computer Science,University of Southern California,2003.
[19] I.Stoica,R.Morris,D.Karger,et al.Chord:A scalable Peer-To-Peer lookup service for Internet applications[C]. In:Proceedings of the 2001 SIGCOMM Conference.New York,USA:ACM Press, 2001.149~160.
[20] L.Kagal,T.Finin,A.Joshi.Trust-based Security in Pervasive Computing Environments[J]. IEEE Computers,2001,34(12):154~157.
[21] Ali Aydin Selcuk,Ersin Uzun,Mark Resat Pariente.A Reputation-Based Trust Management System for P2P Networks[C]. In:IEEE International Symposium on Cluster Computing and the Grid.New York:IEEE Press,2004.251~258.
[22] Sergio Marti,Hector Garcia Molina.Limited Reputation Sharing in P2P Systems[C].In: Proceedings of the 5th ACM conference on Electronic commerce. New York:ACM Press, 2004:17~20.
[23] G..Zacharia,A.Moukas,P.Maes.Collaborative reputation mechanisms in electronic marketplaces[C]. In:Proceedings of HICSS32.Los Alamitos, CA,USA: IEEE Computer Society, 1999:300~301.
[24] P.Kollock.The production of trust in online market. Advances in Group Processes[J], 1999,16(3):19~25.
[25] C.Dellarocas.Analyzing the economic efficiency of eBay-like online reputation reporting mechanisms[C]. In:Proceedings of the 3rd ACM conference on Electronic Commerce.New York, USA:ACM Press,2001:171~179.
[26] Y.Teng,V.Phoha,B.Choi.Design of Trust Metrics Based on Dempster-Shafer Theory[C]. In: Proceedings of the 39th Annual ACM Southeast Conference.New York, USA:ACM Press, 2001:178~189.
[27] B.Yu,M.P.Singh.An Evidential Model of Distributed Reputation Management[C]. In:Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems. New York,USA:ACM Press,2002:294~301.
[28] J.Park,R.Sandhu,G.Ahn.Role-Based Access Control on the Web.ACM Transactions on Information and Systems Security[J],2001,4(1):37~71.
[29] Milojincic,D.S.,Kalogeraki,et al. Peer-to-Peer Computing.Internal Report[EB/OL]. http://www.hpl.hp.com/techreports/2002/HPL-2002-57.html,2002.
[30] Andersen D,Balakrishnan H,Kaashoek F,et al.Resilient Overlay Networks[J]. ACM SIGOPS Operating Systems Review,2001,35(5):131-145.
[31] Yang B, Gareia-Molina H. Improving search in peer-to-peer networks[C]. In: rodrigues LET, Raynal M, Chen WSE, eds. Proceedings of the 22nd IEEE International Conference on Distributed Computing. Washington: IEEE Computer Society Press, 200:5-14.
[32] Lv Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks[C]. In:Ebcioglu K, Pingali K, Nicolau A, eds. Proceedings of the 16th ACM International Conference on Supercomputing (ACM ICS’02). New York:ACM Press, 2002:84-95.
[33] V, Kalogeraki, D. Gunopulos, D. Zeinalipour-yazti. A local serach mechanism for peer-to-peer networks[C]. In: McLean VA, eds. Proceedings of the 11th ACM Conference on Information and Knowledge Management (ACM CIKM’02). New York: ACM Press, 2002:300-307.
[34] Crespo A, Garcia-Molina H. Routing indices for peer-to-peer systems[C]. In:Sivilotti P, eds. Proceedings of the 22nd International Conference on Distributed Computing (IEEE ICDCS’02). Arizona: IEEE Computer Society Press, 2002:23-32.
[35] KaZaA,http://www.kazaa.com/[EB/OL].2005.
[36]杜小勇,李曼,王大治.语义Web与本体研究综述[J].计算机应用,2004,24(10):14~16.
[37] T.Berners-Lee,J.Handler and L.Ora.The semantic web[J]. ScientificAmerican,2001,284 (5):34~43.
[38]吴红亚.基于群体的P2P电子商务信任模型的研究[D].华东师范大学硕士学位论文, 2007.
[39]朱海. P2P网下一种基于群组的信任模型[D].西安电子科技大学硕士学位论文,2007,1.
[40]袁巍,李津生,洪佩琳.一种P2P网络分布式信任模型及仿真[J].系统仿真学报,2006,18(4):938~942.
[41] Aberer K,Despotovic Z.Managing trust in a peer-2-peer information system[C].In:Proceedings of the tenth international conference on Information and knowledge management (CIKM'01). New York:ACM Press,2001:310-317.
[42]窦文,王怀民,贾焰等.构造基于推荐的Peer-to-Peer环境下的Trust模型[J].软件学报, 2004,15(4):571-583.
[43]唐文,陈钟.基于模糊集合理论的主观信任管理模型研究[J].软件学报, 2003, 14(8):1401-1408.
[44] Farag Azzedin,Muthucumaru Maheswaran. Towards Turst-Aware Resource Management inGrid Computing Systems[C]. Proceedings of the 20d IEEEIACM International Symposium on Cluster Computing and the Grid,2002.
[45] Aberer K,Despotovic Z.Managing trust in a peer-2-peer information system[C]. In:Proceedings of the tenth international conference on Information and knowledge management(CIKM'01).New York:ACM Press,2001:310-317.
[46] Kamvar SD,Schlosser MT.EigenRep:Reputation management in P2Pnetworks[C]. In:Proc of the 12th International World Wide Web Conference.Budapest,2003:123-134.
[47] Z.Despotovic,K.Aberer.Maximum Likelihood Estimation of Peers'Performance in P2P Networks[C]. In:Proceedings of the Second Workshop onthe Economics of Peer-to-Peer Systems,Harvard University,Cambridge,2004:1~9.
[48] Song SS,Hwang K.Fuzzy trust integration for security enforcement in grid computing[C]. In:Proc. of the International Symposium on Network and Parallel Computing(NPC 2004).LNCS 3222,Berlin: Springer-Verlag, 2005:9-21.
[49] Resnick P,Zeckhauser R. Trust among strangers in Internet transactions:empirical analysis of eBay’s reputation system[J]. Proceedings of the Economics of the Internet and E-Commerce, Advanced in Applied Microeconomics, Amsterdam,2002:127-157.
[50] Jameel H,Hung LX,Kalim U,Asjjad A,Lee SY,Lee YK.A trust model for ubiquitous systems based on vectors of trust values[C].In:Proc. of the 7th IEEE International Symposium on Multimedia.Washington:IEEE Computer Society Press,2005:674-679.
[51] Sun Y,Yu W,Han Z,Liu KJR.Trust modeling and evaluation in adhoc networks[C].In:Proc.of the Global Telecommunications Conf.,Globecom 2005.Washington:IEEE Computer Society Press, 2005:1-10.
[52] He R,Niu JW,Zhang GW.CBTM:A trust model with uncertainty quantification and reasoning for pervasive computing[J].LNCS3758.Berlin:Springer-Verlag,2005:541-552.
[53] Melaye D,Demazeau Y.Bayesian dynamic trust model[J].LNCS 3690. Berlin:Springer-Verlag, 2005:480-489.
[54]韩存,张玉忠.企业绩效评价方法取向研究[J].财会通讯,2005:3~7.
[55] L.A.Zadeh, Fuzzy sets, Information and Control[J]. 1965(8):338-353.
[56] B.A.Huberman F.Wu.The Dynamics of Reputations.Journal of Statistical Mechanics[J].Theory and Experiment,2004,(4):1~17.
[57] Huberman BA,Wu F.The dynamics of reputations.Journal of Statistical Mechanics[J].Theory and Experiment,2004,4:1-17.
[58] Zhao B.,Kubiatowicz J.,Jo sep h A..Tapestry:An infrastructure for faulttolerant wide-area location and routing[J].UC Berkeley:Technical Report UCB/CSD 20101141,2001.
[59] Cast ro M.,Druschel P.,Hu Y.,Rowst ron A..Exploiting network proximit y in distributed hash tables[C].In:Proceedings of the FuDiCo 2002,Bertinoro,Italy,2002:52～55.
[60] Stoica I.,Morris R.,Karger D.,Kaashoek M.,Balakrishnan H..Chord:A scalable Peer-to-Peer lookup service for internet applications[C].In:Proceedings of the SI GCOMM 2001,San Deigo,CA, USA,2001:149～160.
[61] Rat nasamy S.,Francis P.,Handley M.,Karp R..A scalable content-addressable network[C]. In:Proceedings of t he SIG-COMM 2001,San Diego,CA,U SA,2001:161～172.
[62] Schollmeier Rudiger.Why P2P(Peer-to-Peer) does scale:Analysis of P2P traffic patterns[C]. In:Proceeding of the IEEE P2P Computing Conference,Link ping, Sweden,2002:112～119.
[63] http://p2p.stanford.edu/www/demos.htm.2007[EB/OL].
[64] Jameel H,Hung LX,Kalim U,Asjjad A,Lee SY,Lee YK.A trust model for ubiquitous systems based on vectors of trust values[C].In:Proc.of the 7th International Symposium on Multimedia.Washington:IEEE Computer Society Press,2005:674-679.
[65] Saroiu S.,Gummadi P.K.,Gribble S.D..A measurement study of Peer-to- Peer file sharing systems[C].In:Proceedings of the Multimedia Computing and Networking Conference,San Jose,California,USA,2002.
[2]沈红芳,杨道良,沈玉春.电子商务理论与实践[M].人民邮电出版社,2001:46~47.
[3]王庆波,代亚非,田敬.Peer计算技术的应用领域与典型问题讨论[J].计算机科学,2003,30(6):10-12.
[4] L.Xiong,L.Liu.PeerTrust:Supporting Reputation-Based Trust for Peer-to-Peer Communities[C]. IEEE Transactions on Knowledge and Data Engineering,2004,16(7):843~857.
[5] S.D.Kamvar,M.Schlosser,H.Garcia-Molina.The EigenTrust Algorithm for Reputation Management in P2P Networks[C]. In:Proceedings of the 12th international conference on World Wide Web.New York,USA:ACM Press,2003.640~651.
[6] Y.Teng,V.Phoha,B.Choi.Design of Trust Metrics Based on Dempster-Shafer Theory[C]. In:Proceedings of the 39th Annual ACM Southeast Conference.New York, USA:ACM Press, 2001.178~189.
[7] B.Yu,M.P.Singh.An Evidential Model of Distributed Reputation Management[C]. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems.New York,USA:ACM Press,2002.294~301.
[8] B.Yu,M.P.Singh.A Social Mechanism of Reputation Management in Electronic Communities[J]. Lecture Notes in Computer Science,2004,18(6):154~165.
[9] C.Dellarocas,P.Resnick.Online Reputation Mechanisms-A Roadmap for Future Research[C]. In:Proceedings of First Interdisciplinary Symposium on Online Reputation Mechanism.Los Alamitos,CA,USA:IEEE Press,2003.12~13.
[10] A.Abdul-Rahman,S.Hailes.Supporting Trust in Virtual Communities[C]. In:Proceedings of HICSS33. Los Alamitos,CA,USA:IEEE Press,2000.132~133.
[11] I. Stoica, R. Morris, D. Karger, et.al. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications[C]. In SIGGCOMM 2001, San Diego, California, USA, 2001.
[12] S.Ratnasamy,P.Francis,M.Handley,etal.A scalable content-addressable network[C]. In: Proceedings of the 2001 SIGCOMM Conference.New York,USA:ACM Press,2001.161~172.
[13] Antony Rowstronl,Peter Druschel.Pastry:Scalable,Decentralized object locationand routing for large-scale peer-to-peer systems[J].Lecture Notes in Computer Science,2001,22(18):329~330.
[14] Ben Y.Zhao,Ling Huang,Jeremy Stribling,et al.Tapestry:A Resilient Global-Scale Overlay for Service Deployment[C].In:Nicholas F.Maxemchuk.IEEE Journal on Selected Areas in Communications. USA:IEEE Press,2004.41~53.
[15]欧阳柏成.非结构化P2P中搜索算法的性能分析[J].计算机工程与科学,2009.6.
[16]陈刚,吴国新,杨望. G-Chord:一种基于Chord的路由改进算法[J].东南大学学报(自然科学版) , 2007,(01).
[17]陈东锋,杨寿保,彭小燕. TaChord:利用拓扑相关路由算法和超级节点的Chord系统(英文)[J]. Journal of Southeast University , 2004,(03).
[18] Debojyoti Dutta.The Design of A Distributed Rating Scheme for Peer-to-Peer Systems[J]. California:Department of Computer Science,University of Southern California,2003.
[19] I.Stoica,R.Morris,D.Karger,et al.Chord:A scalable Peer-To-Peer lookup service for Internet applications[C]. In:Proceedings of the 2001 SIGCOMM Conference.New York,USA:ACM Press, 2001.149~160.
[20] L.Kagal,T.Finin,A.Joshi.Trust-based Security in Pervasive Computing Environments[J]. IEEE Computers,2001,34(12):154~157.
[21] Ali Aydin Selcuk,Ersin Uzun,Mark Resat Pariente.A Reputation-Based Trust Management System for P2P Networks[C]. In:IEEE International Symposium on Cluster Computing and the Grid.New York:IEEE Press,2004.251~258.
[22] Sergio Marti,Hector Garcia Molina.Limited Reputation Sharing in P2P Systems[C].In: Proceedings of the 5th ACM conference on Electronic commerce. New York:ACM Press, 2004:17~20.
[23] G..Zacharia,A.Moukas,P.Maes.Collaborative reputation mechanisms in electronic marketplaces[C]. In:Proceedings of HICSS32.Los Alamitos, CA,USA: IEEE Computer Society, 1999:300~301.
[24] P.Kollock.The production of trust in online market. Advances in Group Processes[J], 1999,16(3):19~25.
[25] C.Dellarocas.Analyzing the economic efficiency of eBay-like online reputation reporting mechanisms[C]. In:Proceedings of the 3rd ACM conference on Electronic Commerce.New York, USA:ACM Press,2001:171~179.
[26] Y.Teng,V.Phoha,B.Choi.Design of Trust Metrics Based on Dempster-Shafer Theory[C]. In: Proceedings of the 39th Annual ACM Southeast Conference.New York, USA:ACM Press, 2001:178~189.
[27] B.Yu,M.P.Singh.An Evidential Model of Distributed Reputation Management[C]. In:Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems. New York,USA:ACM Press,2002:294~301.
[28] J.Park,R.Sandhu,G.Ahn.Role-Based Access Control on the Web.ACM Transactions on Information and Systems Security[J],2001,4(1):37~71.
[29] Milojincic,D.S.,Kalogeraki,et al. Peer-to-Peer Computing.Internal Report[EB/OL]. http://www.hpl.hp.com/techreports/2002/HPL-2002-57.html,2002.
[30] Andersen D,Balakrishnan H,Kaashoek F,et al.Resilient Overlay Networks[J]. ACM SIGOPS Operating Systems Review,2001,35(5):131-145.
[31] Yang B, Gareia-Molina H. Improving search in peer-to-peer networks[C]. In: rodrigues LET, Raynal M, Chen WSE, eds. Proceedings of the 22nd IEEE International Conference on Distributed Computing. Washington: IEEE Computer Society Press, 200:5-14.
[32] Lv Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks[C]. In:Ebcioglu K, Pingali K, Nicolau A, eds. Proceedings of the 16th ACM International Conference on Supercomputing (ACM ICS’02). New York:ACM Press, 2002:84-95.
[33] V, Kalogeraki, D. Gunopulos, D. Zeinalipour-yazti. A local serach mechanism for peer-to-peer networks[C]. In: McLean VA, eds. Proceedings of the 11th ACM Conference on Information and Knowledge Management (ACM CIKM’02). New York: ACM Press, 2002:300-307.
[34] Crespo A, Garcia-Molina H. Routing indices for peer-to-peer systems[C]. In:Sivilotti P, eds. Proceedings of the 22nd International Conference on Distributed Computing (IEEE ICDCS’02). Arizona: IEEE Computer Society Press, 2002:23-32.
[35] KaZaA,http://www.kazaa.com/[EB/OL].2005.
[36]杜小勇,李曼,王大治.语义Web与本体研究综述[J].计算机应用,2004,24(10):14~16.
[37] T.Berners-Lee,J.Handler and L.Ora.The semantic web[J]. ScientificAmerican,2001,284 (5):34~43.
[38]吴红亚.基于群体的P2P电子商务信任模型的研究[D].华东师范大学硕士学位论文, 2007.
[39]朱海. P2P网下一种基于群组的信任模型[D].西安电子科技大学硕士学位论文,2007,1.
[40]袁巍,李津生,洪佩琳.一种P2P网络分布式信任模型及仿真[J].系统仿真学报,2006,18(4):938~942.
[41] Aberer K,Despotovic Z.Managing trust in a peer-2-peer information system[C].In:Proceedings of the tenth international conference on Information and knowledge management (CIKM'01). New York:ACM Press,2001:310-317.
[42]窦文,王怀民,贾焰等.构造基于推荐的Peer-to-Peer环境下的Trust模型[J].软件学报, 2004,15(4):571-583.
[43]唐文,陈钟.基于模糊集合理论的主观信任管理模型研究[J].软件学报, 2003, 14(8):1401-1408.
[44] Farag Azzedin,Muthucumaru Maheswaran. Towards Turst-Aware Resource Management inGrid Computing Systems[C]. Proceedings of the 20d IEEEIACM International Symposium on Cluster Computing and the Grid,2002.
[45] Aberer K,Despotovic Z.Managing trust in a peer-2-peer information system[C]. In:Proceedings of the tenth international conference on Information and knowledge management(CIKM'01).New York:ACM Press,2001:310-317.
[46] Kamvar SD,Schlosser MT.EigenRep:Reputation management in P2Pnetworks[C]. In:Proc of the 12th International World Wide Web Conference.Budapest,2003:123-134.
[47] Z.Despotovic,K.Aberer.Maximum Likelihood Estimation of Peers'Performance in P2P Networks[C]. In:Proceedings of the Second Workshop onthe Economics of Peer-to-Peer Systems,Harvard University,Cambridge,2004:1~9.
[48] Song SS,Hwang K.Fuzzy trust integration for security enforcement in grid computing[C]. In:Proc. of the International Symposium on Network and Parallel Computing(NPC 2004).LNCS 3222,Berlin: Springer-Verlag, 2005:9-21.
[49] Resnick P,Zeckhauser R. Trust among strangers in Internet transactions:empirical analysis of eBay’s reputation system[J]. Proceedings of the Economics of the Internet and E-Commerce, Advanced in Applied Microeconomics, Amsterdam,2002:127-157.
[50] Jameel H,Hung LX,Kalim U,Asjjad A,Lee SY,Lee YK.A trust model for ubiquitous systems based on vectors of trust values[C].In:Proc. of the 7th IEEE International Symposium on Multimedia.Washington:IEEE Computer Society Press,2005:674-679.
[51] Sun Y,Yu W,Han Z,Liu KJR.Trust modeling and evaluation in adhoc networks[C].In:Proc.of the Global Telecommunications Conf.,Globecom 2005.Washington:IEEE Computer Society Press, 2005:1-10.
[52] He R,Niu JW,Zhang GW.CBTM:A trust model with uncertainty quantification and reasoning for pervasive computing[J].LNCS3758.Berlin:Springer-Verlag,2005:541-552.
[53] Melaye D,Demazeau Y.Bayesian dynamic trust model[J].LNCS 3690. Berlin:Springer-Verlag, 2005:480-489.
[54]韩存,张玉忠.企业绩效评价方法取向研究[J].财会通讯,2005:3~7.
[55] L.A.Zadeh, Fuzzy sets, Information and Control[J]. 1965(8):338-353.
[56] B.A.Huberman F.Wu.The Dynamics of Reputations.Journal of Statistical Mechanics[J].Theory and Experiment,2004,(4):1~17.
[57] Huberman BA,Wu F.The dynamics of reputations.Journal of Statistical Mechanics[J].Theory and Experiment,2004,4:1-17.
[58] Zhao B.,Kubiatowicz J.,Jo sep h A..Tapestry:An infrastructure for faulttolerant wide-area location and routing[J].UC Berkeley:Technical Report UCB/CSD 20101141,2001.
[59] Cast ro M.,Druschel P.,Hu Y.,Rowst ron A..Exploiting network proximit y in distributed hash tables[C].In:Proceedings of the FuDiCo 2002,Bertinoro,Italy,2002:52～55.
[60] Stoica I.,Morris R.,Karger D.,Kaashoek M.,Balakrishnan H..Chord:A scalable Peer-to-Peer lookup service for internet applications[C].In:Proceedings of the SI GCOMM 2001,San Deigo,CA, USA,2001:149～160.
[61] Rat nasamy S.,Francis P.,Handley M.,Karp R..A scalable content-addressable network[C]. In:Proceedings of t he SIG-COMM 2001,San Diego,CA,U SA,2001:161～172.
[62] Schollmeier Rudiger.Why P2P(Peer-to-Peer) does scale:Analysis of P2P traffic patterns[C]. In:Proceeding of the IEEE P2P Computing Conference,Link ping, Sweden,2002:112～119.
[63] http://p2p.stanford.edu/www/demos.htm.2007[EB/OL].
[64] Jameel H,Hung LX,Kalim U,Asjjad A,Lee SY,Lee YK.A trust model for ubiquitous systems based on vectors of trust values[C].In:Proc.of the 7th International Symposium on Multimedia.Washington:IEEE Computer Society Press,2005:674-679.
[65] Saroiu S.,Gummadi P.K.,Gribble S.D..A measurement study of Peer-to- Peer file sharing systems[C].In:Proceedings of the Multimedia Computing and Networking Conference,San Jose,California,USA,2002.