对等网环境下搜索策略与信任机制研究
|
摘要
下一代新型计算机网络体系结构不断兴起。作为重点发展的P2P网络体系结构及相关技术是目前的研究热点。在本质上P2P是一种逻辑意义上的覆盖网络。P2P强调对等计算思想,网络中的节点具有平等的地位、权利和义务,每个节点既可获取资源又需提供资源,并参与到网络管理之中。为保证节点的自治性,允许节点动态加入或退出网络。
建立在Internet之上的P2P的分布式结构造成资源的无组织,为了检索所需资源,节点必将广播其需求,洪泛转发的结果虽可找到资源,但浪费带宽。构造合理的覆盖网络,尽可能减少路由跳数,可在分布式结构中尽快地到达目标节点,这样可以提高系统搜索效率。节点的自治性、匿名性导致节点个人利益最大化的滋生,产生了搭便车现象,服务不可靠,甚至是恶意的攻击等行为。建立一套合理的信任机制,可保证数据的可信性和安全性。如果信任数据存放在非固定、非稳定的节点之上,P2P的动态性致使数据容易丢失或付出过大的维护开销。建立合理的信任数据管理机制,能有效保存信任数据,并对之进行有效的管理以维护网络动态性,提升系统综合性能。为此,论文对搜索策略,信任机制进行深入研究具有理论意义和实际应用价值。
论文针对下述几个方面展开工作。
本文提出了一个由物理网络层、覆盖网络层、信任层和信任数据管理层组成的四层的覆盖网络结构POTM。提出了一种基于极坐标的数据搜索定位协议,将CAN协议的多维笛卡尔坐标空间映射到一个极坐标空间中,并采用幂级数算法进行子空间的扩展,完成跳跃式查询,大大减少了逻辑路由跳数,提高了资源定位效率。
采用证据理论进行信任建模,可融合多方信息,但无法有效聚合冲突。本文提出了一种新的证据合成规则NECR,引入权重系数,并对冲突证据进行处理,可提高证据合成的可靠性与合理性。论文基于NECR规则建立了一种新的信任模型,通过比例向量描述对命题的支持度,使得信任度的计算更准确灵活,可提高数据的可信性。
主观逻辑理论从事实空间和观念空间两个不同的角度描述和度量信任关系,但没有考虑时间和否定事件对节点信任值的影响,也无法消除恶意行为的影响。本文提出了一种基于主观逻辑的信任模型NTMBSL,引入遗忘因子和采用变异系数描述否定事件评估风险因子计算信任值。将节点按功能分成群组,把节点之间的信任关系延伸到群组、节点之间的多方关系,增加信任度量的准确性,有效识别恶意节点,并可防止节点之间的协同作弊,从而提高整体安全性。
为了对信任值进行综合管理,提出了信任数据管理模型,采用非劣解的管理者选择策略NISMS和基于差分指数模型的预期在线时间估计方法,基于综合权值对节点按组进行管理。设计了高效算法完成主节点、辅节点的选择过程,以及交换组间、组内消息,并设计相关算法规范了节点加入和离开行为。以上对信任数据的管理机制,可在一定程度上解决瓶颈问题,均衡负载,减少网络流量,提升系统整体可用性。
A new generation architectures of computer network continues to burgeoning. As a key development in the P2P network architecture, its related technologies are current hotspot. In essence, P2P is an overlay network from the perspective of logical sense. P2P stressed the idea of Peer-to-Peer Computing. In P2P, nodes are equal in status, their rights and obligations are of the same. Each node can access resources, while they also need to provide resources. They are also involved into the network management. To ensure the autonomy of nodes, P2P allows nodes to dynamically join the network, or exit from the network.
As P2P which basis is Internet, has a distributed structure, it makes that the resources are not organized. In order to retrieve the necessary resources, nodes must broadcast their requests. Because of using the flooding, it may finally find the resources, but a waste of bandwidth happens. If we can construct a reasonable overlay network, and minimize the routing hops in the network with a distributed architecture, we can quickly reach the target node. Thus, it can improve the search efficiency. Since nodes have the nature of anonymity and autonomy, which led to the fact that the pursuit of the node is to maximize their own interests. In the network, it generated some free-rider phenomenon. Therefore, service becomes unreliable, and even in some cases it may appear the behavior of malicious attacks. Our plan is to establish a reasonable mechanism for the trust, in order to ensure the credibility and security of data. Trust data, they need to be stored in non-fixed and non-stable nodes. The dynamic nature of P2P leads to the fact that the data likely to be lost, or it's too costly to maintain. For the trust data, we build a reasonable management mechanism in order to effectively preserve the trust data, and effectively manage them, so that it can maintain the dynamic nature of the network and enhance the performance of the system. To this end, we focus on the search strategies and the trust mechanisms, because of their theoretical and practical value.
In this thesis, we started our research work on several aspects mentioned earlier.
Existing retrieval systems can not fully support the resource organization, the Resource Location is inefficient. This thesis presents a four-layer overlay network structure, we call it "POTM", which consists of the physical network layer, the overlay network layer, trust layer, and management layer of the trust data. This thesis proposes a protocol of data search and resource location, which based on polar coordinates. The multi-dimensional space of CAN protocol is re-mapped to another polar coordinate space. We combines Resource space model with the unified organization of distributed data resources, thus it constitutes an overlay network layer. In this thesis, we use the power series algorithm which extended the subspace, thus we greatly reduces the logical routing hops, and improve the efficiency of data search.
Based on evidence theory, we model the trust mechanism. It can integrate multi-information, but can not effectively aggregate conflict. This thesis proposes a new rule of evidence combination, we call it "NECR". We introduce the weight coefficient, and deal with the conflict of evidence, in order to improve the reliability and reasonable of evidence combination. Based on NECR rule, we have created a new trust model. By comparing the degree of support for the proposition of proportion vector, we can get a more accurate and flexible calculation for the trust data, and improve the credibility of the data.
The theory of Subjective logic descripts and measures the trust relation from the two views of real space and concept space. However, it did not take into account of impact of time and the negative events for the nodes'trust value, and it also can not eliminate the impact of malicious behavior. This thesis presents a trust model based on subjective logic, we call it NTMBSL. We introduce the forgetting factor and the risk factors, in order to calculate the trust value. The nodes are divided into groups by function. We extend the trust relationship between nodes to the group. Multiple relationships between nodes can increase the confidence in the accuracy of measurement, effectively identify the malicious node, and it prevents cheating collaboration between nodes to improve overall security.
We propose a trust model for data management, which manage data by group, so it can complete the integrated management of trust value. We design the corresponding algorithm, it selects the master node, secondary node, and exchange messages within the group or groups, and it provides the nodes'behavior of join and leave. The algorithm can solve the bottleneck problem to some extent, balance the load and reduce network traffic, and improve overall system availability.
建立在Internet之上的P2P的分布式结构造成资源的无组织,为了检索所需资源,节点必将广播其需求,洪泛转发的结果虽可找到资源,但浪费带宽。构造合理的覆盖网络,尽可能减少路由跳数,可在分布式结构中尽快地到达目标节点,这样可以提高系统搜索效率。节点的自治性、匿名性导致节点个人利益最大化的滋生,产生了搭便车现象,服务不可靠,甚至是恶意的攻击等行为。建立一套合理的信任机制,可保证数据的可信性和安全性。如果信任数据存放在非固定、非稳定的节点之上,P2P的动态性致使数据容易丢失或付出过大的维护开销。建立合理的信任数据管理机制,能有效保存信任数据,并对之进行有效的管理以维护网络动态性,提升系统综合性能。为此,论文对搜索策略,信任机制进行深入研究具有理论意义和实际应用价值。
论文针对下述几个方面展开工作。
本文提出了一个由物理网络层、覆盖网络层、信任层和信任数据管理层组成的四层的覆盖网络结构POTM。提出了一种基于极坐标的数据搜索定位协议,将CAN协议的多维笛卡尔坐标空间映射到一个极坐标空间中,并采用幂级数算法进行子空间的扩展,完成跳跃式查询,大大减少了逻辑路由跳数,提高了资源定位效率。
采用证据理论进行信任建模,可融合多方信息,但无法有效聚合冲突。本文提出了一种新的证据合成规则NECR,引入权重系数,并对冲突证据进行处理,可提高证据合成的可靠性与合理性。论文基于NECR规则建立了一种新的信任模型,通过比例向量描述对命题的支持度,使得信任度的计算更准确灵活,可提高数据的可信性。
主观逻辑理论从事实空间和观念空间两个不同的角度描述和度量信任关系,但没有考虑时间和否定事件对节点信任值的影响,也无法消除恶意行为的影响。本文提出了一种基于主观逻辑的信任模型NTMBSL,引入遗忘因子和采用变异系数描述否定事件评估风险因子计算信任值。将节点按功能分成群组,把节点之间的信任关系延伸到群组、节点之间的多方关系,增加信任度量的准确性,有效识别恶意节点,并可防止节点之间的协同作弊,从而提高整体安全性。
为了对信任值进行综合管理,提出了信任数据管理模型,采用非劣解的管理者选择策略NISMS和基于差分指数模型的预期在线时间估计方法,基于综合权值对节点按组进行管理。设计了高效算法完成主节点、辅节点的选择过程,以及交换组间、组内消息,并设计相关算法规范了节点加入和离开行为。以上对信任数据的管理机制,可在一定程度上解决瓶颈问题,均衡负载,减少网络流量,提升系统整体可用性。
A new generation architectures of computer network continues to burgeoning. As a key development in the P2P network architecture, its related technologies are current hotspot. In essence, P2P is an overlay network from the perspective of logical sense. P2P stressed the idea of Peer-to-Peer Computing. In P2P, nodes are equal in status, their rights and obligations are of the same. Each node can access resources, while they also need to provide resources. They are also involved into the network management. To ensure the autonomy of nodes, P2P allows nodes to dynamically join the network, or exit from the network.
As P2P which basis is Internet, has a distributed structure, it makes that the resources are not organized. In order to retrieve the necessary resources, nodes must broadcast their requests. Because of using the flooding, it may finally find the resources, but a waste of bandwidth happens. If we can construct a reasonable overlay network, and minimize the routing hops in the network with a distributed architecture, we can quickly reach the target node. Thus, it can improve the search efficiency. Since nodes have the nature of anonymity and autonomy, which led to the fact that the pursuit of the node is to maximize their own interests. In the network, it generated some free-rider phenomenon. Therefore, service becomes unreliable, and even in some cases it may appear the behavior of malicious attacks. Our plan is to establish a reasonable mechanism for the trust, in order to ensure the credibility and security of data. Trust data, they need to be stored in non-fixed and non-stable nodes. The dynamic nature of P2P leads to the fact that the data likely to be lost, or it's too costly to maintain. For the trust data, we build a reasonable management mechanism in order to effectively preserve the trust data, and effectively manage them, so that it can maintain the dynamic nature of the network and enhance the performance of the system. To this end, we focus on the search strategies and the trust mechanisms, because of their theoretical and practical value.
In this thesis, we started our research work on several aspects mentioned earlier.
Existing retrieval systems can not fully support the resource organization, the Resource Location is inefficient. This thesis presents a four-layer overlay network structure, we call it "POTM", which consists of the physical network layer, the overlay network layer, trust layer, and management layer of the trust data. This thesis proposes a protocol of data search and resource location, which based on polar coordinates. The multi-dimensional space of CAN protocol is re-mapped to another polar coordinate space. We combines Resource space model with the unified organization of distributed data resources, thus it constitutes an overlay network layer. In this thesis, we use the power series algorithm which extended the subspace, thus we greatly reduces the logical routing hops, and improve the efficiency of data search.
Based on evidence theory, we model the trust mechanism. It can integrate multi-information, but can not effectively aggregate conflict. This thesis proposes a new rule of evidence combination, we call it "NECR". We introduce the weight coefficient, and deal with the conflict of evidence, in order to improve the reliability and reasonable of evidence combination. Based on NECR rule, we have created a new trust model. By comparing the degree of support for the proposition of proportion vector, we can get a more accurate and flexible calculation for the trust data, and improve the credibility of the data.
The theory of Subjective logic descripts and measures the trust relation from the two views of real space and concept space. However, it did not take into account of impact of time and the negative events for the nodes'trust value, and it also can not eliminate the impact of malicious behavior. This thesis presents a trust model based on subjective logic, we call it NTMBSL. We introduce the forgetting factor and the risk factors, in order to calculate the trust value. The nodes are divided into groups by function. We extend the trust relationship between nodes to the group. Multiple relationships between nodes can increase the confidence in the accuracy of measurement, effectively identify the malicious node, and it prevents cheating collaboration between nodes to improve overall security.
We propose a trust model for data management, which manage data by group, so it can complete the integrated management of trust value. We design the corresponding algorithm, it selects the master node, secondary node, and exchange messages within the group or groups, and it provides the nodes'behavior of join and leave. The algorithm can solve the bottleneck problem to some extent, balance the load and reduce network traffic, and improve overall system availability.
引文
[1]范建华TCP/IP详解卷1：协议.北京：机械工业出版社,2000
[2]Stevens W R, Wright G R. TCP/IP Illustrated:the protocols addison-Wesley,1994,1
[3]Comer D E, Stevens D L. Internetworking with tcp/ip. Prentice Hall,1991
[4]Castells M. The rise of the network society. Wiley-Blackwell,2000
[5]Wen T, Zhong C. Research of Subjective Trust Management Model Based on the Fuzzy Set Theory. Journal of Software,2003,8:1401-1408P
[6]Altmann J, Bedane Z B. A P2P file sharing network topology formation algorithm based on social network information//INFOCOM Workshops 2009, IEEE.2009:1-6 P
[7]Lakshman A, Malik P. Cassandra:structured storage system on a p2p network//Proceedings of the 28th ACM symposium on Principles of distributed computing.2009:5-5 P
[8]Adamus R, Kozankiewicz H, Stencel K, et al. Implementing a P2P network through updatable database views//On the Move to Meaningful Internet Systems 2007:OTM2007 Workshops.2010：35-36 P
[9]Afergan M M, Leighton T M, Parikh J G. HYBRID CONTENT DELIVERY NETWORK (CDN) AND PEER-TO-PEER (P2P) NETWORK.2009
[10]Saroiu S, Gummadi K P, Gribble S D. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia systems,2003,9(2):170-184 P
[11]Gummadi P K, Saroiu S, Gribble S D. A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems. ACM SIGCOMM Computer Communication Review,2002,32(1):82-82 P
[12]郑纬民.对等计算研究概论.中国计算机学会通讯.2004：1-21页
[13]Liu H, Zhang L M, Zeng B. An Anonymous Trustful-Agents-Based Trust Model for P2P Network//2009 Asia-Pacific Conference on Information Processing.2009:426-429 P
[14]Bo J, Zhao J P. A Novel Anonymous P2P Resource Sharing System. Advanced Materials Research,2011,211:300-304 P
[15]Ayyasamy S, Sivanandam S N. Trust Based Content Distribution for Peer-To-Peer Overlay Networks. International Journal of Network Security & Its Applications IJNSA, Volume 2, Number 2,2010
[16]Lalande J F, Rodriguez D, Toinard C. Security properties in an open peer-to-peer network. Arxiv preprint arXiv:1004.0772,2010
[17]Liang Z. Research on Trust and Reputation Mechanism on P2P Network. Computer Security,2009,12
[18]Jing X I, Ping H U, Jian-de L U. Research on P2P Reputation Model with Uncertainty Theory. Computer Engineering,2009,35(8):158-160 P
[19]Madden M, Project P I & A L. The State of Music Online:Ten Years After Napster. Pew Internet & American Life Project,2009
[20]Patrick M, Subarna S, Ali H. M. Z. Napster and its Effects on the Music Industry:An Empirical Analysis. Journal of Social Sciences,2010,6(3):303-309 P
[21]Genutella. http://gnutella.wego.com
[22]Liang J, Kumar R, Ross K W. The kazaa overlay:A measurement study. Computer Networks Journal (Elsevier),2005,49(6)
[23]Good N S, Krekelberg A. Usability and privacy:a study of Kazaa P2P file-sharing//Proceedings of the SIGCHI conference on human factors in computing systems.2003:137-144 P
[24]Liang J, Kumar R, Ross K W. The FastTrack overlay:A measurement study. Computer Networks,2006,50(6):842-858 P
[25]Stoica I, Morris R, Karger D, et al. Chord:A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review,2001,31(4): 149-160 P
[26]Xiao-yun Z. Hybrid P2P Model Based on Chord Protocol. Computer Engineering,2010, 36(7):112-114 P
[27]Stoica I, Morris R, Karger D, et al. Chord:A scalable P2P lookup service for internet applications//Proc. of ACM SIGCOMM.2001,8
[28]Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network//Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications.2001:161-172 P
[29]Rowstron A, Druschel P. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems.2001
[30]Urdaneta G, Pierre G, Steen M V. A survey of DHT security techniques. ACM Computing Surveys (CSUR),2011,43(2):8 P
[31]Roncancio C, del Pilar Villamil M, Labbe C, et al. Data sharing in DHT based P2P systems. Transactions on Large-Scale Data-and Knowledge-Centered Systems Ⅰ,2009: 327-352 P
[32]Zhao B Y, Kubiatowicz J, Joseph A D. Tapestry:An infrastructure for fault-tolerant wide-area location and routing. Computer,2001,74(11-20):46 P
[33]Wells C. The OceanStore archive:Goals, structures, and selfrepair. UC Berkeley Masters Report,2002
[34]Rhea S, Eaton P, Geels D, et al. Awarded Best Student Paper!-Pond:The OceanStore Prototype//Proceedings of the 2nd USENIX Conference on File and Storage Technologies.2003:1-14 P
[35]others. Oceanstore:An architecture for global-scale persistent storage//Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating systems.2000
[36]Josang A, Ismail R, Boyd C. A survey of trust and reputation systems for online service provision. Decision Support Systems,2007,43(2):618-644 P
[37]Xiong L, Liu L. Peertrust:Supporting reputation-based trust for peer-to-peer electronic communities. Knowledge and Data Engineering, IEEE Transactions on,2004,16(7): 843-857 P
[38]Wang Y, Vassileva J. Trust and reputation model in peer-to-peer networks. Peer-to-Peer Computing,2003.(P2P 2003)//Proceedings, Third International Conference on.2003: 150-157 P
[39]Wei Y, Jin-Sheng L, Pei-Lin H. Distributed peer-to-peer trust model and computer simulation. Journal of System Simulation,2006,18(4):938-942 P
[40]Kamvar S D, Schlosser M T, Garcia-Molina H. The eigentrust algorithm for reputation management in p2p networks//Proceedings of the 12th international conference on World Wide Web.2003:640-651 P
[41]Aberer K, Despotovic Z. Managing trust in a peer-2-peer information system//Proceedings of the tenth international conference on Information and knowledge management.2001:310-317 P
[42]Yamamoto A, Asahara D, Itao T, et al. Distributed pagerank:A distributed reputation model for open peer-to-peer networks.2004
[43]Yu B, Singh M P. An evidential model of distributed reputation management//Proceedings of the first international joint conference on Autonomous agents and multiagent systems:part 1.2002:294-301 P
[44]Xi J, Nie P, Lu J. A P2P Trust Model Based on Dynamic Fuzzy Theory-BGTR//2008 International Symposiums on Information Processing.2008:187-191 P
[45]Wang X, Wang L. P2P Recommendation Trust Model//Eighth International Conference on Intelligent Systems Design and Applications.2008:591-595 P
[46]潘静.面向可信服务选取的基于声誉的推荐者发现方法.软件学报,2010,21(2)：388-400页
[47]Hui C, Zheng Q. A Trust Evaluation Model for P2P E-Commerce Systems//2008 International Conference on Computational Intelligence and Security.2008:500-505 P
[48]金瑜.一种新的P2P系统中基于双ratings的声誉管理机制.计算机研究与发展,2008,45(006)：942-950页
[49]李佳伦.一种具有时间衰减和主观预期的P2P网络信任管理模型.电子与信息学报,2009,31(11)：2786-2790页
[50]Biao C A I, Zhishu L, Yang C, et al. Trust Decision Making in Structured P2P Network//2009 International Conference on Communication Software and Networks. 2009:679-683 P
[51]Song S, Hwang K, Zhou R, et al. Trusted P2P transactions with fuzzy reputation aggregation. Internet Computing, IEEE,2005,9(6):24-34 P
[52]田春岐.一种基于推荐证据的有效抗攻击P2P网络信任模型.计算机学报,2008,31(2)：270-281页
[53]Resnick P, Zeckhauser R. Trust among strangers in Internet transactions. The economics of the Internet and e-commerce,2002,11:127-157 P
[54]Wang Q, Wang L. A Vector-Based Trust Model for P2P E-commerce//Fourth International Conference on Natural Computation.2008:117-123 P
[55]Liu F, Zhang W, Ding Y, et al. DynamicTrust:three-dimensional dynamic computing model of trust in peer-to-peer networks//Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation.2009:337-344 P
[56]姜守旭.一种P2P电子商务系统中基于声誉的信任机制.软件学报,2007,18(10)：2551-2563 P
[57]Liu Y, Xiong N, Li Y, et al. A secure model for controlling the hubs in P2P wireless network based on trust value. Computer Communications,2010,33(8):997-1004 P
[58]Meghanathan N. Recent Trends in Network Security and Applications:Third International Conference, CNSA 2010, Chennai, India. July 2010. Proceedings. Springer-Verlag New York Inc,2010:23-25 P
[59]Jiang X, Ye L. Reputation-Based Trust Model and Anti-attack Mechanism in P2P Networks//2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing.2010:498-501 P
[60]Bontrager M D. Peering into the Future:Peer-to-Peer Technology as a Model for Distributed Joint Battlespace Intelligence Dissemination and Operational Tasking. AIR UNIV MAXWELL AFB AL SCHOOL OF ADVANCED AIRPOWER STUDIES, 2001
[61]Marti S, Garcia-Molina H. Limited reputation sharing in P2P systems//Proceedings of the 5th ACM conference on Electronic commerce.2004:91-101 P
[62]Liu Y, Liu X, Xiao L, et al. Location-aware topology matching in P2P systems//INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies.2004,4:2220-2230 P
[63]Castro M, Druschel P, Hu Y C, et al. Topology-aware routing in structured peer-to-peer overlay networks//Future Directions in Distributed Computing.2003:103-107 P
[64]Junginger M, Lee Y. The Multi-Ring topology-High-Performance Group Communication in Peer-to-Peer Networks.2002
[65]Small T, Li B, Liang B. Topology affects the efficiency of network coding in peer-to-peer networks//Communications,2008. ICC08. IEEE International Conference on.2008:5591-5597 P
[66]Kurmanowytsch R, Jazayeri M, Kirda E. Towards a hierarchical, semantic peer-to-peer topology//Peer-to-Peer Computing,2002.(P2P 2002). Proceedings. Second International Conference on.2002:167-168 P
[67]Piatek M, Isdal T, Krishnamurthy A, et al. One hop reputations for peer to peer file sharing workloads//Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation.2008:1-14 P
[68]Kamvar S D, Schlosser M T. Method and system for reputation management in peer-to-peer networks. Google Patents,2010
[69]Cornelli F, Damiani E, di Vimercati S, et al. Implementing a reputation-aware gnutella servent. Web Engineering and Peer-to-Peer Computing,2010:321-334 P
[70]袁巍.一种P2P网络分布式信任模型及仿真.系统仿真学报,2006,18(004)：938-942页
[71]Liu Y, Zhuang Z, Xiao L, et al. A distributed approach to solving overlay mismatching problem//Distributed Computing Systems,2004. Proceedings.24th International Conference on.2004:132-139 P
[72]Yamamoto A, Asahara D, Itao T, et al. Distributed pagerank:A distributed reputation model for open peer-to-peer networks.2004:389-394P
[73]Mischke J, Stiller B. Peer-to-peer and distributed search in fixed and mobile environments.2004
[74]Cai M, Frank M. RDFPeers:a scalable distributed RDF repository based on a structured peer-to-peer network//Proceedings of the 13th international conference on World Wide Web.2004:650-657 P
[75]罗杰文. Peer to Peer (p2p)综述. http://www.intsci.ac.cn/users/luojw/P2P/ index.html 2005,11.
[76]Li J. On-demand file transfers for mass P2P file sharing. Google Patents,2009
[77]DE CAPITANI D I V, DAMIANI E, SAMARATI P. Managing and sharing servants reputations in P2P systems. IEEE transactions on knowledge and data engineering,2003, 15(4):840-854P
[78]Rout B K, Sahu S. Extending JXTA for P2P File Sharing Systems.2009
[79]Chang T T. Performance enhancement of the P2P file sharing on MANET by using UWB.2010
[80]Gasti P, Merlo A, Ciaccio G, et al. On the Integrity of Network Coding-based Anonymous P2P File Sharing Networks//2010 Ninth IEEE International Symposium on Network Computing and Applications.2010:192-197 P
[81]郑纬民.P2P系统发展历史及应用.中国教育网络,2005(007)：23-26页
[82]金舒.基于P2P模型的网络入侵检测系统PeerIDS计算机工程与应用,2006,42(009)：114-119页
[83]Korpela E J, Cobb J, Lebofsky M, et al. Candidate Identification and Interference Removal in SETI@ home. Communication With Extraterrestrial Intelligence (Ceti), 2011:37 P
[84]Werthimer D, Cobb J, Lebofsky M, et al. SETI@ HOME—massively distributed computing for SETI. Computing in Science and Engineering,2001,3(1):78-83 P
[85]Korpela E, Werthimer D, Anderson D, et al. Seti@ home-massively distributed computing for seti. Computing in Science & Engineering,2001,3(1):78-83 P
[86]Castro M, Druschel P, Ganesh A, et al. Security for structured peer-to-peer overlay networks//Proc. of the Fifth Symposium on Operating System Design and Implementation (OSDI2002).2002:261-269P
[87]Locasto M E, Parekh J J, Keromytis A D, et al. Towards collaborative security and P2P intrusion detection//Information Assurance Workshop,2005. IAW05. Proceedings from the Sixth Annual IEEE SMC.2005:333-339 P
[88]Sit E, Morris R. Security considerations for peer-to-peer distributed hash tables. Peer-to-Peer Systems,2002:261-269 P
[89]Wallach D. A survey of peer-to-peer security issues. Software Security-Theories and Systems,2003:253-258 P
[90]黄全能.对等网络信誉机制研究综述.小型微型计算机系统,2006,27(007)：1175-1181页
[91]窦文.构造基于推荐的Peer-to-Peer环境下的Trust模型Journal of Software,2004,15(4)：571-583页
[92]张骞.混合P2P环境下有效的查询扩展及其搜索算法Journal of Software,2006, 17(4):782-793页
[93]Gambetta D. Can we trust. Trust:Making and breaking cooperative relations,1988,213: 238 P
[94]Gambetta D. Trust:Making and breaking cooperative relations.1990.
[95]Dasgupta P. Trust as a Commodity. Trust:Making and Breaking Cooperative Relations, electronic edition, Department of Sociology, University of Oxford,2000:49-72 P
[96]Abdul-Rahman A, Hailes S. Supporting trust in virtual communities//hicss.2000:1-9P
[97]Dewan P, Dasgupta P. P2p reputation management using distributed identities and decentralized recommendation chains. IEEE Transactions on Knowledge and Data Engineering,2009:1000-1013 P
[98]Satsiou A, Tassiulas L. Reputation-based resource allocation in P2P systems of rational users. IEEE Transactions on Parallel and Distributed Systems,2009:466-479 P
[99]Sabater J, Sierra C. Reputation and social network analysis in multi-agent systems//Proceedings of the first international joint conference on Autonomous agents and multiagent systems:part 1.2002:475-482 P
[100]Wang W, Wang X, Pan S, et al. A New Global Trust Model Based on Recommendation for Peer-To-Peer Network//2009 International Conference on New Trends in Information and Service Science.2009:325-328 P
[101]Gu C, Zhang S, Feng H, et al. A Novel Trust Management Model for P2P Network with Reputation and Risk Evaluation//2010 International Conference on E-Business and E-Government.2010:3544-3547 P
[102]Zhen-hua T A N, Wei C, Zhi-liang Z H U, et al. A Trust Model with Multidimensional Factor for P2P Routing. Journal of Northeastern University (Natural Science),2010, 31(11):1574-1577P
[103]Zhi-guo S H I, Ji-wei L I U, Zhi-liang W. Dynamic P2P trust model based on time-window feedback mechanism. Journal on Communications,2010
[104]Shi H, Cao W, Zhu S L, et al. Application of evidence theory in optimum route planning. Jisuanji Gongcheng yu Yingyong(Computer Engineering and Applications),2009, 45(26) P
[105]Chen B, Zhang B, Zhu W. Combined trust model based on evidence theory in iterated prisoners dilemma game. International Journal of Systems Science,2011,42(1):63-80 P
[106]Couso I, Moral S. Independence concepts in evidence theory. International journal of approximate reasoning,2010.
[107]Aspnes J, Shah G. Skip graphs. ACM Transactions on Algorithms (TALG),2007,3(4): 37-39 P
[108]Dempster A P. Upper and Lower Probabilities Induced by a Multi-valued Mapping. Annals of Mathematical Statistics,38:325-39 P
[109]Miranda E, De Cooman G, Couso I. Lower previsions induced by multi-valued mappings. Journal of statistical planning and inference,2005,133(1):173-197 P
[110]Shafer G. A mathematical theory of evidence Princeton university press Princeton, NJ, 1976.
[111]Poroseva S V, Lay N, Hussaini M Y. Multimodel Approach Based on Evidence Theory for Forecasting Tropical Cyclone Tracks. Monthly Weather Review,2010,138(2): 405-420 P
[112]Junmao Z, Shoubao Y, Jianping F, et al. A grid & P2P trust model based on recommendation evidence reasoning. Journal of Computer Research and Development, 2005,42(5):797-803 P
[113]J Φ sang A, Knapskog S J. A metric for trusted systems//In Proceedings of the 21st National Security Conference. NSA.1998
[114]J Φ sang A. The right type of trust for distributed systems//Proceedings of the 1996 workshop on New security paradigms.1996:119-131 P
[115]J Φ sang A. A subjective metric of authentication. Computer Security-ESORICS 98, 1998:329-344 P
[116]马丽丽.基于语义聚类的层次化语义覆盖网构建方法研究.计算机与数字工程,2008,36(010)：135-139页
[117]乔百友.一种基于语义的super-peer网络构建方法.东北大学学报：自然科学版,2008(001)：61-64页
[118]张伟.基于语义的动态超节点网络模型及搜索算法.中南大学博士学位论文。2009：3-18页
[119]孙亮.P2P网络中资源管理机制的研究.北京邮电大学博士学位论文.2007：5-20页
[120]Adar E, Huberman B A. Free riding on gnutella. First Monday,2000,5(10):2-13 P
[121]Hughes D, Coulson G, Walkerdine J. Free riding on Gnutella revisited:the bell tolls. IEEE Distributed Systems Online,2005:1P
[2]Stevens W R, Wright G R. TCP/IP Illustrated:the protocols addison-Wesley,1994,1
[3]Comer D E, Stevens D L. Internetworking with tcp/ip. Prentice Hall,1991
[4]Castells M. The rise of the network society. Wiley-Blackwell,2000
[5]Wen T, Zhong C. Research of Subjective Trust Management Model Based on the Fuzzy Set Theory. Journal of Software,2003,8:1401-1408P
[6]Altmann J, Bedane Z B. A P2P file sharing network topology formation algorithm based on social network information//INFOCOM Workshops 2009, IEEE.2009:1-6 P
[7]Lakshman A, Malik P. Cassandra:structured storage system on a p2p network//Proceedings of the 28th ACM symposium on Principles of distributed computing.2009:5-5 P
[8]Adamus R, Kozankiewicz H, Stencel K, et al. Implementing a P2P network through updatable database views//On the Move to Meaningful Internet Systems 2007:OTM2007 Workshops.2010：35-36 P
[9]Afergan M M, Leighton T M, Parikh J G. HYBRID CONTENT DELIVERY NETWORK (CDN) AND PEER-TO-PEER (P2P) NETWORK.2009
[10]Saroiu S, Gummadi K P, Gribble S D. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia systems,2003,9(2):170-184 P
[11]Gummadi P K, Saroiu S, Gribble S D. A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems. ACM SIGCOMM Computer Communication Review,2002,32(1):82-82 P
[12]郑纬民.对等计算研究概论.中国计算机学会通讯.2004：1-21页
[13]Liu H, Zhang L M, Zeng B. An Anonymous Trustful-Agents-Based Trust Model for P2P Network//2009 Asia-Pacific Conference on Information Processing.2009:426-429 P
[14]Bo J, Zhao J P. A Novel Anonymous P2P Resource Sharing System. Advanced Materials Research,2011,211:300-304 P
[15]Ayyasamy S, Sivanandam S N. Trust Based Content Distribution for Peer-To-Peer Overlay Networks. International Journal of Network Security & Its Applications IJNSA, Volume 2, Number 2,2010
[16]Lalande J F, Rodriguez D, Toinard C. Security properties in an open peer-to-peer network. Arxiv preprint arXiv:1004.0772,2010
[17]Liang Z. Research on Trust and Reputation Mechanism on P2P Network. Computer Security,2009,12
[18]Jing X I, Ping H U, Jian-de L U. Research on P2P Reputation Model with Uncertainty Theory. Computer Engineering,2009,35(8):158-160 P
[19]Madden M, Project P I & A L. The State of Music Online:Ten Years After Napster. Pew Internet & American Life Project,2009
[20]Patrick M, Subarna S, Ali H. M. Z. Napster and its Effects on the Music Industry:An Empirical Analysis. Journal of Social Sciences,2010,6(3):303-309 P
[21]Genutella. http://gnutella.wego.com
[22]Liang J, Kumar R, Ross K W. The kazaa overlay:A measurement study. Computer Networks Journal (Elsevier),2005,49(6)
[23]Good N S, Krekelberg A. Usability and privacy:a study of Kazaa P2P file-sharing//Proceedings of the SIGCHI conference on human factors in computing systems.2003:137-144 P
[24]Liang J, Kumar R, Ross K W. The FastTrack overlay:A measurement study. Computer Networks,2006,50(6):842-858 P
[25]Stoica I, Morris R, Karger D, et al. Chord:A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review,2001,31(4): 149-160 P
[26]Xiao-yun Z. Hybrid P2P Model Based on Chord Protocol. Computer Engineering,2010, 36(7):112-114 P
[27]Stoica I, Morris R, Karger D, et al. Chord:A scalable P2P lookup service for internet applications//Proc. of ACM SIGCOMM.2001,8
[28]Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network//Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications.2001:161-172 P
[29]Rowstron A, Druschel P. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems.2001
[30]Urdaneta G, Pierre G, Steen M V. A survey of DHT security techniques. ACM Computing Surveys (CSUR),2011,43(2):8 P
[31]Roncancio C, del Pilar Villamil M, Labbe C, et al. Data sharing in DHT based P2P systems. Transactions on Large-Scale Data-and Knowledge-Centered Systems Ⅰ,2009: 327-352 P
[32]Zhao B Y, Kubiatowicz J, Joseph A D. Tapestry:An infrastructure for fault-tolerant wide-area location and routing. Computer,2001,74(11-20):46 P
[33]Wells C. The OceanStore archive:Goals, structures, and selfrepair. UC Berkeley Masters Report,2002
[34]Rhea S, Eaton P, Geels D, et al. Awarded Best Student Paper!-Pond:The OceanStore Prototype//Proceedings of the 2nd USENIX Conference on File and Storage Technologies.2003:1-14 P
[35]others. Oceanstore:An architecture for global-scale persistent storage//Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating systems.2000
[36]Josang A, Ismail R, Boyd C. A survey of trust and reputation systems for online service provision. Decision Support Systems,2007,43(2):618-644 P
[37]Xiong L, Liu L. Peertrust:Supporting reputation-based trust for peer-to-peer electronic communities. Knowledge and Data Engineering, IEEE Transactions on,2004,16(7): 843-857 P
[38]Wang Y, Vassileva J. Trust and reputation model in peer-to-peer networks. Peer-to-Peer Computing,2003.(P2P 2003)//Proceedings, Third International Conference on.2003: 150-157 P
[39]Wei Y, Jin-Sheng L, Pei-Lin H. Distributed peer-to-peer trust model and computer simulation. Journal of System Simulation,2006,18(4):938-942 P
[40]Kamvar S D, Schlosser M T, Garcia-Molina H. The eigentrust algorithm for reputation management in p2p networks//Proceedings of the 12th international conference on World Wide Web.2003:640-651 P
[41]Aberer K, Despotovic Z. Managing trust in a peer-2-peer information system//Proceedings of the tenth international conference on Information and knowledge management.2001:310-317 P
[42]Yamamoto A, Asahara D, Itao T, et al. Distributed pagerank:A distributed reputation model for open peer-to-peer networks.2004
[43]Yu B, Singh M P. An evidential model of distributed reputation management//Proceedings of the first international joint conference on Autonomous agents and multiagent systems:part 1.2002:294-301 P
[44]Xi J, Nie P, Lu J. A P2P Trust Model Based on Dynamic Fuzzy Theory-BGTR//2008 International Symposiums on Information Processing.2008:187-191 P
[45]Wang X, Wang L. P2P Recommendation Trust Model//Eighth International Conference on Intelligent Systems Design and Applications.2008:591-595 P
[46]潘静.面向可信服务选取的基于声誉的推荐者发现方法.软件学报,2010,21(2)：388-400页
[47]Hui C, Zheng Q. A Trust Evaluation Model for P2P E-Commerce Systems//2008 International Conference on Computational Intelligence and Security.2008:500-505 P
[48]金瑜.一种新的P2P系统中基于双ratings的声誉管理机制.计算机研究与发展,2008,45(006)：942-950页
[49]李佳伦.一种具有时间衰减和主观预期的P2P网络信任管理模型.电子与信息学报,2009,31(11)：2786-2790页
[50]Biao C A I, Zhishu L, Yang C, et al. Trust Decision Making in Structured P2P Network//2009 International Conference on Communication Software and Networks. 2009:679-683 P
[51]Song S, Hwang K, Zhou R, et al. Trusted P2P transactions with fuzzy reputation aggregation. Internet Computing, IEEE,2005,9(6):24-34 P
[52]田春岐.一种基于推荐证据的有效抗攻击P2P网络信任模型.计算机学报,2008,31(2)：270-281页
[53]Resnick P, Zeckhauser R. Trust among strangers in Internet transactions. The economics of the Internet and e-commerce,2002,11:127-157 P
[54]Wang Q, Wang L. A Vector-Based Trust Model for P2P E-commerce//Fourth International Conference on Natural Computation.2008:117-123 P
[55]Liu F, Zhang W, Ding Y, et al. DynamicTrust:three-dimensional dynamic computing model of trust in peer-to-peer networks//Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation.2009:337-344 P
[56]姜守旭.一种P2P电子商务系统中基于声誉的信任机制.软件学报,2007,18(10)：2551-2563 P
[57]Liu Y, Xiong N, Li Y, et al. A secure model for controlling the hubs in P2P wireless network based on trust value. Computer Communications,2010,33(8):997-1004 P
[58]Meghanathan N. Recent Trends in Network Security and Applications:Third International Conference, CNSA 2010, Chennai, India. July 2010. Proceedings. Springer-Verlag New York Inc,2010:23-25 P
[59]Jiang X, Ye L. Reputation-Based Trust Model and Anti-attack Mechanism in P2P Networks//2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing.2010:498-501 P
[60]Bontrager M D. Peering into the Future:Peer-to-Peer Technology as a Model for Distributed Joint Battlespace Intelligence Dissemination and Operational Tasking. AIR UNIV MAXWELL AFB AL SCHOOL OF ADVANCED AIRPOWER STUDIES, 2001
[61]Marti S, Garcia-Molina H. Limited reputation sharing in P2P systems//Proceedings of the 5th ACM conference on Electronic commerce.2004:91-101 P
[62]Liu Y, Liu X, Xiao L, et al. Location-aware topology matching in P2P systems//INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies.2004,4:2220-2230 P
[63]Castro M, Druschel P, Hu Y C, et al. Topology-aware routing in structured peer-to-peer overlay networks//Future Directions in Distributed Computing.2003:103-107 P
[64]Junginger M, Lee Y. The Multi-Ring topology-High-Performance Group Communication in Peer-to-Peer Networks.2002
[65]Small T, Li B, Liang B. Topology affects the efficiency of network coding in peer-to-peer networks//Communications,2008. ICC08. IEEE International Conference on.2008:5591-5597 P
[66]Kurmanowytsch R, Jazayeri M, Kirda E. Towards a hierarchical, semantic peer-to-peer topology//Peer-to-Peer Computing,2002.(P2P 2002). Proceedings. Second International Conference on.2002:167-168 P
[67]Piatek M, Isdal T, Krishnamurthy A, et al. One hop reputations for peer to peer file sharing workloads//Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation.2008:1-14 P
[68]Kamvar S D, Schlosser M T. Method and system for reputation management in peer-to-peer networks. Google Patents,2010
[69]Cornelli F, Damiani E, di Vimercati S, et al. Implementing a reputation-aware gnutella servent. Web Engineering and Peer-to-Peer Computing,2010:321-334 P
[70]袁巍.一种P2P网络分布式信任模型及仿真.系统仿真学报,2006,18(004)：938-942页
[71]Liu Y, Zhuang Z, Xiao L, et al. A distributed approach to solving overlay mismatching problem//Distributed Computing Systems,2004. Proceedings.24th International Conference on.2004:132-139 P
[72]Yamamoto A, Asahara D, Itao T, et al. Distributed pagerank:A distributed reputation model for open peer-to-peer networks.2004:389-394P
[73]Mischke J, Stiller B. Peer-to-peer and distributed search in fixed and mobile environments.2004
[74]Cai M, Frank M. RDFPeers:a scalable distributed RDF repository based on a structured peer-to-peer network//Proceedings of the 13th international conference on World Wide Web.2004:650-657 P
[75]罗杰文. Peer to Peer (p2p)综述. http://www.intsci.ac.cn/users/luojw/P2P/ index.html 2005,11.
[76]Li J. On-demand file transfers for mass P2P file sharing. Google Patents,2009
[77]DE CAPITANI D I V, DAMIANI E, SAMARATI P. Managing and sharing servants reputations in P2P systems. IEEE transactions on knowledge and data engineering,2003, 15(4):840-854P
[78]Rout B K, Sahu S. Extending JXTA for P2P File Sharing Systems.2009
[79]Chang T T. Performance enhancement of the P2P file sharing on MANET by using UWB.2010
[80]Gasti P, Merlo A, Ciaccio G, et al. On the Integrity of Network Coding-based Anonymous P2P File Sharing Networks//2010 Ninth IEEE International Symposium on Network Computing and Applications.2010:192-197 P
[81]郑纬民.P2P系统发展历史及应用.中国教育网络,2005(007)：23-26页
[82]金舒.基于P2P模型的网络入侵检测系统PeerIDS计算机工程与应用,2006,42(009)：114-119页
[83]Korpela E J, Cobb J, Lebofsky M, et al. Candidate Identification and Interference Removal in SETI@ home. Communication With Extraterrestrial Intelligence (Ceti), 2011:37 P
[84]Werthimer D, Cobb J, Lebofsky M, et al. SETI@ HOME—massively distributed computing for SETI. Computing in Science and Engineering,2001,3(1):78-83 P
[85]Korpela E, Werthimer D, Anderson D, et al. Seti@ home-massively distributed computing for seti. Computing in Science & Engineering,2001,3(1):78-83 P
[86]Castro M, Druschel P, Ganesh A, et al. Security for structured peer-to-peer overlay networks//Proc. of the Fifth Symposium on Operating System Design and Implementation (OSDI2002).2002:261-269P
[87]Locasto M E, Parekh J J, Keromytis A D, et al. Towards collaborative security and P2P intrusion detection//Information Assurance Workshop,2005. IAW05. Proceedings from the Sixth Annual IEEE SMC.2005:333-339 P
[88]Sit E, Morris R. Security considerations for peer-to-peer distributed hash tables. Peer-to-Peer Systems,2002:261-269 P
[89]Wallach D. A survey of peer-to-peer security issues. Software Security-Theories and Systems,2003:253-258 P
[90]黄全能.对等网络信誉机制研究综述.小型微型计算机系统,2006,27(007)：1175-1181页
[91]窦文.构造基于推荐的Peer-to-Peer环境下的Trust模型Journal of Software,2004,15(4)：571-583页
[92]张骞.混合P2P环境下有效的查询扩展及其搜索算法Journal of Software,2006, 17(4):782-793页
[93]Gambetta D. Can we trust. Trust:Making and breaking cooperative relations,1988,213: 238 P
[94]Gambetta D. Trust:Making and breaking cooperative relations.1990.
[95]Dasgupta P. Trust as a Commodity. Trust:Making and Breaking Cooperative Relations, electronic edition, Department of Sociology, University of Oxford,2000:49-72 P
[96]Abdul-Rahman A, Hailes S. Supporting trust in virtual communities//hicss.2000:1-9P
[97]Dewan P, Dasgupta P. P2p reputation management using distributed identities and decentralized recommendation chains. IEEE Transactions on Knowledge and Data Engineering,2009:1000-1013 P
[98]Satsiou A, Tassiulas L. Reputation-based resource allocation in P2P systems of rational users. IEEE Transactions on Parallel and Distributed Systems,2009:466-479 P
[99]Sabater J, Sierra C. Reputation and social network analysis in multi-agent systems//Proceedings of the first international joint conference on Autonomous agents and multiagent systems:part 1.2002:475-482 P
[100]Wang W, Wang X, Pan S, et al. A New Global Trust Model Based on Recommendation for Peer-To-Peer Network//2009 International Conference on New Trends in Information and Service Science.2009:325-328 P
[101]Gu C, Zhang S, Feng H, et al. A Novel Trust Management Model for P2P Network with Reputation and Risk Evaluation//2010 International Conference on E-Business and E-Government.2010:3544-3547 P
[102]Zhen-hua T A N, Wei C, Zhi-liang Z H U, et al. A Trust Model with Multidimensional Factor for P2P Routing. Journal of Northeastern University (Natural Science),2010, 31(11):1574-1577P
[103]Zhi-guo S H I, Ji-wei L I U, Zhi-liang W. Dynamic P2P trust model based on time-window feedback mechanism. Journal on Communications,2010
[104]Shi H, Cao W, Zhu S L, et al. Application of evidence theory in optimum route planning. Jisuanji Gongcheng yu Yingyong(Computer Engineering and Applications),2009, 45(26) P
[105]Chen B, Zhang B, Zhu W. Combined trust model based on evidence theory in iterated prisoners dilemma game. International Journal of Systems Science,2011,42(1):63-80 P
[106]Couso I, Moral S. Independence concepts in evidence theory. International journal of approximate reasoning,2010.
[107]Aspnes J, Shah G. Skip graphs. ACM Transactions on Algorithms (TALG),2007,3(4): 37-39 P
[108]Dempster A P. Upper and Lower Probabilities Induced by a Multi-valued Mapping. Annals of Mathematical Statistics,38:325-39 P
[109]Miranda E, De Cooman G, Couso I. Lower previsions induced by multi-valued mappings. Journal of statistical planning and inference,2005,133(1):173-197 P
[110]Shafer G. A mathematical theory of evidence Princeton university press Princeton, NJ, 1976.
[111]Poroseva S V, Lay N, Hussaini M Y. Multimodel Approach Based on Evidence Theory for Forecasting Tropical Cyclone Tracks. Monthly Weather Review,2010,138(2): 405-420 P
[112]Junmao Z, Shoubao Y, Jianping F, et al. A grid & P2P trust model based on recommendation evidence reasoning. Journal of Computer Research and Development, 2005,42(5):797-803 P
[113]J Φ sang A, Knapskog S J. A metric for trusted systems//In Proceedings of the 21st National Security Conference. NSA.1998
[114]J Φ sang A. The right type of trust for distributed systems//Proceedings of the 1996 workshop on New security paradigms.1996:119-131 P
[115]J Φ sang A. A subjective metric of authentication. Computer Security-ESORICS 98, 1998:329-344 P
[116]马丽丽.基于语义聚类的层次化语义覆盖网构建方法研究.计算机与数字工程,2008,36(010)：135-139页
[117]乔百友.一种基于语义的super-peer网络构建方法.东北大学学报：自然科学版,2008(001)：61-64页
[118]张伟.基于语义的动态超节点网络模型及搜索算法.中南大学博士学位论文。2009：3-18页
[119]孙亮.P2P网络中资源管理机制的研究.北京邮电大学博士学位论文.2007：5-20页
[120]Adar E, Huberman B A. Free riding on gnutella. First Monday,2000,5(10):2-13 P
[121]Hughes D, Coulson G, Walkerdine J. Free riding on Gnutella revisited:the bell tolls. IEEE Distributed Systems Online,2005:1P
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |