计算机专业外文翻译---p2p信任模型(编辑修改稿)

计算机专业外文翻译---p2p信任模型(编辑修改稿)内容摘要：

rs and describes a variety of malicious acts P2P munity will not only deal satisfaction feedback for evaluating the parameters of the trust, taking the total number of transactions, feedbackcredibility, the transaction context factor, the munity context results show that the trust model can effectively inhibit the malicious node . Mekouar made part of the distributed P2P work (such as KaZaa) the credibility of the management mechanism nodes in RMS_PDN passed between nodes in the trust evaluation, so that each supernode to its leaf node record of effective contribution to the system and the credibility as a leaf , all the nodes directly RMS_PDN feedback vulnerable to malicious nodes of joint fraud attacks. Global trust model ignores the private trust of features for a particular node, other nodes on the trust of his values are the global trust model vulnerable to malicious nodes joint fraud plex needs of global trust model of cooperation between the processing nodes trust the information, puting and munication costs are addition, largescale P2P work, each node in the global trust value puting the necessity and feasibility of further study. (2) the local trust model On P2P works have mostly focused on the trust model provides a mechanism which nodes can share information for a given node, the local trust value . Wang proposed a P2P environment based on Bayesian work trust trust model describes the main focus on different aspects of trust, which nodes can be based on different scenarios for ondemand access to different aspects of the performance of the trust model can be adapted to smaller scale Gnutella work, or nodes of the Gnutella work interactive . Lee proposed a fully distributed way to store the user39。 s credit other trust system is different in the NICE system, the node i trust information stored in other nodes of the services provided i satisfied with feedback, so trust in the information storage node PeerTrust proposed mechanism allows nodes to provide feedback according to the node with its own individual choices similar feedback to calculate a given node of the subjective reliability of this method to 7 prevent fraud attacks the joint node, but in largescale P2P works because of the sparsity of the transaction, there is not necessarily sufficient similarity with the individual nodes. Share information based on local trust model, shared access to information in two ways: first, to the other nodes by flooding a request for trust, poor scalability of the method。 the other is the mechanism through the use of P2P DHT storage systems such asChord and other access, this method is not suitable for frequent node join and leave the system P2P , such sharing of information based on local trust model is not suitable for management information between nodes can not directly interact with some of the distributed P2P work. Conclusion In the absence of an effective management mechanism in P2P works, the establishment can suppress all the attack patterns of the trust model is very difficult, apart from the node to be able to suppress the attacks, the time of the establishment of trust model, trust model to fully consider whether the scale can be extendednature of trust in the trusted puting and information storage scalability, and trust in the process of information transmission bandwidth overhead addition, dynamic access to the work node frequent cases, the trust model of fault tolerance or robustness also needs to be stressed. In fact, in the P2P work trust model, the munity should be fully learn the true reputation management system, different scenarios for the transaction to establish credibility for the node, and nodes into a particular group to restrict and regulate the nodes Xing , based on group reputation mechanism is the direction of future research, research work has been useful in the exploration of aspects, but still not addition, the model of incentive mechanisms based on trust, not only to consider the P2P works of cooperation between the internal nodes should also be considered P2P applications and works of cooperation between other example, in P2P file sharing applications, when the work bandwidth utilization reaches a certain threshold, still predatory on the node using the work resources to applications and works in harmony with other applications, P2P applications is the development of longterm solution. 《 Journal of Harbin Institute of Technology》 8 Paper2 Object landscapes and lifetimes Technically, OOP is just about abstract data typing, inheritance, and polymorphism, but other issues can be at least as important. The remainder of this section will cover these issues. One of the most important factors is the way objects are created and destroyed. Where is the data for an object and how is the lifetime of the object controlled? There are different philosophies at work here. C++ takes the approach that control of efficiency is the most important issue, so it gives the programmer a choice. For maximum runtime speed, the storage and lifetime can be determined while the program is being written, by placing the objects on the stack (these are sometimes called automatic or scoped variables) or in the static storage area. This places a priority on the speed of storage allocation and release, and control of these can be very valuable in some situations. However, you sacrifice flexibility because you must know the exact quantity, lifetime, and type of objects while you39。 re writing the program. If you are trying to solve a more general problem such as puteraided design, warehouse management, or airtraffic control, this is too restrictive. The second approach is to create objects dynamically in a pool of memory called the heap. In this approach, you don39。 t know until runtime how many objects you need, what their。