P2P环境下的信誉评价
|
摘要
正确对P2P中的节点信誉进行评价,可以及时隔离恶意节点,保证其它节点的安全,提高P2P系统服务的质量和效率。
针对节点信誉评价向量缺乏准确计算方法的问题,提出并证明了在均值邻域附近可以用正态分布对Beta分布进行近似计算的理论,并以此为基础从概率论的角度提出了节点信誉度向量的计算公式,该公式可以简化节点信誉向量的计算复杂度。针对中心式P2P信誉评价体系容易受到协同作弊干扰的问题,提出了根据节点在系统中的表现计算节点间相似度的计算公式,以此为基础实现了对节点的聚类,因为诚实节点行为具有一致性,所以诚实节点会聚类为最大的一个节点集合,作弊节点根据作弊方式不同会聚类为若干个小的节点集合,最后整个系统信誉评价结果将以最大节点集合的观点为主,因此消除了协同作弊节点对系统信誉评价结果的干扰。针对聚类速度较慢的问题提出了先分组计算,再进行信誉度合并的算法。实验表明上述算法对节点协同作弊有较好的抵御效果。
以传统De Bruijn图为架构的P2P系统可以保证网络具有较小的半径,但是节点加入、离开算法过于复杂,容易出现节点负载不均衡的现象。为此本文提出了De Bruijn路由图和冗余De Bruijn路由图的架构,并在此基础上实现了节点的加入、离开、路由算法。理论分析和实验表明该路由架构既保留了传统De Bruijn图的优点,又简化了节点的加入、离开操作,同时使分配在每个节点上的负载较平均。
以冗余De Bruijn路由图为基础,提出了分布式P2P架构下的信誉评价体系:每个节点保留多条冗余路由,进行信誉查询的时候优先选择可信任路由节点构建信誉查询路径,并使用查询反馈结果对路由记录进行更新,随着查询次数的增加,节点不断更新路由表中各备选路由的可信度,查询准确度也随之提高。实验表明该算法具有较好的可扩展性和查询准确度,适合大规模网络环境下使用,同时以此为基础可以实现资源的可靠查找。
It is necessary to evaluate the peer’s reputation efficiently and correctly in order to isolate malicious peers, protect the safety of other peers and improve the service quality and efficiency.
A new theory that the beta distribution can be calculated approximately by the normal distribution by the average value area is proofed, a new method which can calculated the reputation vector of peers precisely is proposed based on this theory. To eliminate the calculation error caused by malicious collectives, a reputation evaluation method based on aggregation is proposed. The similarity among peers is calculated according to the reputation their give to the common neighbors and the reputation evaluation value they received from the common neighbors and the reputation they give to each other. Usually all the honest peers can be aggregated to one large group because of their action similarity, while the malicious peers will be aggregated to several small groups because of their different cheating methods. The evaluation result will base on the largest group, by this mean the affection of malicious peers is minimized. To improving the calculation efficiency .All the peers is divided into several groups and calculated respectively, then the reputation is calculated by merge these calculation result. Experiments show that this method can isolate the malicious collectives efficiently.
The P2P structure based on traditional de bruijn graph has both less edges and shorter network diameter, while its main shortcoming is that it’s too complex to process the insert and leaving of peers, and it also often lead to unevenly distribution of resource among peers. For this reason the routing de bruijn graph and redundant de bruijn routing graph and a new leaving and insert algorithm of peers were proposed. Theoretic analysis and experimental results show that the redundant de bruijn routing graph can simplify the insert and leave operations, and it also can distribute the load among peers evenly.
A distributed reputation evaluation method was proposed based on redundant de bruijn routing graph: every peer has redundant routing peers and the peers with higher credit will be selected priorily. The credit of the routing peers is updated by the feedback of the reputation query , so the query accuracy will also improve with the processing of query. Experiments show that the algorithm is suitable for large-scale use of the network environment, and on the base of reliable routing table a robust resouce locating method can be constructed.
针对节点信誉评价向量缺乏准确计算方法的问题,提出并证明了在均值邻域附近可以用正态分布对Beta分布进行近似计算的理论,并以此为基础从概率论的角度提出了节点信誉度向量的计算公式,该公式可以简化节点信誉向量的计算复杂度。针对中心式P2P信誉评价体系容易受到协同作弊干扰的问题,提出了根据节点在系统中的表现计算节点间相似度的计算公式,以此为基础实现了对节点的聚类,因为诚实节点行为具有一致性,所以诚实节点会聚类为最大的一个节点集合,作弊节点根据作弊方式不同会聚类为若干个小的节点集合,最后整个系统信誉评价结果将以最大节点集合的观点为主,因此消除了协同作弊节点对系统信誉评价结果的干扰。针对聚类速度较慢的问题提出了先分组计算,再进行信誉度合并的算法。实验表明上述算法对节点协同作弊有较好的抵御效果。
以传统De Bruijn图为架构的P2P系统可以保证网络具有较小的半径,但是节点加入、离开算法过于复杂,容易出现节点负载不均衡的现象。为此本文提出了De Bruijn路由图和冗余De Bruijn路由图的架构,并在此基础上实现了节点的加入、离开、路由算法。理论分析和实验表明该路由架构既保留了传统De Bruijn图的优点,又简化了节点的加入、离开操作,同时使分配在每个节点上的负载较平均。
以冗余De Bruijn路由图为基础,提出了分布式P2P架构下的信誉评价体系:每个节点保留多条冗余路由,进行信誉查询的时候优先选择可信任路由节点构建信誉查询路径,并使用查询反馈结果对路由记录进行更新,随着查询次数的增加,节点不断更新路由表中各备选路由的可信度,查询准确度也随之提高。实验表明该算法具有较好的可扩展性和查询准确度,适合大规模网络环境下使用,同时以此为基础可以实现资源的可靠查找。
It is necessary to evaluate the peer’s reputation efficiently and correctly in order to isolate malicious peers, protect the safety of other peers and improve the service quality and efficiency.
A new theory that the beta distribution can be calculated approximately by the normal distribution by the average value area is proofed, a new method which can calculated the reputation vector of peers precisely is proposed based on this theory. To eliminate the calculation error caused by malicious collectives, a reputation evaluation method based on aggregation is proposed. The similarity among peers is calculated according to the reputation their give to the common neighbors and the reputation evaluation value they received from the common neighbors and the reputation they give to each other. Usually all the honest peers can be aggregated to one large group because of their action similarity, while the malicious peers will be aggregated to several small groups because of their different cheating methods. The evaluation result will base on the largest group, by this mean the affection of malicious peers is minimized. To improving the calculation efficiency .All the peers is divided into several groups and calculated respectively, then the reputation is calculated by merge these calculation result. Experiments show that this method can isolate the malicious collectives efficiently.
The P2P structure based on traditional de bruijn graph has both less edges and shorter network diameter, while its main shortcoming is that it’s too complex to process the insert and leaving of peers, and it also often lead to unevenly distribution of resource among peers. For this reason the routing de bruijn graph and redundant de bruijn routing graph and a new leaving and insert algorithm of peers were proposed. Theoretic analysis and experimental results show that the redundant de bruijn routing graph can simplify the insert and leave operations, and it also can distribute the load among peers evenly.
A distributed reputation evaluation method was proposed based on redundant de bruijn routing graph: every peer has redundant routing peers and the peers with higher credit will be selected priorily. The credit of the routing peers is updated by the feedback of the reputation query , so the query accuracy will also improve with the processing of query. Experiments show that the algorithm is suitable for large-scale use of the network environment, and on the base of reliable routing table a robust resouce locating method can be constructed.
引文
[1]罗杰文,Peer to Peer ( P2P )综述,2005,http://docs.huihoo.com/p2p/1/index.html
[2] D. S. Milojicic, Kalogeraki V., Lukose R.,Peer-to-Peer Computing,2002
[3] Oram,Peer-to-Peer: Harnessing the power of disruptive technologies,O'Reilly & Associates, Inc. Sebastopol, CA, USA,2001
[4] Compute with BOINC ,2008,http://boinc.berkeley.edu/
[5] 2007年中国P2P流媒体研究报告, 2007 ,http://www.old.iresearch.com.cn/Online_Movie/detail_free.asp?id=44752.
[6] MT Schlosser, Condie TE,Kamvar SD,Simulating a P2P File-Sharing Network,Proceedings of SemPGRID,Budapest:2003,69-80
[7] N. Inc,The napster homepage,2000,http://www.napster.com
[8] M. Ripeanu,Peer-to-Peer Architecture Case Study: Gnutella Network,Proceedings of the First International Conference on Peer-to-Peer Computing,Sweden: IEEE Computer Press,2001
[9] S. B. Handurukande, Kermarrec A. M., Le Fessant F.,Peer sharing behaviour in the eDonkey network, and implications for the design of server-less file sharing systems,Proceedings of the 2006 EuroSys conference,Leuven, Belgium:ACM Press New York, NY, USA,2006,359-371
[10] Y. Kulbak ,Bickson D., The eMule Protocol Specification,Technical report TR-2005-03, the Hebrew University of Jerusalem
[11] B. Cohen,Incentives Build Robustness in BitTorrent,Workshop on Economics of Peer-to-Peer Systems,Berkeley, CA, USA,2003,
[12] Lei Guo, Chen Songqing, Xiao Zhen , A Performance Study of BitTorrent-like Peer-to-Peer Systems, IEEE Journal On Selected Areas In Communications,2007,25(1):1-15
[13] Bitcomet,2003,http://www.bitcomet.com/
[14]迅雷在线,2006,http://www.xunlei.com
[15] Souptik Datta, Bhaduri Kanishka, Giannella Chris , Distributed Data Mining in Peer-to-Peer Networks,IEEE Internet Computing,2006,:18-26
[16] Grimshaw, Avaki data grid-Secure transparent access to data.
[17] Popular Power,2000,http://en.wikipedia.org/wiki/Popular_Power
[18] D. P. Anderson, Cobb J., Korpela E.,SETI@ home: an experiment in public-resource computing,Communications of the ACM,New York:ACM New York, NY, USA,2002,56-61
[19] L. Gong,Project JXTA: A Technology Overview,Internet Computing ,2001,5(3):88-95
[20] Microsoft Coperation , Microsoft Office Groove , 2007 ,http://office.microsoft.com/zh-cn/groove/FX100487642052.aspx
[21] Microsoft Corporation,NET My Services Specification,2006
[22] Icq community,2008,http://www.icq.com/
[23] Yahoo,Messenger - Chat, Instant message, SMS, PC Calls and More,2006,http://messenger.yahoo.com/
[24] Microsoft,msn,2008,http://www.msn.com/
[25] S. Androutsellis-Theotokis ,Spinellis D.,A survey of peer-to-peer content distribution technologies,ACM Computing Surveys ,2004,36(4):335-371
[26] Gnutella,2008,http://en.wikipedia.org/wiki/Gnutella
[27] Vana Kalogeraki, Gunopulos Dimitrios,Zeinalipour-Yazti D.,A local search mechanism for peer-to-peer networks,Proceedings of the eleventh international conference on Information and knowledge management ,Virginia, USA:ACM New York, NY, USA,2002,300-307
[28] Hyojin Park, Yang Jinhong, Park Juyoung,A Survey on Peer-to-Peer Overlay Network Schemes,Advanced Communication Technology, 2008. ICACT 2008,2008,986-988
[29] Stoica, Morris R., Karger D.,Chord: A scalable peer-to-peer lookup service for internet applications,Proceedings of the 2001 SIGCOMM conference,ACM New York, NY, USA,2001,149-160
[30] Antony Rowstron ,Druschel Peter,Pastry: Scalable, distributed object location and rrouting for large-scale peer-to-peer systems , Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms,Heidelberg:ACM,2001,161-172
[31] P. Fraigniaud ,Gauron P.,The content-addressable network D2B,Tech Rept.1349:2003,
[32] Sylvia Paul Ratnsamy, A scalable content-addressable network. 2002, University of California at Berkeley.
[33] B. Y. Zhao, Kubiatowicz J.,Joseph A. D.,Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,University of California at Berkeley, Berkeley:2001,
[34] The Secure Hash Algorithm Directory , 2001 ,http://www.secure-hash-algorithm-md5-sha-1.co.uk/
[35] W.G.Bridges ,S.Toueg , On the impossibility of directed moore graphs ,J.Combinator.Theory,1980,29(3):339-342
[36] Dmitri Loguinov, Casas Juan,Wang Xiaoming,Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience,ACM Transactions OnNetworking,2005,13(5):1107-1120
[37] N. Lynch, Malkhi D.,Ratajczak D.,Atomic data access in distributed hash tables,Proceedings of the International Peer-to-Peer Symposium,2002,295-305
[38] W. Nejdl, Wolpers M., Siberski W.,Super-peer-based routing strategies for RDF-based peer-to-peer networks,Web Semantics: Science, Services and Agents on the World Wide Web,2004,1(2):177-186
[39] J. Liang, Kumar R.,Ross K. W.,The KaZaA Overlay: A Measurement Study,Computer Networks Journal,2005,49(6):1-25
[40] Heather Yu, Buford John,Merabti Madjid,Improving Messaging Security in Structured P2P Overlay Networks,Multimedia and Expo, 2007 IEEE International Conference ,Beijing:2007,408-411
[41] Z. Despotovic ,Aberer K.,P2P reputation management: Probabilistic estimation vs. social networks,2006,50(4):485-500
[42] Audun J?sang,Trust-based decision making for electronic transactions,Proceedings of the Fourth NordicWorkshop on Secure Computer Systems,Sweden:Stockholm University,1999
[43] Xiaoqi Li, Lyu,Liu Jiangchuan,A trust model based routing protocol for secure ad hoc networks,A trust model based routing protocol for secure ad hoc networks,2004,1286- 1295
[44] D. Hales,From selfish nodes to cooperative networks-emergent link-based incentives in peer-to-peer networks, Peer-to-Peer Computing, 2004. Proceedings,2004,151-158
[45] M. Fischmann , Modelling reputation-based resource pooling in P2P systems ,Proceedings of the 1st international conference on Scalable information systems ,Hong Kong:ACM Press New York, NY, USA,2006
[46] Sinjae Lee, Zhu Shaojian,Kim Yanggon,P2P Trust Model: The Resource Chain Model,Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing,2007,357-362
[47] F. Cornelli, Damiani E., Paraboschi S.,Choosing Reputable Servents in a P2P Network,International World Wide Web Conference ,Hawaii:ACM,2002,376 - 386
[48] Daniel W Manchala, Trust metrics, models and protocols for electronic commerce transactions, in Distributed Computing Systems. 1998: Amsterdam, Netherlands.
[49] K. Wongrujira, Hsin-ting T.,Seneviratne A.,Avoidance routing to misbebaving nodes in P2P by using reputation and variance,Advanced Communication Technology,Krea:2004,1035- 1039
[50] S. Buchegger ,Le Boudee J. Y.,Self-policing mobile ad hoc networks by reputation systems,Communications Magazine,2005,43(7):101-107
[51] P. Dewan, Dasgupta P.,Bhattacharya A.,On using reputations in ad hoc networks to counter malicious nodes,Parallel and Distributed Systems,2004,665-672
[52] Yao Wang ,Vassileva Julita,Trust and reputation model in peer-to-peer networks,Peer-to-Peer Computing,2003,150-157
[53] Jerald Hughes, Lang Karl R.,Vragov Roumen,An analytical framework for evaluating peer-to-peer business models,Electronic Commerce Research and Applications,2008,7(1):105-118
[54] Stephanos Androutsellis-Theotokis, Spinellis Diomidis,Karakoidas Vassilios ,Performing peer-to-peer e-business transactions: A requirements analysis and preliminary design proposal, Proceedings of the IADIS eCommerce 2004 conference,2004,399-404
[55] E. Courses ,Surveys T.,The" Value" of Reputation in Peer-to-Peer Networks,Consumer Communications and Networking Conference,Las Vegas:2008,516-520
[56] Yamamoto, Asahara D., Itao T.,Distributed pagerank: a distributed reputation model for open peer-to-peer network,Applications and the Internet Workshops, 2004,Tokyo, Japan:2004,389-394
[57] L. Mui, Mohtashemi M.,Halberstadt A. , A Computational Model of Trust and Reputation for E-businesses,Proceedings of the 35th Annual Hawaii International Conference on System Sciences ,IEEE Computer Society Washington, DC, USA,2002,188-196
[58] S. Song, Hwang K., Zhou R. , Trusted P2P transactions with fuzzy reputation aggregation,Proceedings of the 13th international workshop on Network ,2005,24-34
[59] Jochen Mundinger ,Boudecy Jean-Yves Le,Analysis of a robust reputation system for self-organised networks,European Transactions on Telecommunications,2005,16(5):375-384
[60] Chen Ding, Yuegou Chen,Weiwei Chen,A survey study on trust management in p2p systems,2004
[61] S. Ruohomaa, Kutvonen L.,Koutrouli E.,Reputation Management Survey,The Second International Conference on Availability, Reliability and Security (ARES'07) ,2007,103-111
[62] Raouf Boutaba ,Marshall Alan,Management in peer-to-peer systems: Trust, reputation and security,Computer Networks,2006,50(4):469-471
[63] Sepandar D. Kamvar, Schlosser Mario T.,GarciaMolina Hector , The eigentrust algorithm for reputation management in p2p networks,Proceedings of the 12th international conference on World Wide Web ,Budapest, Hungary :ACM,2003,
[64] Geoffrey Fox,Collaboration and Community Grids,International Symposium on Collaborative Technologies and Systems (CTS'06) ,California, USA:IEEE Computer Society,2006,419-428
[65] Z. Despotovic ,Aberer K., Maximum Likelihood Estimation of Peers' Performance in P2P Networks, in 2nd Workshop on Economics of Peer-to-Peer Systems. 2004, ACM.
[66] S. Marti ,Garcia-Molina H.,Taxonomy of trust: Categorizing P2P reputation systems,Computer Networks,2006,50(4):472-484
[67] P. Dewan,Peer-to-peer reputations,Parallel and Distributed Processing Symposium,New Mexico:2004,
[68] Roslan Ismai Audun J?sang , Colin Boy,A survey of trust and reputation systems for online service provision,Decision Support Systems,2007,43(2):618-644
[69] R. Zhou ,Hwang K.,Trust Overlay Networks for Global Reputation Aggregation in P2P Grid Computing , Proceedings 20th IEEE International Parallel Distributed Processing Symposium ,Greece:2006,25-29
[70] Manuel RodriguezPerez, Esparza Oscar,Muoz Jose L. , Surework: a super-peer reputation framework for p2p networks,Proceedings of the 2008 ACM symposium on Applied computing,Fortaleza:ACM New York, NY, USA,2008,2019-2023
[71] M. Gupta, Judge P.,Ammar M.,A reputation system for peer-to-peer networks,Proceedings of the 13th international workshop on Network ,Monterey, CA:ACM Press New York, NY, USA,2003,144-152
[72] De Paola ,Tamburo A.,Reputation management in distributed systems,Communications, Control and Signal Processing,Julians,Malta:IEEE,2008,666-670
[73] G. Karame, Christou I. T.,Dimitriou T.,A Secure Hybrid Reputation Management System for Super-Peer Networks , Consumer Communications and Networking Conference,Vegas:2008,495-499
[74] K. Aberer, Cudré-Mauroux P., Datta A.,P-Grid: a self-organizing structured P2P system,ACM SIGMOD Record ,ACM Press New York, NY, USA,2003,29-33
[75] Chunqi Tian, Zou Shihong,Wang Wendong,An Efficient Attack-Resistant Trust Model for P2P Networks,International Journal of Computer Science and Network Security,2006,6(11):251
[76] Yu-mei Liu, Yang Shou-bao, Guo Lei-tao,A Distributed Trust-based Reputation Model in P2P System , Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing ,Tailand:IEEE Computer Society,2007,294-299
[77] L. Xiong ,Liu L.,PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities,IEEE Transactions On Knowledge And Data Engineering,2004,:843-857
[78] P. Resnick ,Zeckhauser R.,Trust among strangers in internet transactions: empirical analysis of eBay's reputation system,in: M.R. Baye (Ed.),The Economics of the Internet and ECommerce, Advances in Applied Microeconomics,2002,11-20
[79] N. Sundaresan,Online trust and reputation systems,Proceedings of the 8th ACM conference on Electronic commerce ,California, USA :ACM Press New York, NY, USA,2007,366-367
[80] Chrysanthos Dellarocas,The digitization of word-of-mouth: promise and challenges ofonline feedback mechanisms,Management Science,2003,49(10):1407-1424
[81] Ernesto Damiani, Vimercati Sabrina De Capitani di,Paraboschi Stefano , A reputaion-based approach for choosing reliable resources in peer-to_peer networks,Conference on Computer and Communications Security ,Washington:2002,207-216
[82] P. Varalakshmi, Selvi S. T., Kanchana P. , Three-Tier Grid Architecture with Policy-Based Resource Selection in Grid,Signal Processing, Communications and Networking,Chennai, India:2008,86-92
[83] S. D. Kamvar, Schlosser M. T.,Garcia-Molina H.,EigenRep: Reputation Management in P2P Networks,Proceedings of the Twelfth International World Wide Web ,ACM,20-24
[84] R. Zhou ,Hwang K.,PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing,IEEE Transactions on Parallel and Distributed Systems,IEEE Computer Society,2007,460-473
[85] Jennifer Golbeck ,Hendler James,Inferring binary trust relationships in Web-based social networks,ACM Transactions on Internet Technology (TOIT),2006,6(4):497-529
[86] Yarden Katz ,Golbeck Jennifer, Social network-based trust in prioritized default logic, in Proceedings of the Twenty-First National Conference 2006.
[87] Andrew Whitby, jusang Audun,Indulska Jadwiga,Filter out unfair ratings in bayesian reputation system,Anuonomous Agents and Multi Agent Systems Conference,New York:2005,48-64
[88] Chrysanthos Dellarocas,Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior,Proceedings of the 2nd ACM conference on Electronic commerce ,New York:ACM,2000,150--157
[89] Hongtao Liu ,Qiu Yuhui,A Reputation Model base on Transactions in Peer-to-Peer Networks,Semantics, Knowledge and Grid, Third International Conference ,Xian,China:2007,398-401
[90] Bin Yu, Singh,Sycara,Developing trust in large-scale peer-to-peer systems,Proceedings of the first IEEE Symposium on Multi-Agent Security and Survivability,Philadelphia USA:IEEE,2004,1-10
[91] Jennifer Golbeck ,Parsia Bijan,Trust network-based filtering of aggregated claims, International Journal of Metadata, Semantics and Ontologies,2006,1(1):58-65
[92] N. Griffiths, Chao K. M.,Younas M.,Fuzzy Trust for Peer-to-Peer Systems,26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) ,2006,73-79
[93] George Theodorakopoulos ,Baras John S.,On trust models and trust evaluation metrics for ad hoc networks,IEEE Journal on Selected Areas in Communications,2006,24(2):318-328
[94] Lik Mui, Mohtashemi Mojdeh, Ang Cheewee,Ratings in distributed systems: a bayesian approach,Proceedings of the Workshop on Information Technologies and Systems ,2001,
[95] Lintao Liu, Zhang Shu, Ryu Kyung Dong,R-Chain: A Self-Maintained Reputation Management System in P2P Networks,IEEE International Parallel & Distributed Processing Symposium,Rome, Italy:IEEE Society,2004,131-136
[96] Jsang ,Ismail R.,The beta reputation system,15th Bled Electronic Commerce Conference e-Reality:Constructing the e_Economy,Slovenia:2002,324-337
[97] Beta distribution,2007,http://www.xycoon.com/beta.htm
[98] Stirling's approximation,2008,http://en.wikipedia.org/wiki/Stirling's_approximation
[99]周概荣,概率论与数理统计,高等教育出版社,1984
[100] Vidya S. Teneja ,Cornwell Larry W.,Mathematical forms of the distribution of the product of two normal variables,Communications in Statistics-Theory and Methods,1978,7(2):162-172
[101] W. Q. Meeker, Cornwell L. W.,Aroian L. A.,The product of two normally distributed random variables,Mathematical Statistics,1981,7:1-256
[102] Glenn Shafer,A Mathematical Theory of Evidence.1 edPrinceton University Press,Pages
[103]边肇祺,张学工,模式识别,清华大学出版社,2000
[104]李铮,李乔,De Bruijn图的均匀顶点染色和有向图线图的一个顶点染色定理,上海交通大学学报,1996,30(11):4
[105] J. Rolim, Tvrdik P., Trdlicka J.,Bisecting de Bruijn and Kautz graphs,Discrete Applied Mathematics,1998,85(1):87-97
[106] Anne-Marie Bosneag, Xi Yong, Li Xinjie,Adaptive congestion control for hotspot management in structured peer-to-peer systems,IEEE International Symposium on Cluster Computing and the Grid,Chicago:IEEE,2004,360-369
[2] D. S. Milojicic, Kalogeraki V., Lukose R.,Peer-to-Peer Computing,2002
[3] Oram,Peer-to-Peer: Harnessing the power of disruptive technologies,O'Reilly & Associates, Inc. Sebastopol, CA, USA,2001
[4] Compute with BOINC ,2008,http://boinc.berkeley.edu/
[5] 2007年中国P2P流媒体研究报告, 2007 ,http://www.old.iresearch.com.cn/Online_Movie/detail_free.asp?id=44752.
[6] MT Schlosser, Condie TE,Kamvar SD,Simulating a P2P File-Sharing Network,Proceedings of SemPGRID,Budapest:2003,69-80
[7] N. Inc,The napster homepage,2000,http://www.napster.com
[8] M. Ripeanu,Peer-to-Peer Architecture Case Study: Gnutella Network,Proceedings of the First International Conference on Peer-to-Peer Computing,Sweden: IEEE Computer Press,2001
[9] S. B. Handurukande, Kermarrec A. M., Le Fessant F.,Peer sharing behaviour in the eDonkey network, and implications for the design of server-less file sharing systems,Proceedings of the 2006 EuroSys conference,Leuven, Belgium:ACM Press New York, NY, USA,2006,359-371
[10] Y. Kulbak ,Bickson D., The eMule Protocol Specification,Technical report TR-2005-03, the Hebrew University of Jerusalem
[11] B. Cohen,Incentives Build Robustness in BitTorrent,Workshop on Economics of Peer-to-Peer Systems,Berkeley, CA, USA,2003,
[12] Lei Guo, Chen Songqing, Xiao Zhen , A Performance Study of BitTorrent-like Peer-to-Peer Systems, IEEE Journal On Selected Areas In Communications,2007,25(1):1-15
[13] Bitcomet,2003,http://www.bitcomet.com/
[14]迅雷在线,2006,http://www.xunlei.com
[15] Souptik Datta, Bhaduri Kanishka, Giannella Chris , Distributed Data Mining in Peer-to-Peer Networks,IEEE Internet Computing,2006,:18-26
[16] Grimshaw, Avaki data grid-Secure transparent access to data.
[17] Popular Power,2000,http://en.wikipedia.org/wiki/Popular_Power
[18] D. P. Anderson, Cobb J., Korpela E.,SETI@ home: an experiment in public-resource computing,Communications of the ACM,New York:ACM New York, NY, USA,2002,56-61
[19] L. Gong,Project JXTA: A Technology Overview,Internet Computing ,2001,5(3):88-95
[20] Microsoft Coperation , Microsoft Office Groove , 2007 ,http://office.microsoft.com/zh-cn/groove/FX100487642052.aspx
[21] Microsoft Corporation,NET My Services Specification,2006
[22] Icq community,2008,http://www.icq.com/
[23] Yahoo,Messenger - Chat, Instant message, SMS, PC Calls and More,2006,http://messenger.yahoo.com/
[24] Microsoft,msn,2008,http://www.msn.com/
[25] S. Androutsellis-Theotokis ,Spinellis D.,A survey of peer-to-peer content distribution technologies,ACM Computing Surveys ,2004,36(4):335-371
[26] Gnutella,2008,http://en.wikipedia.org/wiki/Gnutella
[27] Vana Kalogeraki, Gunopulos Dimitrios,Zeinalipour-Yazti D.,A local search mechanism for peer-to-peer networks,Proceedings of the eleventh international conference on Information and knowledge management ,Virginia, USA:ACM New York, NY, USA,2002,300-307
[28] Hyojin Park, Yang Jinhong, Park Juyoung,A Survey on Peer-to-Peer Overlay Network Schemes,Advanced Communication Technology, 2008. ICACT 2008,2008,986-988
[29] Stoica, Morris R., Karger D.,Chord: A scalable peer-to-peer lookup service for internet applications,Proceedings of the 2001 SIGCOMM conference,ACM New York, NY, USA,2001,149-160
[30] Antony Rowstron ,Druschel Peter,Pastry: Scalable, distributed object location and rrouting for large-scale peer-to-peer systems , Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms,Heidelberg:ACM,2001,161-172
[31] P. Fraigniaud ,Gauron P.,The content-addressable network D2B,Tech Rept.1349:2003,
[32] Sylvia Paul Ratnsamy, A scalable content-addressable network. 2002, University of California at Berkeley.
[33] B. Y. Zhao, Kubiatowicz J.,Joseph A. D.,Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,University of California at Berkeley, Berkeley:2001,
[34] The Secure Hash Algorithm Directory , 2001 ,http://www.secure-hash-algorithm-md5-sha-1.co.uk/
[35] W.G.Bridges ,S.Toueg , On the impossibility of directed moore graphs ,J.Combinator.Theory,1980,29(3):339-342
[36] Dmitri Loguinov, Casas Juan,Wang Xiaoming,Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience,ACM Transactions OnNetworking,2005,13(5):1107-1120
[37] N. Lynch, Malkhi D.,Ratajczak D.,Atomic data access in distributed hash tables,Proceedings of the International Peer-to-Peer Symposium,2002,295-305
[38] W. Nejdl, Wolpers M., Siberski W.,Super-peer-based routing strategies for RDF-based peer-to-peer networks,Web Semantics: Science, Services and Agents on the World Wide Web,2004,1(2):177-186
[39] J. Liang, Kumar R.,Ross K. W.,The KaZaA Overlay: A Measurement Study,Computer Networks Journal,2005,49(6):1-25
[40] Heather Yu, Buford John,Merabti Madjid,Improving Messaging Security in Structured P2P Overlay Networks,Multimedia and Expo, 2007 IEEE International Conference ,Beijing:2007,408-411
[41] Z. Despotovic ,Aberer K.,P2P reputation management: Probabilistic estimation vs. social networks,2006,50(4):485-500
[42] Audun J?sang,Trust-based decision making for electronic transactions,Proceedings of the Fourth NordicWorkshop on Secure Computer Systems,Sweden:Stockholm University,1999
[43] Xiaoqi Li, Lyu,Liu Jiangchuan,A trust model based routing protocol for secure ad hoc networks,A trust model based routing protocol for secure ad hoc networks,2004,1286- 1295
[44] D. Hales,From selfish nodes to cooperative networks-emergent link-based incentives in peer-to-peer networks, Peer-to-Peer Computing, 2004. Proceedings,2004,151-158
[45] M. Fischmann , Modelling reputation-based resource pooling in P2P systems ,Proceedings of the 1st international conference on Scalable information systems ,Hong Kong:ACM Press New York, NY, USA,2006
[46] Sinjae Lee, Zhu Shaojian,Kim Yanggon,P2P Trust Model: The Resource Chain Model,Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing,2007,357-362
[47] F. Cornelli, Damiani E., Paraboschi S.,Choosing Reputable Servents in a P2P Network,International World Wide Web Conference ,Hawaii:ACM,2002,376 - 386
[48] Daniel W Manchala, Trust metrics, models and protocols for electronic commerce transactions, in Distributed Computing Systems. 1998: Amsterdam, Netherlands.
[49] K. Wongrujira, Hsin-ting T.,Seneviratne A.,Avoidance routing to misbebaving nodes in P2P by using reputation and variance,Advanced Communication Technology,Krea:2004,1035- 1039
[50] S. Buchegger ,Le Boudee J. Y.,Self-policing mobile ad hoc networks by reputation systems,Communications Magazine,2005,43(7):101-107
[51] P. Dewan, Dasgupta P.,Bhattacharya A.,On using reputations in ad hoc networks to counter malicious nodes,Parallel and Distributed Systems,2004,665-672
[52] Yao Wang ,Vassileva Julita,Trust and reputation model in peer-to-peer networks,Peer-to-Peer Computing,2003,150-157
[53] Jerald Hughes, Lang Karl R.,Vragov Roumen,An analytical framework for evaluating peer-to-peer business models,Electronic Commerce Research and Applications,2008,7(1):105-118
[54] Stephanos Androutsellis-Theotokis, Spinellis Diomidis,Karakoidas Vassilios ,Performing peer-to-peer e-business transactions: A requirements analysis and preliminary design proposal, Proceedings of the IADIS eCommerce 2004 conference,2004,399-404
[55] E. Courses ,Surveys T.,The" Value" of Reputation in Peer-to-Peer Networks,Consumer Communications and Networking Conference,Las Vegas:2008,516-520
[56] Yamamoto, Asahara D., Itao T.,Distributed pagerank: a distributed reputation model for open peer-to-peer network,Applications and the Internet Workshops, 2004,Tokyo, Japan:2004,389-394
[57] L. Mui, Mohtashemi M.,Halberstadt A. , A Computational Model of Trust and Reputation for E-businesses,Proceedings of the 35th Annual Hawaii International Conference on System Sciences ,IEEE Computer Society Washington, DC, USA,2002,188-196
[58] S. Song, Hwang K., Zhou R. , Trusted P2P transactions with fuzzy reputation aggregation,Proceedings of the 13th international workshop on Network ,2005,24-34
[59] Jochen Mundinger ,Boudecy Jean-Yves Le,Analysis of a robust reputation system for self-organised networks,European Transactions on Telecommunications,2005,16(5):375-384
[60] Chen Ding, Yuegou Chen,Weiwei Chen,A survey study on trust management in p2p systems,2004
[61] S. Ruohomaa, Kutvonen L.,Koutrouli E.,Reputation Management Survey,The Second International Conference on Availability, Reliability and Security (ARES'07) ,2007,103-111
[62] Raouf Boutaba ,Marshall Alan,Management in peer-to-peer systems: Trust, reputation and security,Computer Networks,2006,50(4):469-471
[63] Sepandar D. Kamvar, Schlosser Mario T.,GarciaMolina Hector , The eigentrust algorithm for reputation management in p2p networks,Proceedings of the 12th international conference on World Wide Web ,Budapest, Hungary :ACM,2003,
[64] Geoffrey Fox,Collaboration and Community Grids,International Symposium on Collaborative Technologies and Systems (CTS'06) ,California, USA:IEEE Computer Society,2006,419-428
[65] Z. Despotovic ,Aberer K., Maximum Likelihood Estimation of Peers' Performance in P2P Networks, in 2nd Workshop on Economics of Peer-to-Peer Systems. 2004, ACM.
[66] S. Marti ,Garcia-Molina H.,Taxonomy of trust: Categorizing P2P reputation systems,Computer Networks,2006,50(4):472-484
[67] P. Dewan,Peer-to-peer reputations,Parallel and Distributed Processing Symposium,New Mexico:2004,
[68] Roslan Ismai Audun J?sang , Colin Boy,A survey of trust and reputation systems for online service provision,Decision Support Systems,2007,43(2):618-644
[69] R. Zhou ,Hwang K.,Trust Overlay Networks for Global Reputation Aggregation in P2P Grid Computing , Proceedings 20th IEEE International Parallel Distributed Processing Symposium ,Greece:2006,25-29
[70] Manuel RodriguezPerez, Esparza Oscar,Muoz Jose L. , Surework: a super-peer reputation framework for p2p networks,Proceedings of the 2008 ACM symposium on Applied computing,Fortaleza:ACM New York, NY, USA,2008,2019-2023
[71] M. Gupta, Judge P.,Ammar M.,A reputation system for peer-to-peer networks,Proceedings of the 13th international workshop on Network ,Monterey, CA:ACM Press New York, NY, USA,2003,144-152
[72] De Paola ,Tamburo A.,Reputation management in distributed systems,Communications, Control and Signal Processing,Julians,Malta:IEEE,2008,666-670
[73] G. Karame, Christou I. T.,Dimitriou T.,A Secure Hybrid Reputation Management System for Super-Peer Networks , Consumer Communications and Networking Conference,Vegas:2008,495-499
[74] K. Aberer, Cudré-Mauroux P., Datta A.,P-Grid: a self-organizing structured P2P system,ACM SIGMOD Record ,ACM Press New York, NY, USA,2003,29-33
[75] Chunqi Tian, Zou Shihong,Wang Wendong,An Efficient Attack-Resistant Trust Model for P2P Networks,International Journal of Computer Science and Network Security,2006,6(11):251
[76] Yu-mei Liu, Yang Shou-bao, Guo Lei-tao,A Distributed Trust-based Reputation Model in P2P System , Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing ,Tailand:IEEE Computer Society,2007,294-299
[77] L. Xiong ,Liu L.,PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities,IEEE Transactions On Knowledge And Data Engineering,2004,:843-857
[78] P. Resnick ,Zeckhauser R.,Trust among strangers in internet transactions: empirical analysis of eBay's reputation system,in: M.R. Baye (Ed.),The Economics of the Internet and ECommerce, Advances in Applied Microeconomics,2002,11-20
[79] N. Sundaresan,Online trust and reputation systems,Proceedings of the 8th ACM conference on Electronic commerce ,California, USA :ACM Press New York, NY, USA,2007,366-367
[80] Chrysanthos Dellarocas,The digitization of word-of-mouth: promise and challenges ofonline feedback mechanisms,Management Science,2003,49(10):1407-1424
[81] Ernesto Damiani, Vimercati Sabrina De Capitani di,Paraboschi Stefano , A reputaion-based approach for choosing reliable resources in peer-to_peer networks,Conference on Computer and Communications Security ,Washington:2002,207-216
[82] P. Varalakshmi, Selvi S. T., Kanchana P. , Three-Tier Grid Architecture with Policy-Based Resource Selection in Grid,Signal Processing, Communications and Networking,Chennai, India:2008,86-92
[83] S. D. Kamvar, Schlosser M. T.,Garcia-Molina H.,EigenRep: Reputation Management in P2P Networks,Proceedings of the Twelfth International World Wide Web ,ACM,20-24
[84] R. Zhou ,Hwang K.,PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing,IEEE Transactions on Parallel and Distributed Systems,IEEE Computer Society,2007,460-473
[85] Jennifer Golbeck ,Hendler James,Inferring binary trust relationships in Web-based social networks,ACM Transactions on Internet Technology (TOIT),2006,6(4):497-529
[86] Yarden Katz ,Golbeck Jennifer, Social network-based trust in prioritized default logic, in Proceedings of the Twenty-First National Conference 2006.
[87] Andrew Whitby, jusang Audun,Indulska Jadwiga,Filter out unfair ratings in bayesian reputation system,Anuonomous Agents and Multi Agent Systems Conference,New York:2005,48-64
[88] Chrysanthos Dellarocas,Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior,Proceedings of the 2nd ACM conference on Electronic commerce ,New York:ACM,2000,150--157
[89] Hongtao Liu ,Qiu Yuhui,A Reputation Model base on Transactions in Peer-to-Peer Networks,Semantics, Knowledge and Grid, Third International Conference ,Xian,China:2007,398-401
[90] Bin Yu, Singh,Sycara,Developing trust in large-scale peer-to-peer systems,Proceedings of the first IEEE Symposium on Multi-Agent Security and Survivability,Philadelphia USA:IEEE,2004,1-10
[91] Jennifer Golbeck ,Parsia Bijan,Trust network-based filtering of aggregated claims, International Journal of Metadata, Semantics and Ontologies,2006,1(1):58-65
[92] N. Griffiths, Chao K. M.,Younas M.,Fuzzy Trust for Peer-to-Peer Systems,26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) ,2006,73-79
[93] George Theodorakopoulos ,Baras John S.,On trust models and trust evaluation metrics for ad hoc networks,IEEE Journal on Selected Areas in Communications,2006,24(2):318-328
[94] Lik Mui, Mohtashemi Mojdeh, Ang Cheewee,Ratings in distributed systems: a bayesian approach,Proceedings of the Workshop on Information Technologies and Systems ,2001,
[95] Lintao Liu, Zhang Shu, Ryu Kyung Dong,R-Chain: A Self-Maintained Reputation Management System in P2P Networks,IEEE International Parallel & Distributed Processing Symposium,Rome, Italy:IEEE Society,2004,131-136
[96] Jsang ,Ismail R.,The beta reputation system,15th Bled Electronic Commerce Conference e-Reality:Constructing the e_Economy,Slovenia:2002,324-337
[97] Beta distribution,2007,http://www.xycoon.com/beta.htm
[98] Stirling's approximation,2008,http://en.wikipedia.org/wiki/Stirling's_approximation
[99]周概荣,概率论与数理统计,高等教育出版社,1984
[100] Vidya S. Teneja ,Cornwell Larry W.,Mathematical forms of the distribution of the product of two normal variables,Communications in Statistics-Theory and Methods,1978,7(2):162-172
[101] W. Q. Meeker, Cornwell L. W.,Aroian L. A.,The product of two normally distributed random variables,Mathematical Statistics,1981,7:1-256
[102] Glenn Shafer,A Mathematical Theory of Evidence.1 edPrinceton University Press,Pages
[103]边肇祺,张学工,模式识别,清华大学出版社,2000
[104]李铮,李乔,De Bruijn图的均匀顶点染色和有向图线图的一个顶点染色定理,上海交通大学学报,1996,30(11):4
[105] J. Rolim, Tvrdik P., Trdlicka J.,Bisecting de Bruijn and Kautz graphs,Discrete Applied Mathematics,1998,85(1):87-97
[106] Anne-Marie Bosneag, Xi Yong, Li Xinjie,Adaptive congestion control for hotspot management in structured peer-to-peer systems,IEEE International Symposium on Cluster Computing and the Grid,Chicago:IEEE,2004,360-369
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |