CN1937584A - Non-structured reciprocal network system and its resource query and route updating method - Google Patents
Non-structured reciprocal network system and its resource query and route updating method Download PDFInfo
- Publication number
- CN1937584A CN1937584A CNA2006101220625A CN200610122062A CN1937584A CN 1937584 A CN1937584 A CN 1937584A CN A2006101220625 A CNA2006101220625 A CN A2006101220625A CN 200610122062 A CN200610122062 A CN 200610122062A CN 1937584 A CN1937584 A CN 1937584A
- Authority
- CN
- China
- Prior art keywords
- resource
- feedback
- neighbor node
- resource lookup
- response message
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to an unstructured peer-to-peer network system convenient to resource inquiry and the resource finding and route updating method thereof, where node equipment of the system comprises: storage unit, updating unit and resource finding unit. And it can raise resource finding efficiency and besides, avoid transmitting a large amount of unnecessary inquiry information, thus reducing unnecessary network load.
Description
Technical field
The present invention relates to the peer-to-peer network technology, in particular, the present invention relates to a kind of Unstructured Peer-to-Peer Network system and resource lookup and route renewing method of being convenient to resource query.
Background technology
Peer-to-peer network is very popular at present application technology, and so-called peer-to-peer network is meant a kind of distributed network system (DNS), and in this network, all nodes all are reciprocity.Usually, different according to nodal information storage and way of search, common, peer-to-peer network can be divided into 2 big classes: structuring (Structured) peer-to-peer network and destructuring (Unstructured) peer-to-peer network system.
In the structured p2p network system, each node is only stored the index of information specific or customizing messages.And in non-structured P2P system, the information or the information index (as pointer and IP address) of each node storage self because the uncertainty of resource distribution in Unstructured Peer-to-Peer Network, make node search the resource very difficulty that becomes.Usually, adopt the mode of inundation (flooding) to come the route query messages when in Unstructured Peer-to-Peer Network, searching resource, be that each receives that the node of query messages is transmitted to all neighbor nodes (setting up direct-connected node with present node) with this query messages, and the response message result of coupling inquire about the promoter by reverse the returning to of the propagation path of query messages.But the shortcoming of this mode is that node has been transmitted a large amount of unnecessary query messages in each query script, has caused extra network burden.
In addition, proposed in the prior art a kind of adaptive, based on the search of the inquiry method for routing self-adaptive detection of probability (adaptive probabilistic search APS) improves the inquiry route and gets efficient, and its principle is as follows:
Each node in the Unstructured Peer-to-Peer Network system is preserved a partial indexes table, (comprise by other node and initiating, the inquiry that this node is transmitted) resource that each of described partial indexes table is crossed corresponding to this querying node.The index value of each has reflected in the concordance list: when inquiring about this resource next time, this node is selected the relative probability of which neighbor node transmission or forwarding inquiries message.
Inquiry is based on a k migration person (walker) and based on probability forwarding mechanism realization in APS:
At first, the inquiry promoter selects k node (if k＞=N, query messages sends to all neighbor nodes) to send query messages in its N neighbor node; Each receives that the node of query messages searches relevant resource in the shared resource of oneself, if found, and the end of this migration person's success inquiry.If do not find, query messages will be forwarded to a neighbor node.This process lasts till that all migration persons finish migration (not still success of tube failure).The inquiry promoter sends to k neighbor node with query messages, and remaining node only is transmitted to a neighbor node.In the process of transmitting, each node is selected neighbor node forwarding inquiries message according to the pairing probability of index value.When two migration persons of same inquiry arrive same node, second migration person finishes with failure.
Index value upgrades in the following manner in APS: give 1 or k neighbor node transmission query messages when a node, it increases the relative probability of this node in advance, promptly supposes migration person's meeting success (optimistic strategy); Perhaps reduce the relative probability of this node in advance, promptly suppose migration person's can fail (pessimistic strategy).For optimistic strategy, when the end of migration person's success, do not do any renewal; And when migration person failed, all nodes all needed to reduce the corresponding index value of the neighbor node of transmitting this inquiry above migration person's the entire path.For pessimistic strategy, when the end of migration person's success, all nodes all need to increase the corresponding index value of the neighbor node of transmitting this inquiry above migration person's the entire path; And when migration person fails, do not do any renewal.
Fig. 1 is for adopting an object lesson of APS query script.Wherein the partial indexes table is as shown in table 1
Table 1
| Index | Initial value | After route finishes | After upgrading end |
| A-＞B | 30 | 20 | 20 |
| B-＞C | 30 | 20 | 20 |
| C-＞D | 30 | 20 | 20 |
| A-＞E | 30 | 20 | 40 |
| E-＞F | 30 | 20 | 40 |
| A-＞G | 30 | 30 | 30 |
Node A initiates an inquiry, and corresponding resource is on node F.Suppose that all index values relevant with this resource all are 30, and adopt pessimistic strategy.The solid line of band arrow has been represented the path of two migration person's processes.In routing procedure, the index value of selecteed neighbor node reduces by 10.Through the path (A, B, C, migration person D) has failed, and through path (A, E, F) migration person success.Renewal process is carried out (direction of dotted arrow indication) by the migration person of success along the reverse path of route.During the identical resource of one query instantly, it is 2/9 (20/ (20+40+30)) that node A selects the probability of Node B, and selecting the probability of E is 4/9, and selecting the probability of G is 3/9.
There is following defective in the update strategy of index value behind the strategy of the inquiry route of the APS that above-mentioned prior art adopts and the poll-final:
Behind the APS poll-final, successfully find all nodes on the path of resource to upgrade its corresponding index value with certain amplitude, but the index value of described renewal can not be near resource distribution actual in the network, the resource lookup routing iinformation that is described index value representative is inaccurate, thereby causes resource lookup efficient not high.
Summary of the invention
The technical problem that the present invention solves provides a kind of Unstructured Peer-to-Peer Network system and resource lookup and route renewing method, its inquiry routing iinformation is more near resource distribution actual in the network, can improve resource lookup efficient, avoid simultaneously transmitting a large amount of unnecessary query messages, reduced unnecessary offered load as the inundation mode.
For addressing the above problem, the node device of a kind of Unstructured Peer-to-Peer Network of the present invention system includes:
Memory cell is used to store the resource lookup routing iinformation of probability right of selected this resource of inquiry of corresponding each resource of each neighbor node equipment of this node device;
Upgrade processing unit, be used for the resource lookup routing iinformation of probability right of selected this resource of inquiry of mathematical expectation updated stored unit respective neighbor node device correspondence of the response message feedback quantity of the resource lookup received with each neighbor node equipment;
The resource lookup unit is used for selecting neighbor node equipment to carry out resource lookup according to the resource lookup routing iinformation of described renewal.
Wherein, described renewal processing unit specifically comprises:
Response message feedback quantity determining unit, the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received;
Updating block, the mathematical expectation of the response message feedback quantity of the mathematical expectation of the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received and the resource lookup received with described each neighbor node equipment are replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
Wherein, updating block specifically comprises:
Current value of feedback accuracy unit is used for determining current value of feedback accuracy;
Accumulative total value of feedback accuracy determining unit is used for determining accumulative total value of feedback accuracy;
Current value of feedback relative importance determining unit is used for determining current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy;
Calculate determining unit, the probability right that is used for selected this resource of inquiry of this neighbor node equipment upgraded according to the last time inquiry of the response message feedback quantity of current value of feedback relative importance and resource lookup and storage calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received;
Replace processing unit, the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment of determining with described calculating determining unit is received is replaced the probability right of selected this resource of inquiry of this neighbor node equipment that the last time inquiry of storage upgrades.
Wherein, described current value of feedback accuracy adopts following formula to calculate:
Hop wherein
iBe the distance of inquiry promoter to present node.
Wherein, the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
Correspondingly, a kind of Unstructured Peer-to-Peer Network of the present invention system comprises a plurality of node devices, and described node device includes:
Memory cell is used to store the resource lookup routing iinformation of probability right of the selected query resource of neighbor node equipment of this node device;
Upgrade processing unit, be used for the resource lookup routing iinformation of probability right of selected this resource of inquiry of mathematical expectation updated stored unit respective neighbor node device correspondence of the response message feedback quantity of the resource lookup received with each neighbor node equipment;
The resource lookup unit is used for selecting neighbor node equipment to carry out resource lookup according to the resource lookup routing iinformation of described renewal.
Wherein, described renewal processing unit specifically comprises:
Response message feedback quantity determining unit, the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received;
Updating block, the mathematical expectation of the response message feedback quantity of the mathematical expectation of the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received and the resource lookup received with described each neighbor node equipment are replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
Wherein, described updating block specifically comprises:
Current value of feedback accuracy unit is used for determining current value of feedback accuracy;
Accumulative total value of feedback accuracy determining unit is used for determining accumulative total value of feedback accuracy;
Current value of feedback relative importance determining unit is used for determining current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy;
Calculate determining unit, the probability right that is used for selected this resource of inquiry of this neighbor node equipment upgraded according to the last time inquiry of the response message feedback quantity of current value of feedback relative importance and resource lookup and storage calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received;
Replace processing unit, the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment of determining with described calculating determining unit is received is replaced the probability right of selected this resource of inquiry of this neighbor node equipment that the last time inquiry of storage upgrades.
Wherein, described current value of feedback accuracy adopts following formula to calculate:
Hop wherein
iBe the distance of inquiry promoter to present node.
Wherein, the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
Correspondingly, the method for resource lookup routing update in a kind of Unstructured Peer-to-Peer Network of the present invention system comprises:
Obtain the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment receives;
The mathematical expectation of the response message feedback quantity of the resource lookup of receiving with described each neighbor node equipment of obtaining is replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
Wherein, the described mathematical expectation that obtains the response message feedback quantity of the resource lookup that each neighbor node equipment receives specifically comprises:
Obtain the response message feedback quantity of the resource lookup that each neighbor node equipment receives;
Obtain the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment receives.
Wherein, the described mathematical expectation that obtains the response message feedback quantity of the resource lookup that each neighbor node equipment receives specifically comprises:
Determine current value of feedback accuracy;
Determine accumulative total value of feedback accuracy;
Determine current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy;
The probability right of selected this resource of upgrading according to the response message of current value of feedback relative importance and resource lookup feedback quantity and last inquiry of inquiry of this neighbor node equipment calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received.
Wherein, current value of feedback accuracy adopts following formula to calculate:
Hop wherein
iBe the distance of inquiry promoter to present node.
Wherein, the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
Correspondingly, the resource lookup method in a kind of Unstructured Peer-to-Peer Network of the present invention system comprises:
Obtain the resource lookup routing iinformation of the probability right of selected this resource of inquiry of respective neighbor node device correspondence in the memory cell that the mathematical expectation of the response message feedback quantity of the resource lookup of receiving with each neighbor node equipment upgrades;
Carry out resource lookup according to described resource route querying Information Selection neighbor node equipment.
Wherein, the number of the neighbor node equipment of described selection is calculated according to following formula:
Wherein Hop is the distance of inquiry promoter to present node;
α is a predetermined constant.
Wherein, the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
Compared with prior art, the present invention has following beneficial effect:
The present invention passes through for each node device in the peer-to-peer network system, the resource lookup routing iinformation of the probability right of selected this resource of inquiry of respective neighbor node device correspondence in the mathematical expectation updated stored unit of the response message feedback quantity of the resource lookup of receiving with each neighbor node equipment, because the mathematical expectation of the response message that neighbor node equipment is received feedback quantity can reflect exactly to this neighbor node forwarding inquiries to find how many related resources, promptly routing iinformation is more near resource distribution actual in the network.When selecting neighbor node forwarding inquiries message, the selecteed probability of node is proportional to the probability right of selected this resource of inquiry of this node, thereby make and on this routed path, can find the resource that approaches to expect, can improve resource lookup efficient, avoided simultaneously transmitting a large amount of unnecessary query messages, reduced unnecessary offered load as the inundation mode.
Description of drawings
Fig. 1 is prior art is carried out resource lookup based on APS an embodiment schematic diagram;
Fig. 2 is the main composition schematic diagram of the node device in the Unstructured Peer-to-Peer Network of the present invention system;
Fig. 3 is a kind of composition schematic diagram of renewal processing unit shown in Figure 2;
Fig. 4 is a kind of resource lookup of the present invention and routing update embodiment flow chart;
Fig. 5 is the embodiment schematic diagram of a kind of network environment of the present invention non-structure peer-to-peer network system.
Embodiment
In Unstructured Peer-to-Peer Network, there is not the restriction of strictness for the memory location of resource.Therefore the resource of being inquired about can be any nodes sharing, and may there be many parts of backups in same resource.Simultaneously, in Unstructured Peer-to-Peer Network, query messages can only be propagated between the node of having set up connection.In the routing procedure of query messages, need to use the resource lookup routing table to instruct the route of query messages.Therefore the resource distribution of the approaching more reality of information in the resource lookup routing table, the route of query messages will be more accurate.Simultaneously, in each query script, if certain nodes sharing the resource of being inquired about, this node oppositely returns the information of these resources routed path by query messages.These information of returning are comprising the information of resource distribution situation on the network, utilize these information can reflect accurately that the distribution of resource situation is to help to improve the efficient of later inquiry in the current peer-to-peer network.
When core of the present invention is carried out the resource lookup routing update exactly, adopt following method:
At first, for each node device in the peer-to-peer network system, obtain the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment receives;
Then, the mathematical expectation of the response message of the resource lookup of receiving with described each neighbor node equipment feedback quantity is replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
In addition, when carrying out resource lookup, adopt following method:
Obtain the resource lookup routing iinformation of the probability right of selected this resource of inquiry of respective neighbor node device correspondence in the memory cell that the mathematical expectation of the response message feedback quantity of the resource lookup of receiving with each neighbor node equipment upgrades;
Then, carry out resource lookup, specifically carry out resource lookup and belong to prior art, repeat no more here according to resource route querying information according to described resource route querying Information Selection neighbor node equipment.
Because the mathematical expectation of the response message that neighbor node equipment is received feedback quantity can reflect exactly to this neighbor node forwarding inquiries to find how many related resources, promptly routing iinformation is more near resource distribution actual in the network among the present invention.When selecting neighbor node forwarding inquiries message, the selecteed probability of node is proportional to the probability right of selected this resource of inquiry of this node, thereby make and on this routed path, can find the resource that approaches to expect, can improve resource lookup efficient, the following describes the equipment that the present invention realizes resource lookup.
With reference to figure 2, this figure is the main composition schematic diagram of the node device in the non-structure peer-to-peer network of the present invention system.
Node device of the present invention mainly includes: memory cell 11, renewal processing unit 12 and resource lookup unit 13, wherein
With reference to figure 3, as a kind of concrete realization, described renewal processing unit 12 specifically can comprise:
Response message feedback quantity determining unit 121, described response message feedback quantity determining unit 121 is mainly used in the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received.
In the query script, when the resource of nodes sharing satisfies query messages, this node is formed a response message with the relevant information of resource and is returned to the inquiry promoter along the inquiry routed path.Because response message oppositely returns to the inquiry promoter along the path of inquiry route, all nodes of transmitting query messages all might receive response message so.All response messages that forward from certain particular neighbor node are combined formation this time to the value of feedback of this neighbor node forwarding inquiries message, and the computational methods of the value of feedback of concrete query messages are as follows:
Wherein, γ is a predetermined value (0＜γ＜1), Num
iRepresent the quantity that those Hop step numbers are the resource of i, the Hop of the response message that current immediate neighbor node sends is 0, and revolution is sent out a step Hop increases by 1, and the rest may be inferred.Value of feedback reflected to certain neighbor node send respective resources query messages the overall merit of the resource quantity that might find.For present node, it is uncertain more to leave its resource quantity that node returned far away more, therefore uses γ
i(γ
iBe feedback message intensity) cut down this uncertainty, promptly the response message of resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
The mathematical expectation that updating block 122, described updating block 122 are mainly used in the response message feedback quantity of the mathematical expectation of response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received and the resource lookup received with described each neighbor node equipment is replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
Based on node device shown in Figure 2, can form Unstructured Peer-to-Peer Network of the present invention system, Unstructured Peer-to-Peer Network of the present invention system comprises a plurality of node devices, described node device concrete structure such as Fig. 2 show, repeat no more here.
Describe in detail with specific embodiment below.
Safeguard separately all that for each node device in the Unstructured Peer-to-Peer Network system a local resource lookup routing table is used for storage resources and searches routing iinformation in the present embodiment.Table 2 has been showed the initial condition of the local resource lookup routing table that a node device that M neighbor node arranged is safeguarded, for each specific resource, each neighbor node can be described by two variable weight and visit.Weight represents the probability right of the selected transmission resource lookup of this neighbor node message, and when initial, weight is endowed a threshold epsilon.Visit represents accumulation feedback accuracy;
Table 2
| Neighbor node 1 | Neighbor node 2 | … | Neighbor node M | ||||
| weight | visit | weight | visit | … | weight | visit | |
| Resource 1 | ε | 0 | ε | 0 | … | ε | 0 |
| Resource 2 | ε | 0 | ε | 0 | … | ε | 0 |
| Resource 3 | ε | 0 | ε | 0 | … | ε | 0 |
| … | … | … | … | … | … | … | … |
| Resource N | ε | 0 | ε | 0 | … | ε | 0 |
In the present embodiment, when a node was received a query messages, it at first checked its resource lookup routing table, if this resource is pairing in the routing table, then added one new in table.Which neighbor node forwarding inquiries message node is determined to then.Final node is checked local shared resources (LSR), if the resource that satisfies inquiry is arranged, then relevant information is returned to the source node of forwarding inquiries message.
What in the time of node forwarding inquiries message, need to determine to neighbor node forwarding inquiries message; And how to select neighbor node.Each node that receives query messages can select to determine the neighbor node number of selected forwarding message in the following manner among the present invention:
Wherein, the neighbor node number of #Query for selecting, the constant of α for reserving in advance, Hop are the step number of present node apart from the inquiry promoter, and revolution is sent out a Hop number and is added 1, and inquiry promoter's Hop is 0, and the Hop of its immediate neighbor node is 1, by that analogy.When #Query is not more than 1, node stop forwarding inquiries message.When node was determined to transmit k query messages, it was pressed probability one by one and selects neighbor node forwarding inquiries message.In a certain the wheel, suppose to have m candidate neighbor nodes C1, C2 ..., Cm (to the source node of present node forwarding inquiries message and the neighbor node of selected forwarding inquiries be left out), present node to the probability of node Ci forwarding inquiries message is:
Wherein, Qj is the pairing resource of inquiry, and (Ci is Qi) corresponding to the value of corresponding list item in the table 1 for weight.When weight (Ci, during Qj) less than predetermined threshold epsilon, with ε replace weight (Ci, Qj).
Describe each neighbor node for the probability right that this resource had for the mathematical expectation of the response message value of feedback of using query messages, adopt following strategy to upgrade weight value in the resource lookup routing table in the present embodiment:
weight
n(c，q)＝(1-α
n)weight
n-1(c，q)+α
nf(c，q) (4)
(4) weight in
N-1(c q) is the weight value of corresponding entry in the last resource lookup routing table of upgrading, weight
n(c q) is the weight value of the current corresponding entry of need upgrading, and (c q) is the value of feedback of the response message of the query messages that calculates of this node to f.(5) visit in
0(c is 0 q).(6) Hop in
nBe the distance of inquiry promoter to present node, the number of times that query messages is forwarded when receiving query messages with present node is described, inquiry promoter's Hop
nBe 0,
Represent current value of feedback accuracy (or importance), (5) are the relative precisions (or importance) that calculates current value of feedback.In fact, (5) and (6) are brought into (4), the row iteration of going forward side by side just can obtain following expression-form:
Because node is the closer to the inquiry promoter, its response message of receiving is many more, can accurately describe the distribution of resource situation more.Therefore
(being current value of feedback accuracy or importance) can reflect and reply
Message feedback value f
i(c, accuracy q) or importance degree.
Be f
i(c, relative importance q) (being its weight) is so weight
n(c q) is exactly the estimation of mathematic expectaion of the value of feedback of query messages.
Based on the definition of above-mentioned resource lookup routing table, adopt following steps can realize upgrading:
Determine current value of feedback accuracy, in the present embodiment be
Determine accumulative total value of feedback accuracy, in the present embodiment promptly according to
Calculate and determine;
Determine current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy, in the present embodiment promptly according to
Calculate and determine;
The probability right of selected this resource of upgrading according to the response message of current value of feedback relative importance and resource lookup feedback quantity and last inquiry of inquiry of this neighbor node equipment calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received, in the present embodiment promptly according to weight
n(c, q)=(1-α
n) weight
N-1(c, q)+α
nF (c, q) determine by calculating.
At last the mathematical expectation of the response message feedback quantity of the resource lookup of receiving with described each neighbor node equipment of obtaining is replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
Equally, based on above-mentioned resource lookup routing table, as a kind of specific implementation, described updating block of the present invention specifically comprises:
Current value of feedback accuracy unit is used for determining current value of feedback accuracy, and is concrete definite with reference to above stated specification, repeats no more here;
Accumulative total value of feedback accuracy determining unit is used for determining accumulative total value of feedback accuracy, and is concrete definite with reference to above stated specification, repeats no more here;
Current value of feedback relative importance determining unit is used for determining current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy, and is concrete definite with reference to above stated specification, repeats no more here;
Calculate determining unit, the probability right that is used for selected this resource of inquiry of this neighbor node equipment upgraded according to the last time inquiry of the response message of current value of feedback relative importance and resource lookup feedback quantity and storage calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received, concrete definite with reference to above stated specification, repeat no more here;
Replace processing unit, the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment of determining with described calculating determining unit is received is replaced the probability right of selected this resource of inquiry of this neighbor node equipment that the last time inquiry of storage upgrades.
In addition, based on above-mentioned resource lookup routing table, a kind of resource lookup and routing update flow process are with reference to figure 4, and idiographic flow is as follows:
Step s101 judges that whether this node device is the inquiry promoter, if judged result is for being, and execution in step s103 then, otherwise, execution in step s102;
Step s102, whether check has the resource that satisfies inquiry in the local shared file, if having, form response message and return to the inquiry promoter, execution in step s103 then, if do not have, direct execution in step s103;
Step s102 according to inquiring about the definite message number k that will transmit of step number of route, with the value increase by 1 of query messages route step number, carries out and arranges s104;
Step s104 judges whether the message number K that transmits counts M greater than the neighbor node of this node, if judged result for being, is then carried out s106, otherwise, execution in step s105;
Step s105 reads list item relevant with current inquiry in the resource lookup routing table, and neighbor nodes all except that source node are all as both candidate nodes, then execution in step s107;
Step s107, it is 0 that the m initial value is set;
Step s108, whether m is more than or equal to k in check, if judged result is for being execution in step s112, otherwise execution in step s108;
Step s109, with their relative probability of weight calculation of both candidate nodes in the relevant entries, and by node of this probability selection;
Step s110, to this node forwarding inquiries message, and its value of feedback is set is 0, and this node is removed from both candidate nodes;
Step s111 adds 1 with the m value, returns execution in step s108;
Step s112 is provided with timer (T);
Step s113, listening state;
Step s114, P receives response message from node;
Step s115 increases the value of feedback of node P according to the step number of response message route and the number of resources returned;
Step s116 judges whether this node device inquires about the promoter, if judged result is for being, and execution in step s117 then, otherwise, execution in step s118;
Step s117, the relevant information of the resource that extraction and record find is returned execution in step s113;
Step s118, the route step number of response message increases by 1, replys corresponding query source node to this and transmits this message, returns execution in step s113;
Step s119 judges whether timer (T) is overtime, if judged result for being, is then carried out s120, otherwise, return execution in step s113.
Describe with a specific embodiment below.
Before wherein this is inquired about, resource lookup routing table such as table 4 that node E safeguards,
Table 4
| A | B | D | F | H | ||||||
| weight | visit | weight | visit | weight | visit | weight | visit | weight | visit | |
| Resource 1 | 0.8 | 1 | 0.64 | 1.5 | 1.8 | 0.5 | 1.64 | 2 | ε | 0 |
| … | … | … | … | … | … | … | ||||
Resource lookup routing table such as table 5 that node F safeguards
Table 5
| B | C | E | G | J | ||||||
| weight | visit | weight | visit | weight | visit | weight | visit | weight | visit | |
| Resource 1 | 0.64 | 1 | 1.64 | 1.5 | 0.8 | 0.5 | 0.8 | 1 | 1 | 2 |
| … | … | … | … | … | … | … | ||||
In the Unstructured Peer-to-Peer Network as Fig. 5, node E initiates the inquiry for resource 1.Table 4,5 have showed in the resource lookup routing table of node E, the current maintenance of F the list item about resource 1.Suppose that the constant alpha in the formula (1) is 4, the constant γ in the formula (3) is 0.8.Node E presses probability from A according to weight value in the resource lookup routing table, B, D, choose node among F and the H singly, each selected node is excluded outside the both candidate nodes of selecting next time, and choosing 4 (4/1) individual nodes altogether (is A, D, F and H) forwarding inquiries message.
Node A and D have only neighbor node of E, so they do not continue forwarding inquiries message.Node A does not have to share the resource that satisfies inquiry, and node D has a resource that satisfies inquiry, and it makes up a response message and returns to node E.Node F has 5 neighbours, and it selects 2 (individual node C of 4/ (1+1) and J forwarding inquiries message in 4 neighbor nodes except that node E.And node F has the resource that satisfies inquiry, and it makes up response message and returns to node E.Node C does not have other neighbor node except F, route stops.It is transmitted to node F with the response message of oneself, is finally returning to node E by node F.Node J is subjected to behind the query messages inquiry being transmitted to node I, but because node I receives same query messages from node H, node I abandons this query messages.Node J then is transmitted to node E with its response message by F.Node H is subjected to being transmitted to node I behind the query messages, and node I is transmitted to node J again, but node J receives query messages from F, and this message is abandoned.
Behind the poll-final, the node on the inquiry routed path begins to upgrade the resource lookup routing table.Only update strategy is described as an example at this with node E and F.For node F, it has transmitted query messages to neighbor node C and J.It receives the resource that an immediate neighbor node returns from C, so value of feedback is 0.8
0* 1=1, because the distance of inquiry promoter E and present node F was 1 step, C is updated to 2 (1.5+1/ (1+1)) corresponding to the visit of resource 1, and C is updated to 1.48 (1.5/2*1.64+ (1-1.5/2) * 1) corresponding to the weight of resource 1.Node F obtains the resource that an immediate neighbor node returns from node J, so value of feedback is 0.8
0* 1=1, the visit of J is updated to 2.5 (2+0.5), and weight is updated to 1 (2/2.5*1+ (1-2/2.5) * 1).
Node E is to neighbor node A, D, and F and H have transmitted query messages.Node E does not obtain any response message from node A, so value of feedback is 0, and node E inquires about the promoter exactly, so the visit of A correspondence is updated to 2 (1+1), and weight is updated to 0.4 (1/2*0.8+ (1-1/2) * 0).Node D has returned replying of an immediate neighbor node, and value of feedback is 0.8
0* 1=1, the visit of D correspondence is updated to 1.5 (0.5+1), and weight is updated to 1.27 (1.8*0.5/1.5+ (1-0.5/1.5) * 1).Node F has returned replying of an immediate neighbor node and replying of two indirect neighbours, and value of feedback is 0.8
0* 1+0.8
1* 2=2.6, the visit of F correspondence is updated to 3 (2+1), and weight is updated to 1.96 (2/3*1.64+ (1-2/3) * 2.6).Node H does not have echo reply message, and value of feedback is 0, so the visit of H correspondence is updated to 1 (0+1), and weight is updated to 0 (0*0+1*0), but because 0＜ε, weight still is set to ε.Upgrade and finish.Result after the renewal is shown in table 6 and 7.
Behind this poll-final, the resource lookup routing table of node maintenance is as follows:
The resource lookup routing table that table 6. node F safeguards
| B | C | E | G | J | ||||||
| weight | visit | weight | visit | weight | visit | weight | visit | weight | visit | |
| Resource 1 | 0.64 | 1 | 1.48 | 2 | 0.8 | 0.5 | 0.8 | 1 | 1 | 2.5 |
| … | … | … | … | … | … | … | ||||
The resource lookup routing table that table 7. node E safeguards
| A | B | D | F | H | ||||||
| weight | visit | weight | visit | weight | visit | weight | visit | weight | visit | |
| Resource 1 | 0.4 | 2 | 0.64 | 1.5 | 1.27 | 1.5 | 1.64 | 2 | ε | 0 |
| … | … | … | … | … | … | … | ||||
To sum up, the present invention has following beneficial effect:
At first, secondly, the present invention proposes the update strategy of rational resource lookup routing table, make the resource lookup routing table can accurately reflect the distribution situation of shared resource.The inquiry value of feedback of each node has reflected the resource quantity that can find to some neighbor node forwarding inquiries on the inquiry routed path in this time route.The mathematical expectation of this inquiry value of feedback can reflect exactly: may find how many related resources to this neighbor node forwarding inquiries.The update strategy of the resource lookup routing table that the present invention proposes makes the weight of each neighbor node trend towards inquiring about the mathematic expectaion of value of feedback just.When selecting neighbor node forwarding inquiries message, the selecteed probability of node is proportional to the weight of this node, so just makes and can find the resource that approaches to expect on this routed path.
Secondly, the present invention is improved the efficient of inquiry, and unnecessary offered load is minimized.In the routing procedure of query messages, the renewal of resource lookup routing table is that the distribution situation of abideing by shared resource in the network is carried out, and can reflect the quality of routed path exactly, the route of guiding query messages.Node is pressed probability and is selected forward-path when forwarding inquiries message, thereby has guaranteed that from probability each inquiry can both select more excellent inquiry routed path, and more related resource can be found.Technical solution of the present invention can find more resources under the situation of equal offered load, improves the efficient of inquiry.Simultaneously, transmit more query messages near inquiry promoter's node among the present invention, and transmit less query messages away from its node, be among the present invention transmission of news by the early stage intensive the sparse of later stage that be tending towards, can make query messages in bigger network area, propagate, avoided simultaneously transmitting a large amount of unnecessary query messages, reduced unnecessary offered load as the inundation mode.
Simultaneously, the present invention has accelerated the renewal speed of resource lookup routing table, makes that the list item in the resource lookup routing table can be updated to value comparatively accurately as early as possible, in time helps to improve search efficiency.Among the present invention the every weight of resource lookup routing table with the desired value of inquiry value of feedback as its desired value, with clearly defined objective, can be fast near desired value.Simultaneously, in the routing procedure of query messages, transmitted more query messages near inquiry promoter's node, this just makes their one query can upgrade the pairing resource lookup route table items of a plurality of neighbor nodes.This just helps this part node to obtain the roughly distribution of this resource faster, and finds corresponding resource comparatively exactly in inquiring about next time, helps the routing table update of other node.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (18)
1, the node device of a kind of Unstructured Peer-to-Peer Network system is characterized in that, includes:
Memory cell is used to store the resource lookup routing iinformation of probability right of selected this resource of inquiry of corresponding each resource of each neighbor node equipment of this node device;
Upgrade processing unit, be used for the resource lookup routing iinformation of probability right of selected this resource of inquiry of mathematical expectation updated stored unit respective neighbor node device correspondence of the response message feedback quantity of the resource lookup received with each neighbor node equipment;
The resource lookup unit is used for selecting neighbor node equipment to carry out resource lookup according to the resource lookup routing iinformation of described renewal.
2, the node device of Unstructured Peer-to-Peer Network according to claim 1 system is characterized in that described renewal processing unit specifically comprises:
Response message feedback quantity determining unit, the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received;
Updating block, the mathematical expectation of the response message feedback quantity of the mathematical expectation of the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received and the resource lookup received with described each neighbor node equipment are replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
3, the node device of Unstructured Peer-to-Peer Network according to claim 2 system is characterized in that updating block specifically comprises:
Current value of feedback accuracy unit is used for determining current value of feedback accuracy;
Accumulative total value of feedback accuracy determining unit is used for determining accumulative total value of feedback accuracy;
Current value of feedback relative importance determining unit is used for determining current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy;
Calculate determining unit, the probability right that is used for selected this resource of inquiry of this neighbor node equipment upgraded according to the last time inquiry of the response message feedback quantity of current value of feedback relative importance and resource lookup and storage calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received;
Replace processing unit, the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment of determining with described calculating determining unit is received is replaced the probability right of selected this resource of inquiry of this neighbor node equipment that the last time inquiry of storage upgrades.
4, the node device of Unstructured Peer-to-Peer Network according to claim 3 system is characterized in that, described current value of feedback accuracy adopts following formula to calculate:
Hop wherein
iBe the distance of inquiry promoter to present node.
5, according to the node device of each described Unstructured Peer-to-Peer Network system of claim 1-4, it is characterized in that the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
6, a kind of Unstructured Peer-to-Peer Network system comprises a plurality of node devices, it is characterized in that described node device includes:
Memory cell is used to store the resource lookup routing iinformation of probability right of the selected query resource of neighbor node equipment of this node device;
Upgrade processing unit, be used for the resource lookup routing iinformation of probability right of selected this resource of inquiry of mathematical expectation updated stored unit respective neighbor node device correspondence of the response message feedback quantity of the resource lookup received with each neighbor node equipment;
The resource lookup unit is used for selecting neighbor node equipment to carry out resource lookup according to the resource lookup routing iinformation of described renewal.
7, Unstructured Peer-to-Peer Network according to claim 6 system is characterized in that described renewal processing unit specifically comprises:
Response message feedback quantity determining unit, the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received;
Updating block, the mathematical expectation of the response message feedback quantity of the mathematical expectation of the response message feedback quantity of the resource lookup that is used for determining that each neighbor node equipment is received and the resource lookup received with described each neighbor node equipment are replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
8, Unstructured Peer-to-Peer Network according to claim 7 system is characterized in that described updating block specifically comprises:
Current value of feedback accuracy unit is used for determining current value of feedback accuracy;
Accumulative total value of feedback accuracy determining unit is used for determining accumulative total value of feedback accuracy;
Current value of feedback relative importance determining unit is used for determining current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy;
Calculate determining unit, the probability right that is used for selected this resource of inquiry of this neighbor node equipment upgraded according to the last time inquiry of the response message feedback quantity of current value of feedback relative importance and resource lookup and storage calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received;
Replace processing unit, the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment of determining with described calculating determining unit is received is replaced the probability right of selected this resource of inquiry of this neighbor node equipment that the last time inquiry of storage upgrades.
9, Unstructured Peer-to-Peer Network according to claim 8 system is characterized in that, described current value of feedback accuracy adopts following formula to calculate:
Hop wherein
iBe the distance of inquiry promoter to present node.
10, according to each described Unstructured Peer-to-Peer Network system of claim 6-9, it is characterized in that the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
11, the method for resource lookup routing update in a kind of Unstructured Peer-to-Peer Network system is characterized in that, comprising:
Obtain the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment receives;
The mathematical expectation of the response message feedback quantity of the resource lookup of receiving with described each neighbor node equipment of obtaining is replaced the resource lookup routing iinformation of probability right of selected this resource of inquiry of respective neighbor node device correspondence.
12, the method for resource lookup routing update in the Unstructured Peer-to-Peer Network according to claim 11 system is characterized in that, the described mathematical expectation that obtains the response message feedback quantity of the resource lookup that each neighbor node equipment receives specifically comprises:
Obtain the response message feedback quantity of the resource lookup that each neighbor node equipment receives;
Obtain the mathematical expectation of the response message feedback quantity of the resource lookup that each neighbor node equipment receives.
13, the method for resource lookup routing update in the Unstructured Peer-to-Peer Network according to claim 12 system is characterized in that, the described mathematical expectation that obtains the response message feedback quantity of the resource lookup that each neighbor node equipment receives specifically comprises:
Determine current value of feedback accuracy;
Determine accumulative total value of feedback accuracy;
Determine current value of feedback relative importance according to current value of feedback accuracy and accumulative total value of feedback accuracy;
The probability right of selected this resource of upgrading according to the response message of current value of feedback relative importance and resource lookup feedback quantity and last inquiry of inquiry of this neighbor node equipment calculates the mathematical expectation of the response message feedback quantity of the resource lookup of determining that each neighbor node equipment is received.
14, the method for resource lookup routing update in the Unstructured Peer-to-Peer Network according to claim 13 system is characterized in that, current value of feedback accuracy adopts following formula to calculate:
Hop wherein
iBe the distance of inquiry promoter to present node.
15, according to the method for resource lookup routing update in each described Unstructured Peer-to-Peer Network system of claim 11-14, it is characterized in that the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
16, the resource lookup method in a kind of Unstructured Peer-to-Peer Network system is characterized in that, comprising:
Obtain the resource lookup routing iinformation of the probability right of selected this resource of inquiry of respective neighbor node device correspondence in the memory cell that the mathematical expectation of the response message feedback quantity of the resource lookup of receiving with each neighbor node equipment upgrades;
Carry out resource lookup according to described resource route querying Information Selection neighbor node equipment.
17, the resource lookup method in the Unstructured Peer-to-Peer Network according to claim 16 system is characterized in that the number of the neighbor node equipment of described selection is calculated according to following formula:
Wherein Hop is the distance of inquiry promoter to present node;
α is a predetermined constant.
18, according to the resource lookup method in claim 16 or the 17 described Unstructured Peer-to-Peer Network systems, it is characterized in that the response message of described resource lookup feedback quantity be the summation of the feedback message intensity product value of the feedback message quantity of each node device reception on this neighbor node equipment forward-path and this node device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101220625A CN1937584B (en) | 2006-09-05 | 2006-09-05 | Non-structured reciprocal network system and its resource query and route updating method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101220625A CN1937584B (en) | 2006-09-05 | 2006-09-05 | Non-structured reciprocal network system and its resource query and route updating method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1937584A true CN1937584A (en) | 2007-03-28 |
| CN1937584B CN1937584B (en) | 2010-12-08 |
Family
ID=37954857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101220625A Expired - Fee Related CN1937584B (en) | 2006-09-05 | 2006-09-05 | Non-structured reciprocal network system and its resource query and route updating method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1937584B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741869A (en) * | 2008-11-07 | 2010-06-16 | 华为技术有限公司 | Method and system for providing contents |
| WO2011069387A1 (en) * | 2009-12-10 | 2011-06-16 | 北京邮电大学 | Network node, method for data query and method for index update thereof |
| CN101217565B (en) * | 2008-01-04 | 2011-12-14 | 华中科技大学 | A network organization method of classification retrieval in peer-to-peer network video sharing system |
| CN102377826A (en) * | 2011-11-28 | 2012-03-14 | 中国科学院研究生院 | Method for optimal placement of unpopular resource indexes in peer-to-peer network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100365997C (en) * | 2005-08-26 | 2008-01-30 | 南京邮电大学 | Distributed hash table in opposite account |
-
2006
- 2006-09-05 CN CN2006101220625A patent/CN1937584B/en not_active Expired - Fee Related
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101217565B (en) * | 2008-01-04 | 2011-12-14 | 华中科技大学 | A network organization method of classification retrieval in peer-to-peer network video sharing system |
| CN101741869A (en) * | 2008-11-07 | 2010-06-16 | 华为技术有限公司 | Method and system for providing contents |
| WO2011069387A1 (en) * | 2009-12-10 | 2011-06-16 | 北京邮电大学 | Network node, method for data query and method for index update thereof |
| CN102377826A (en) * | 2011-11-28 | 2012-03-14 | 中国科学院研究生院 | Method for optimal placement of unpopular resource indexes in peer-to-peer network |
| CN102377826B (en) * | 2011-11-28 | 2013-01-09 | 中国科学院研究生院 | Method for optimal placement of unpopular resource indexes in peer-to-peer network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1937584B (en) | 2010-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20060178156A1 (en) | Routing method in a wireless sensor network | |
| EP2491745B1 (en) | System and method of utilizing a framework for information routing in large-scale distributed systems using swarm intelligence | |
| US20060153154A1 (en) | Data forwarding method for reliable service in sensor networks | |
| CN101437045B (en) | Method for selecting transfer node of P2P system and P2P node | |
| CN107920368A (en) | RPL routing optimization methods based on life cycle in a kind of wireless sense network | |
| CN107210850B (en) | Method and system for selecting communication parameters in a wireless network | |
| US20140280881A1 (en) | Using latency and route information to estimate location | |
| US20080027923A1 (en) | Method and apparatus for managing peer-to-peer search results | |
| CN1937584B (en) | Non-structured reciprocal network system and its resource query and route updating method | |
| CN101355473A (en) | Method for publishing and searching mobile self-networking resource as well as mobile self-networking network node equipment | |
| CN107193945B (en) | Method is adaptively recommended based on interest and relevant message of meeting in opportunistic network | |
| WO2020207197A1 (en) | Data processing method and apparatus, electronic device, and storage medium | |
| Nandyala et al. | QTAR: A Q-learning-based topology-aware routing protocol for underwater wireless sensor networks | |
| JP5692757B2 (en) | Server, method and system for providing node information of P2P network | |
| CN107708090B (en) | Information transmission method, device and system in vehicle self-organizing network | |
| Rezazadeh et al. | Message-efficient localization in mobile wireless sensor networks | |
| Alhasanat et al. | A probabilistic home-based routing scheme for delay tolerant networks | |
| CN101895474A (en) | Information diffusion-based P2P network route control method | |
| US10003954B2 (en) | Method and apparatus for distributive mobility management | |
| EP3706450B1 (en) | Fast query method for dynamic location information of mobile network entities | |
| KR101609457B1 (en) | Method for searching median node in big graph database based on low boundary | |
| CN107969021B (en) | Efficient routing strategy between event and actuator based on differentiated service | |
| CN103064872A (en) | Processing search queries in a network of interconnected nodes | |
| CN115443686A (en) | Packet forwarding including partial ordering of path cost or utility | |
| Jeon et al. | A direction entropy-based forwarding scheme in an opportunistic network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20101208 Termination date: 20190905 |