CN101626336A - Method for improving P2P overlay network interaction performance by using trust mechanism - Google Patents
Method for improving P2P overlay network interaction performance by using trust mechanism Download PDFInfo
- Publication number
- CN101626336A CN101626336A CN200810040409A CN200810040409A CN101626336A CN 101626336 A CN101626336 A CN 101626336A CN 200810040409 A CN200810040409 A CN 200810040409A CN 200810040409 A CN200810040409 A CN 200810040409A CN 101626336 A CN101626336 A CN 101626336A
- Authority
- CN
- China
- Prior art keywords
- node
- service
- belief
- degree
- trust
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a method for improving P2P overlay network interaction performance by using a trust mechanism. The method comprises the following steps: (1) sending out service query message to a network by a request node; (2) judging whether a neighbor node provides the service, if so, executing step (4) and otherwise, executing step (3); (3) forwarding the service request to other nodes, and inquiring the node which provides the service; (4) providing response message returned by a service node to the request node, and positioning the position of the service providing node by the request node according to the response message to carry out cooperation; (5) after the cooperation is finished, measuring and providing trust level of the service node, and forwarding the trust level to the neighbor node and the nodes on a query path; and (6) according to the measured trust level, updating a trust link relation between the nodes. Compared with the prior art, the method of the invention is not only favorable for improving the efficiency of the nodes to discover resources and improving the interaction performance of the whole P2P network, but also can gather the nodes around a trustful node with strong service capacity and ensure the reliability of resource selection.
Description
Technical field
The present invention relates to the P2P network, particularly relate to a kind of method of utilizing faith mechanism to improve the P2P overlay network interaction performance.
Background technology
Utilizing the P2P overlay network to carry out resource organizations is a kind of better method of utilizing Internet resources, the P2P network of current popular is the overlay network on a kind of Internet of being structured in, node in the network can be undertaken mutual each other by setting up direct linking relationship, and need not consider correlative factors such as geographical position, reflected the self-organizing attribute of resource.The network topology change that the self-organizing behavior of node causes can improve the search efficiency of resource, the resource-sharing of improvement, thus system resource is utilized fully.
In the P2P network, node has been represented the domestic consumer in the real world, it is in network when mutual each other, tend to carry out around certain preference, and just because of the similitude of preference between node, make to make up closer interactive relation between the node with same or similar preference, thereby can improve the searching of resource, discovery and sharing efficiency effectively.Yet because the P2P network is a network opening, dynamic in essence, unreliable or intermittent resource participation can account for suitable ratio.This class need rely on the similitude that clear and definite similarity measure comes the decision node preference based on the scheme of preference, and the actual reliability of service that provides of node is not provided.For a node, be difficult to guarantee the reliability of cooperative node behavior in the reciprocal process, thereby its Service Source that provides also has bigger potential safety hazard.
Aspect the topological structure of P2P overlay network, many existing methods concentrate on and improve on the search efficiency.Solve matching problem P2P topology and bottom physical network between by selecting the nearer node of physical location as neighbours based on the topological structure method of node physical location, thus the performance of raising P2P network.This mechanism is not paid close attention to the problem of malicious node in the P2P network.Consider that based on the topological structure method of preference the preference information of resource can improve sharing and search efficiency of resource effectively.The subject matter that this class methods exist is to consider not that node is actual the ability of service and the reliability of nodes ' behavior are provided, and also quite few based on the method for trust aspect.
Summary of the invention
Technical problem to be solved by this invention is exactly to provide a kind of method of utilizing faith mechanism to improve the P2P overlay network interaction performance for the defective that overcomes above-mentioned prior art existence.
The object of the invention can be achieved through the following technical solutions: a kind of method of utilizing faith mechanism to improve the P2P overlay network interaction performance is characterized in that this method comprises:
(1) requesting node sends service query message in network;
(2) whether its neighbor node can provide this service, if, execution in step (4) then, if not, execution in step (3) then;
(3) transmit this service request to other nodes, inquire the node that this service is provided;
(4) provide service node to return response message to requesting node, positioning service provides the position of node to cooperate to requesting node according to response message;
(5) after cooperation was finished, tolerance provided the degree of belief of service node, and degree of belief is transmitted to node in neighbor node and the query path;
(6), upgrade internodal trust linking relationship according to the degree of belief of measuring.
The internodal trust linking relationship of described renewal comprises:
If service node is provided is the trusty non-neighbor node of requesting node, it is minimum and less than the node that the service node degree of belief is provided then to search degree of belief in neighbor node, and be probability so that the service node degree of belief to be provided, replace the link of degree of belief minimum node with the link that service node is provided;
If service node is provided is the neighbor node of requesting node, it is maximum and greater than the node that the service node degree of belief is provided then to search degree of belief in non-neighbor node trusty, and be probability with degree of belief maximum node degree of belief, replace the link of degree of belief maximum node with the link that service node is provided.
Compared with prior art, method of the present invention not only helps the efficient that node is found resource, improves the interactive performance of whole P2P network, and node is accumulated in around the stronger trusted node of service ability, guarantees the reliability that resource is chosen.
Description of drawings
Fig. 1 is a flow chart of the present invention;
Fig. 2 is the Service Source inquiry and the feedback schematic diagram of embodiments of the invention;
Fig. 3 is that the trust linking relationship of embodiments of the invention upgrades schematic diagram.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
As shown in Figure 1, a kind of method of utilizing faith mechanism to improve the P2P overlay network interaction performance, this method comprises:
(1) requesting node sends service query message in network;
(2) whether its neighbor node can provide this service, if, execution in step (4) then, if not, execution in step (3) then;
(3) transmit this service request to other nodes, inquire the node that this service is provided;
(4) provide service node to return response message to requesting node, positioning service provides the position of node to cooperate to requesting node according to response message;
(5) after cooperation was finished, tolerance provided the degree of belief of service node, and degree of belief is transmitted to node in neighbor node and the query path;
(6), upgrade internodal trust linking relationship according to the degree of belief of measuring.
The internodal trust linking relationship of described renewal comprises:
If service node is provided is the trusty non-neighbor node of requesting node, it is minimum and less than the node that the service node degree of belief is provided then to search degree of belief in neighbor node, and be probability so that the service node degree of belief to be provided, replace the link of degree of belief minimum node with the link that service node is provided; If service node is provided is the neighbor node of requesting node, it is maximum and greater than the node that the service node degree of belief is provided then to search degree of belief in non-neighbor node trusty, and be probability with degree of belief maximum node degree of belief, replace the link of degree of belief maximum node with the link that service node is provided.
Embodiment
In the interpersonal relationships net, trusting relationship is the core of interpersonal relationships, and trust is the evaluation to the credible behavior of particular individual, and individual confidence level often depends on the recommendation of other individualities.There is very big similitude P2P system and interpersonal relationships net, and this shows: 1. the node in the network can stay the information of its behavioural characteristic of reflection with other node cooperation the time; 2. node has sufficient right to choose for collaboration object; 3. node is obligated provides recommendation information for other node in the network.
We are defined as " trust " in the P2P network environment: in certain context environmental, according to the degree of reliability that nodes ' behavior embodied, provide the assessment of the ability of service (resource) to destination node, comprise the observation of node behavior in the past and other node recommendation information to this node.In general, trusting relationship is not absolute, is dynamic change.Also there is the relation of recommending in trust, and when not direct before the node and certain node contacts, can only lean on other node to provide recommendation information as a reference, judges according to the strategy of oneself then.Trusting is not simple letter and do not believe, node has degree to the trust of another one node.
Based on above-mentioned consideration, we investigated in the time period, and the trust problem under the same background in the P2P system is set up Mathematical Modeling to it then.For two joints in the P2P network, have between them directly alternately, also may there be one or more intermediate nodes (being also referred to as recommended node).If two nodes have directly alternately, then can manage to estimate the probability of direct interaction success, be called direct degree of belief assessment.Simultaneously can also produce contact as recommended node by node z between x and y, further obtain the information of interaction success between x and y, be called the recommendation trust degree and assess by the direct interactive relation between z and the y.These two kinds of probability are merged the mutual total degree of belief assessment models of succeeding.
In information management, resource-sharing and the information retrieval etc. of P2P network are used, at first requesting node sends service query message in network, service providing node is after receiving query messages, if described service request can be provided, then return a response message to requesting node, requesting node provides the position of node again according to the path positioning service of message.
Fig. 1 is Service Source inquiry and feedback example: node S sends service query message in the network, node a1, and b1, c1, d1, e1 transmits to other nodes when not inquiring service; The service that node a3 discovery is searched, and to node S transmission corresponding message; Node S finishes the cooperation back with node a3 and will forward node a1 and the a2 that the degree of belief assessment result of a3 is issued in the corresponding query path be upgraded by top method, and to the neighbor node b1 of oneself, c1, d1, e1 send and upgrade the result simultaneously.
Along with the accumulation of interaction experiences between node, and the factors such as variation of destination node behavior have all caused destination node is trusted the renewal of judging.Therefore, in order to reflect the variation of this trust factor, provided a link update method, upgraded internodal trust linking relationship, so that the node in the network is set up more closely interactive relation with the node with stronger service ability according to trust factor based on faith mechanism.
Self-organizing method based on the randomness connection mechanism is proposed.Note
Be the degree of belief of x to y, N
xBe the neighbor node set of x, M
xFor node x has the node set of its trust record, upgraded the degree of belief of a destination node y at x
After, if y ∈ M
x_ N
x, N
xThe degree of belief minimum of middle z, and
, then with probability
Replace link with the link of y with z; If y ∈ N
x, M
x_ N
xThe degree of belief maximum of middle z, and
, then with probability
Replace link with the link of y with z.
Node is by upgrading the trust linking relationship with other node, realization is with direct opening relationships between the stronger node of service provision capacity, increased the content accessibility of the service search of node, reduced the search time of service, the flow of message in the corresponding hop count of also having cut down query messages and the network.The renewal of node trust linking relationship is presented as the variation of resource network topology.As shown in Figure 2, node S passes through node a3, b1, and c2, d1's is mutual, by the degree of belief assessment, sets up with the direct trust linking relationship between them.
Claims (2)
1. method of utilizing faith mechanism to improve the P2P overlay network interaction performance is characterized in that this method comprises:
(1) requesting node sends service query message in network;
(2) whether its neighbor node can provide this service, if, execution in step (4) then, if not, execution in step (3) then;
(3) transmit this service request to other nodes, inquire the node that this service is provided;
(4) provide service node to return response message to requesting node, positioning service provides the position of node to cooperate to requesting node according to response message;
(5) after cooperation was finished, tolerance provided the degree of belief of service node, and degree of belief is transmitted to node in neighbor node and the query path;
(6), upgrade internodal trust linking relationship according to the degree of belief of measuring.
2. a kind of method of utilizing faith mechanism to improve the P2P overlay network interaction performance according to claim 1 is characterized in that the internodal trust linking relationship of described renewal comprises:
If service node is provided is the trusty non-neighbor node of requesting node, it is minimum and less than the node that the service node degree of belief is provided then to search degree of belief in neighbor node, and be probability so that the service node degree of belief to be provided, replace the link of degree of belief minimum node with the link that service node is provided;
If service node is provided is the neighbor node of requesting node, it is maximum and greater than the node that the service node degree of belief is provided then to search degree of belief in non-neighbor node trusty, and be probability with degree of belief maximum node degree of belief, replace the link of degree of belief maximum node with the link that service node is provided.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810040409A CN101626336A (en) | 2008-07-09 | 2008-07-09 | Method for improving P2P overlay network interaction performance by using trust mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810040409A CN101626336A (en) | 2008-07-09 | 2008-07-09 | Method for improving P2P overlay network interaction performance by using trust mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101626336A true CN101626336A (en) | 2010-01-13 |
Family
ID=41522030
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810040409A Pending CN101626336A (en) | 2008-07-09 | 2008-07-09 | Method for improving P2P overlay network interaction performance by using trust mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101626336A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546593A (en) * | 2010-12-10 | 2012-07-04 | 中国科学院声学研究所 | Node cooperation method and system in peer-to-peer network streaming media system |
| CN105282793A (en) * | 2014-05-29 | 2016-01-27 | 普天信息技术有限公司 | Method and device for negotiating UE (User Equipment) discovery resources between adjacent base stations in D2D (Device to Device) |
| CN106059947A (en) * | 2016-05-27 | 2016-10-26 | 北京邮电大学 | Method for dynamically optimizing performance of overlay networks |
| CN106612326A (en) * | 2016-11-30 | 2017-05-03 | 安徽大学 | IoT (Internet of Things) resource searching method |
| CN113901144A (en) * | 2021-10-15 | 2022-01-07 | 北京智融云河科技有限公司 | Query method, device and storage medium under non-whole network consensus block chain |
-
2008
- 2008-07-09 CN CN200810040409A patent/CN101626336A/en active Pending
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546593A (en) * | 2010-12-10 | 2012-07-04 | 中国科学院声学研究所 | Node cooperation method and system in peer-to-peer network streaming media system |
| CN102546593B (en) * | 2010-12-10 | 2014-09-10 | 中国科学院声学研究所 | Node cooperation method and system in peer-to-peer network streaming media system |
| CN105282793A (en) * | 2014-05-29 | 2016-01-27 | 普天信息技术有限公司 | Method and device for negotiating UE (User Equipment) discovery resources between adjacent base stations in D2D (Device to Device) |
| CN105282793B (en) * | 2014-05-29 | 2018-10-30 | 普天信息技术有限公司 | Negotiate the method and device that UE has found resource in D2D between adjacent base station |
| CN106059947A (en) * | 2016-05-27 | 2016-10-26 | 北京邮电大学 | Method for dynamically optimizing performance of overlay networks |
| CN106059947B (en) * | 2016-05-27 | 2019-05-03 | 北京邮电大学 | A kind of method of dynamic optimization overlay network performance |
| CN106612326A (en) * | 2016-11-30 | 2017-05-03 | 安徽大学 | IoT (Internet of Things) resource searching method |
| CN113901144A (en) * | 2021-10-15 | 2022-01-07 | 北京智融云河科技有限公司 | Query method, device and storage medium under non-whole network consensus block chain |
| CN113901144B (en) * | 2021-10-15 | 2024-02-06 | 北京智融云河科技有限公司 | Query method, device and storage medium under non-whole network consensus block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101102250B (en) | Distributed hashing mechanism for self-organizing networks | |
| Li et al. | A decentralized trustworthy context and QoS-aware service discovery framework for the internet of things | |
| US20080097994A1 (en) | Method of extracting community and system for the same | |
| JP2009545072A (en) | Method and computer readable medium for updating replicated data stored in a plurality of nodes organized in a hierarchy and linked through a network (system for optimally trade-off replication overhead and consistency level in distributed applications) And equipment) | |
| Liu et al. | An efficient and trustworthy P2P and social network integrated file sharing system | |
| CN109635019A (en) | Request processing method, device, equipment and storage medium | |
| CN101626336A (en) | Method for improving P2P overlay network interaction performance by using trust mechanism | |
| US20090313102A1 (en) | Peer to peer social networking | |
| Ciobanu et al. | Data dissemination in opportunistic networks | |
| TalebiFard et al. | Context-aware dissemination of information and services in heterogeneous network environments | |
| CN103001874B (en) | Delay tolerant mobile social network routing method based on node label set | |
| CN101854387A (en) | P2P flow optimization method and system based on distributed index server architecture | |
| Jiang et al. | Taming propagation delay and fork rate in bitcoin mining network | |
| Karthik et al. | An ontology based trust framework for sensor-driven pervasive environment | |
| CN108173899B (en) | Information processing method and device of block chain | |
| Khamayseh et al. | Dynamic framework to mining internet of things for multimedia services | |
| CN103209207A (en) | Peer-to-peer network structure achievement method | |
| Wurst et al. | Distributed feature extraction in a p2p setting—a case study | |
| Lazaro et al. | Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments | |
| CN103905249A (en) | Mobile Internet network monitoring management method based on JXME | |
| Wang et al. | Bayesian Approach with Maximum Entropy Principle for trusted quality of Web service metric in e‐commerce applications | |
| Pallickara et al. | Incorporating an XML Matching Engine in Distributed Brokering Systems. | |
| Jung et al. | PageRank revisited: On the relationship between node degrees and node significances in different applications | |
| Hussain et al. | An enhanced communication mechanism for partitioned social overlay networks using modified multi-dimensional routing | |
| Baldoni et al. | Improving validity of query answering in dynamic systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20100113 |