CN101640623A - Method and equipment for searching resource in peer-to-peer network - Google Patents
Method and equipment for searching resource in peer-to-peer network Download PDFInfo
- Publication number
- CN101640623A CN101640623A CN200810129457A CN200810129457A CN101640623A CN 101640623 A CN101640623 A CN 101640623A CN 200810129457 A CN200810129457 A CN 200810129457A CN 200810129457 A CN200810129457 A CN 200810129457A CN 101640623 A CN101640623 A CN 101640623A
- Authority
- CN
- China
- Prior art keywords
- metadata
- node
- peer
- resource
- network
- 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
- Computer And Data Communications (AREA)
Abstract
The invention discloses a method for searching resource in P2P network, which comprises the following steps: receiving metadata from other peer-to-peer nodes in advance, wherein the metadata of each node comprises shared file information in the peer-to-peer node; responding to a requirement for requesting specific resource from other peer-to-peer nodes; judging which peer-to-peer node claims to have the specific resource according to the received metadata; and transmitting the request to the peer-to-peer node which claims to have the specific resource. By using the method, the traffic in the P2P network can be remarkably reduced, and the phenomenon of message delay and message explosion in the network traffic peaks can be reduced or avoided.
Description
Technical field
The present invention relates to computer network, more particularly, the method and apparatus that the present invention relates in computer network, search for fast.
Background technology
Along with development of internet technology, in the Internet (Internet), particularly carry out resource searching in (P2P) network, share and become more and more general in equity.In the P2P network, carry out resource searching, shared common software comprises a sudden peal of thunder, bt, emule etc.But at present, the speed of searching in these softwares is undesirable usually.
Fig. 1 has schematically shown a P2P network 100.This P2P network 100 comprises a plurality of nodes, is peer-to-peer between each node.If one of them node (for example, node 101) exist to wish to obtain from other nodes the request of specific resource, this node 101 as the requestor to its neighbor node (for example, the node 102-105 among Fig. 1) multicast search message.Behind the search message of receiving from requestor's node 101, each node 102-105 will search in self, simultaneously the search message that receives is sent to its neighbours (for brevity, one of them neighbor node 103 that only shows node 101 among Fig. 1 is transmitted to its neighbor node 106-108 with request).Node 106-108 carries out local search and message multicast similarly.Such operator scheme will continue, till reaching certain search radius.Receive that each peer node of search message carrying out behind the local search, if this node searching, then generates the P2P search response to related resource and related resource is sent back to requestor's (path is shown in the dotted line among Fig. 1).Under this search pattern, the requestor sends request blindly, and request is successively transmitted.If too much requestor sends search message simultaneously, a large amount of query messages spread unchecked in network, will inevitably cause information explosion; Simultaneously, search efficiency is low and amount of calculation is big.
Therefore, need a kind ofly can provide more useful Search Results fast, thereby help the user to find the method and apparatus of required content rapidly.
Summary of the invention
In view of the problems referred to above of the prior art, the technical scheme of the present invention of giving chapter and verse.Technical scheme of the present invention is called the search of metadata guiding equity (Metadata Directed Peer toPeer Search) or MDPPS, and it is driven by the P2P technology, is based on the quick resource searching engine of local index and P2P network.
According to an aspect of the present invention, provide a kind of by peer node in peer-to-peer network searching resource method, comprising: receive metadata from other peer node in advance, described metadata comprises can be for the fileinfo of sharing in other peer node; In response to demand, judge that according to the metadata that receives which peer node claims to have described specific resource from the specific resource of other peer node requests; Only to claiming that the peer node with described specific resources sends the resource transmission request.
According to another aspect of the present invention, a kind of equipment that is used for peer-to-peer network is provided, described equipment constitutes one of a plurality of peer node in the peer-to-peer network, described equipment comprises: communicator, receive metadata from other peer node in advance, the metadata of each node comprises can be for the fileinfo of sharing in this peer node; Judgment means, in response to demand from the specific resource of other peer node requests, judge that according to the metadata that receives which peer node claims to have described specific resource, wherein said communicator also is used for the judgement in response to judgment means, only to claiming that the peer node with described specific file sends request.
According to preferred implementation of the present invention, technical scheme of the present invention has lightweight local resource index service, can pass through its index local resource.Then, generate the metadata that contains local shared file information by described index.In addition, each peer-to-peer also has partner list (for example, tabulation can comprise Team Member, friend etc.), and each peer-to-peer can and be shared metadata (metadata) and the inquiry service that generates with the exchange of the peer-to-peer in the described partner list.Because each peer node disseminates the metadata that contains local shared file information in network, so send to whom and ask when a node can judge this during in request resource very soon.
According to preferred implementation of the present invention, in the P2P network, each node and the information interchange of node maintenance on every side, described information interchange preferably takes place when network is idle, and the information of interchange can be complete metadata, the part of metadata or the renewal of metadata.Metadata is a kind of data structure that comprises Resource Key information, and the node in the P2P network can judge whether node occupies its resource requirement on every side according to the search key and the metadata of node on every side.The metadata (described metadata can be updated periodically) of node in the P2P network around a node is in store, when this node wishes to search certain resource in the P2P network, the up-to-date metadata that node sended over around he utilized earlier judges which node occupies its resource needed in the node, which does not have on every side.These calculating are all finished in this locality, do not need to use network.When node by metadata to after node filters on every side, he only sends resource request message and " claims the node that occupy this resource " to those himself." claim the node that oneself occupies this resource " and promptly contain the source node of those metadata of asking keyword to some extent.Query requests after the node of asking sends, its certain neighbor node will receive request, and receiving node can serve as the sender and request is sent to third party's node then, and the rest may be inferred.Apace, query requests will spread all over whole P2P network in the inquiry radius.
According to preferred implementation of the present invention, use Bloom Filter algorithm from key word index generator data.Because the space efficiency of Bloom Filter algorithm is very high, therefore can significantly reduce the query messages traffic between the peer node.
Because each peer node exchange resource information in advance in the present invention, and only send resource request to " claiming the node that oneself occupies certain resource ", therefore specific aim, the validity of inquiry are stronger, and the speed of having accelerated to return the inquiry response result (for example, in the experimental example of carrying out at LAN, almost the requestor has just finished to key in searching request, and system has just returned Search Results).In addition, the present invention preferably transfers to free time with a part of Internet traffic when busy, thus the Internet traffic when having reduced searching resource, and this can be avoided the message blast or the message delay when doing.
Description of drawings
Read following detailed description in conjunction with the drawings, can more fully understand the present invention and more understand lot of advantages of the present invention.
Fig. 1 has schematically shown a P2P network.
Fig. 2 is that illustration generates and the schematic diagram that sends metadata according to preferred implementation of the present invention.
Fig. 3 shows preferred implementation according to the present invention sends searching request, returns response in network schematic diagram.
Fig. 4 describes the flow chart according to the method for preferred implementation generator data of the present invention.
It is that example illustrates the mode that forms metadata that Fig. 5 A and 5B illustrate with keyword " patent ".
Fig. 6 describes the flow chart that uses the method for metadata according to preferred implementation of the present invention.
Fig. 7 illustrates the flow chart according to the method for preferred implementation of the present invention.
Fig. 8 illustrates the structured flowchart according to the node in the P2P network of preferred implementation of the present invention.
Embodiment
Below with reference to accompanying drawing working method of the present invention is described.
Fig. 2 is illustration generated and sent the principle of metadata according to a preferred implementation of the present invention schematic diagram.The P2P network 200 of Fig. 2 comprises some peer node (being represented by 201-206 respectively).Should be appreciated that the network of P2P shown in Fig. 2 comprises 6 nodes, but the present invention is not limited to this, actual P2P network can comprise the node of any amount.Each node in the network 200 can be in advance (preferably, be in network free time) send metadata M (for brevity to its neighbours, node 201 only is shown among the figure sends described metadata M to its neighbor node 202-206, and other nodes are not shown to the situation that neighbor node sends), with show or claim this node 201 have which can with neighbours' shared content.By each node and the information interchange of node maintenance on every side, each node knows all which sharable content its neighbor node has.Like this, if a node (for example node 201) is hopeful to ask the request of specific resource, it mates with request keyword and the local metadata of collecting earlier, filters neighbours by the metadata from neighbours that is:, has resource so which neighbour the requestor knows.Then, request is sent to the neighbours that those have resource.Equally, when neighbours receive searching request, also use the request keyword to mate with its collected metadata, resource requestor is to claiming that the neighbours with content that the requestor wants send search query message, by that analogy.
Fig. 3 shows preferred implementation according to the present invention sends resource request, returns response in network schematic diagram.The formation of the P2P network of Fig. 3 is identical with the P2P network of Fig. 1.Difference is that in the network of Fig. 3, requestor's node (as the node among Fig. 3 301) is not all to send resource request to each neighbour, and only sends resource request to the node 303,305 that is labeled as "Yes".Equally, after the neighbours 303 that are labeled as "Yes" receive request, also only be transmitted to his neighbours that are labeled as "Yes" 308 (should be appreciated that for brevity the forwarding operation of not shown node 305).Here, the node that is labeled as "Yes" is by metadata and shows the neighbours with content that the requestor wants.As seen from Figure 3, using under the situation of the present invention, the traffic of send resource request in the P2P network, returning response significantly is lower than the traffic among Fig. 1.
This shows, in the present invention, each peer node in the network exchanges metadata in advance, thereby each node can judge whether its neighbours comprise specific resource according to its neighbours' metadata, and only sends resource request to " claiming the node that oneself occupies certain resource " when needing request resource.Therefore, specific aim, the validity of inquiry are stronger, and have accelerated to return inquiry response result's speed.
Because metadata takes up room very little (particularly when only needing to send the renewal of metadata), even if each node can not cause burden to Internet traffic in the busy such metadata of transmission/reception in period of network yet.
But, a preferred embodiment of the invention, each peer node are to send metadata information to its neighbor node idle period at network.According to another kind of preferred implementation of the present invention, receive the metadata of other nodes (can be neighbor node, also can not be neighbor node) when a node after, can trigger this node and send metadata to described other nodes.
Described network free time can be specified (for example, Internet traffic less relatively night) by the user, also can use network traffics survey tool (NTMT) or algorithm to detect the free time or the peak absences of network.The network traffics survey tool can be detected the network bandwidth on router and the PC, and this has had mature technology in the art, therefore is not described in detail at this.Related content for example can referring to
Http:// en.wikipedia.org/wiki/Network traffic measurementOr
Http:// en.wikipedia.org/wiki/Packet sniffer
The implication of the term that uses among the present invention " neighbours " or " neighbor node " is well known in the art.When each node (work station) adds peer-to-peer network, he can extract a partner list from the web high-speed cache of the lastest imformation of preserving group of peers, perhaps also can self-defined partner list, each peer-to-peer that comprises in this partner list is the neighbours or the neighbor node of the node of this adding network.The neighbor node of a node can pass through a fixing list initialization, progressively adjusts in the process that receives, sends resource then, and final purpose is to make present node can obtain resource needed faster and betterly.The partner list of each peer-to-peer can be made up of similar partner list and collection partner list etc.The partner who comprises similar resource will be added to similar partner list, and the partner that always can provide value resource will be added to the collection partner list.And if a peer-to-peer often obtains resource there from the collection partner, then this peer-to-peer can become this collection partner's similar partner.
Fig. 4 illustrates the flow chart according to the method for preferred implementation generator data of the present invention.This method enters step 410 subsequently from step 400.In step 410, local resource preparation of document index to other computer in the network is shared in hope as the computer of a peer node in the network.Then, in step 420, generate metadata by the file index that in step 410, produces.Subsequently, this method finishes in step 430.
" file index " is meant computer documents establishment reverse indexing, form the mapping of the memory location of certain word in a document or one group of document, it is a data structure the most frequently used in the document retrieval, by file index (reverse indexing), the user can search the local resource that contains certain keyword fast.The instrument that is used for produce index is Google Desktop, Lucene, Beagle etc. for example.How relevant had mature technology in the art to resource or documentation index.
Here being how example simply introduces the preparation of document index with English, is to want indexed text below:
T0＝“it?is?what?it?is”
T1＝“what?is?it”
T2＝“it?is?a?banana”
These texts can be included in the title, content, description of file, suppose that T1 is the title of certain file in the computer, and as " D: what is it.doc ", and T0 is certain delegation in the F: hello.doc file.The file index program is at first carried out participle to indexed text, and " whatis it " will be divided into three words " what ", and " is ", " it ", these words are exactly the indexing key words that the present invention mentions; Then the text at word and its place is set up mapping relations; By the file index program, can obtain following file index: (wherein 1} represents text T1, and other is similar)
″a″：{2}
″banana″：{2}
″is″：{0，1，2}
″it″：{0，1，2}
″what″：{0，1}
Concordance program can write down the position of the corresponding resource of T0, T1, T2, as T1 correspondence " D: whatis it.doc ".The user is when user input query keyword " what " time like this, the file index program just can very fast navigating to comprise this keyword file the position D: what isit.doc.When user search keyword " what is it ", concordance program can be got the keyword mapping to occur simultaneously and return: { 0,1} ∩ { 0,1,2} ∩ 0,1,2}={0,1}, concordance program can notify the user can D: what is it.doc (T1) or F: hello.doc (T0) find the keyword of being inquired about.
After local file or resource are carried out index, generate the index metadata from file or resource index again, this index metadata is distributed to neighboring peer at reasonable time (preferably when network is idle).Can there be multiple by way of example to generate the index metadata, as described below.
A kind of mode be directly with the resource index that generates as metadata.The resource index that generates can comprise the information of Resource Key and relevant resource location etc.The metadata of Sheng Chenging provides the abundant information relevant with resource for the node of request resource in this way, and the node of being convenient to request resource is judged.
Another kind of mode is as metadata with the keyword in the resource index.At this moment, can form metadata by each keyword in the resource index is listed in the file.Than preceding a kind of mode, owing to only send index key, thereby can reduce a part of Internet traffic.
Another mode is to use Bloom filter algorithm generator data.Bloom filter (being called for short bl) is the very high random data structure of a kind of space efficiency, and it utilizes bit array to represent a set very compactly, and can judge whether an element belongs to this set.Preferred implementation of the present invention is utilized the characteristic of bl, uses bit array to represent (file index) set of keywords on the local computer.For the keyword of any user's input, can judge with the bl method whether this keyword is included in the bit array that has generated, thereby determine whether contain corresponding resource in the computer.Like this, the bit array that local computer A is generated sends to computer B in the network, uses the bl method, and B just can judge whether A occupies its resource needed.
Bloom Filter this efficiently has certain cost: when judging whether an element belongs to certain set, might not think the element that belongs to this set by mistake to belong to this set (false positive).Therefore, Bloom Filter is not suitable for the application scenario of those " zero errors ".And under the application scenario that can tolerate low error rate, Bloom Filter has exchanged the very big saving of memory space for by few mistake.
Bloom Filter is described below represents the mode gathered with bit array.When initial condition, Bloom Filter is a bit array that comprises the m position, and each all is changed to 0.
Use S={x
1, x
2..., x
nThe set of such n element, S is exactly a set of keywords in this patent.The bit array that an initial condition complete 0 is arranged, length are m.Bloom Filter uses k separate hash function (Hash Function), each element map during they will gathers respectively arrive 1 ..., in the scope of m}.To any one element x, the position h of i hash function mapping
i(x) will be changed to 1 (1≤i≤k).Note if a position repeatedly is changed to 1, has only so and can work (just do or operate) for the first time, the back several times will be without any effect.In following table, k=3, and have two hash functions to choose same position (several the 5th) from the left side.Final 0,1 bit array that forms is exactly the metadata of mentioning here.
Table a
During inquiry, when judging whether y belongs to this set, we use k hash function to y, if all h
i(y) position all is 1, and (1≤i≤k), we just think that y is the element in the set so, otherwise just think that y is not the element in the set.Y in the following table
1It just not the element in the set.y
2Perhaps belonging to this set, perhaps just is a false positive (false positive).
Table b
Generate, use metadata with Bloom filter for how further specifying, suppose to have on the computer A file C: Hello_world.txt, its content is a blank.By the file index program, can obtain containing similar following information index file:
“Hello”-＞C:\Hello_world.txt
“world”-＞C:\Hello_world.txt
Can think that " Hello " keyword is exactly the x that goes up among the table a
1, " world " keyword is exactly the x among the table a
2Choose three kinds of different hash functions, they are with x
1Be mapped on the bit array position 2,5,9, so 2,5,9 positions of bit array are changed to " 1 "; Function is with x
2Be mapped on the bit array position 5,7,11, also 5,7,11 positions with bit array are changed to " 1 ", and 5 positions are by twice set, and the result still is " 1 ".After finishing, this bit array comprises the metadata of " Hello ", " world " keyword exactly.Neighbor node around A is distributed to it.
Suppose that B is one of neighbours of A, and received the metadata that A sends.In the present invention, when wishing to search, the party B-subscriber contains " Hello " keyword (y
1) resource the time: keyword " Hello " is used the three kinds of hash functions (these three kinds of hash functions are consistent with the function of A node cogenerator data) pre-set, as show b, then keyword " Hello " also is bound to be mapped to bit array 2,5, on 9, we just think and contain the resource that the party B-subscriber wants (A node C: Hello_world.txt) on the A node so, and B can send out resource request and give node A subsequently.
More contents of relevant bloom filter, can referring to
Http:// en.wikipedia.org/wiki/Bloom filter,
Http:// blog.csdn.net/jiaomeng/archive/2007/01/27/1495500.aspxOr
Http:// www.googlechinablog.com/2007/07/bloom-filter.html
Fig. 5 A and 5B are that example illustrates the mode that forms metadata with keyword " patent ".
The metadata of a sky is a bit array (Array), suppose that its length is m (m is a natural number), and each bit all is set to 0.Must define k different hash function, each hash function all is mapped to key value one of m array position.In order to add to such as the element of " patent " in the metadata, need be applied to each in k the hash function, to obtain k array position, the bit value of all this k positions is set to " 1 " then, and the metadata of " patent " keyword has just formed like this.To carry out above-mentioned steps at each index key, forming the array of m bit length, its each is 1 or 0.In addition, it will be appreciated by those skilled in the art that the k value is big more, array length is long more, the metadata that is generated is accurate more.
After all shareable resource generator data, the peer node in the P2P network can, constantly be distributed to the metadata of oneself in the ambient network, during the free time in the time of user's appointment or at network as shown in Figure 2.
Each peer node in the network all has metadata, and described metadata is the bit array that comprises resource index keyword Hash code (hash code).Each peer node generates its metadata with resource index, and this metadata is sent to all adjacent nodes.Each peer node keeps the metadata of all neighbours' renewal.Each peer node can be known the resource (this finishes in this locality, need not send any message) whether its neighbours have him and want according to its neighbours' metadata.
Preferably, after the generator data, a node only sends whole index metadata when carrying out the metadata exchange with neighbor node first, after this only send the data updated bag, thereby can further reduce the traffic in the network.As is known to the person skilled in the art, index instrument such as GoogleDesktop can regularly or utilize system CPU free time that the computer local resource is carried out index, thereby which change in resources knows (for example has, increase or deleted resource), and these change in resources are generated the index that upgrades.Subsequently, generate the metadata of upgrading by Bloom Filter again, to send to neighbor node.
In addition, metadata is to generate to be distributed to then on every side on the node in local computer, so content metadata can be by customization, thereby the user can hide the private data of not wishing that other people know.
Each node in the P2P network can comprise local index establishment engine and metadata maker (not shown), is respectively applied for its local resource preparation of document index and is used for from these index generator data.
The following flow chart that uses the method for metadata according to preferred implementation of the present invention of describing with reference to Fig. 6.This method enters step 610 subsequently from step 600.In step 610, when the user wishes to search for the resource that contains certain keyword, the input keyword, if metadata is to use Bloom filter method to generate, then the keyword to user's input uses Bloomfilter, method when the hash method that uses among the Bloom filter will be with the generator data is consistent and (should be understood that, in peer-to-peer network, use the number k of what kind of hash function and hash function can be pre-defined, as long as each node in peer-to-peer network is deferred to this definition) by method.Then, in step 620, keyword in the step 610 and the metadata that obtains from each neighbor node are compared successively, metadata for the generation of Bloom filter method, use from searching key word data that generate and the metadata that obtains from each neighbor node to compare successively, conform to the metadata that in step 630, judges whether with some neighbor node sends.If in step 630, be judged as "Yes" (that is: conforming to the metadata that some neighbor node sends), think that then these neighbor nodes have active user's resource needed (step 640).Subsequently, in step 660, send resource request message and have the neighbor node of institute's request resource to these.Subsequently, judge whether that 670 all metadata of collecting all relatively finish, this method finishes in step 680 if relatively finished then; If then returning step 630, the metadata that does not compare as yet in addition continues to carry out.If in step 630, be judged as "No" (that is: not conforming to) with the metadata that some neighbor node sends, do not think that then these neighbor nodes have active user's resource needed and it does not sent resource request (step 650), forward step 670 subsequently to.
For step 650, may there be following situation.Carry out the node of resource request and before do not collect metadata from all neighbours.So under the situation that is judged as "No" of step 630, after execution in step 650, the node that carries out resource request can transfer to check them whether required resource is arranged to those nodes contacts of not collecting its metadata as yet.
Fig. 7 illustrates the overview flow chart according to the method for preferred implementation of the present invention.This method enters step 710 subsequently from step 700.In step 710, the peer node in the network receives the metadata of other peer node in advance, and the metadata of each node comprises can be for the fileinfo of sharing in this peer node.Then, in step 720,, judge that according to the metadata that receives which peer node claims to have described specific resource in response to this demand if having from the demand of the specific resource of other peer node requests.Then, in step 730, only to claiming that the peer node with described specific resources sends request.This method finishes in step 740.
Fig. 8 illustrates the structured flowchart according to the node in the P2P network of preferred implementation of the present invention (for example, as Fig. 2 node 201).This node comprises communicator 810 and judgment means 830.Wherein, communicator 810 is used for receiving in advance the metadata of other peer node, and the metadata of each node comprises can be for the fileinfo of sharing in this peer node.Judgment means 830 is used in response to the demand from the specific resource of other peer node requests, judges that according to the metadata that receives which peer node claims to have described specific resource.Communicator 810 also is used for the judgement in response to judgment means 830, only to claiming that the peer node with described specific file sends request.
According to preferred implementation of the present invention, node 201 as shown in Figure 8 can also comprise a communication control unit (shown in the frame of broken lines among Fig. 8 820), is used to control the metadata of described communicator 810 actives to other peer node sending nodes 201.For example, communicator 810 sent metadata to other peer node as described in communication control unit 820 can be ordered in time (as night) of user's appointment or in network free time, perhaps received under the situation of metadata from other nodes, ordered described communicator 810 to send metadata to other peer node at communicator 810.
How to cooperate between communicator 810, communication control unit 820 and the judgment means 830 of concrete peer node 201, it is consistent describing with method of the present invention, those skilled in the art are understandable according to description of the invention and art technology knowledge, repeat no more here.
In the present invention, the message that sends or exchange relevant resource is separated with the resource request that sends reality, and only send resource request, thereby improved specific aim, the validity of inquiry, and accelerated to return the speed of resource request response to " claiming the node that oneself occupies certain resource ".
In addition, the present invention preferably sends or exchanges the message of relevant resource in network free time.Like this, by a part of Internet traffic is transferred to free time when busy, the Internet traffic when having reduced searching resource, this can be avoided the message blast or the message delay when doing.
Although should be appreciated that among Fig. 8 communicator 810 is shown an assembly, it will be appreciated by those skilled in the art that described communicator 810 can be made of discrete receiving system and dispensing device.
Those of skill in the art will recognize that to provide embodiments of the invention with the form of method, system or computer program.Therefore, the present invention can take devices at full hardware embodiment, full software implementation example, the perhaps form of the embodiment of integration software and hardware.The typical combination of hardware and software can be the general-purpose computing system that has computer program, when program is loaded and be performed, and the control computer system, thus can carry out above-mentioned method.
The present invention can be embedded in the computer program, and it comprises all features that method described herein is implemented.Described computer program is comprised in one or more computer-readable recording mediums and (comprises, but be not limited to, magnetic disc store, CD-ROM, optical memory etc.) in, described computer-readable recording medium has the computer readable program code that is contained in wherein.
With reference to the flow chart of the method according to this invention, system and computer program and/or block diagram illustrating the present invention.Each square frame in flow chart and/or the block diagram, and the combination of the square frame in flow chart and/or the block diagram obviously can be realized by computer program instructions.These computer program instructions can be provided for the processor of all-purpose computer, special-purpose computer, flush bonding processor or other programmable data treatment facilities, producing a machine, thereby instruction (described instruction is by the processor of computer or other programmable data processing device) generation is used for being implemented in the device of the function that one or more square frames of flow chart and/or block diagram stipulate.
These computer program instructions also can be kept in the memory read of one or more computers, each sort memory can command computer or other programmable data processing device play a role according to specific mode, thereby the instruction that is kept in the computer-readable memory produces a kind of manufacturing a product, and described manufacturing a product comprises the command device of the function of stipulating in the one or more square frames that are implemented in flow chart and/or block diagram.
Computer program instructions also can be loaded on one or more computers or other programmable data processing device, make and on described computer or other programmable data processing device, carry out a series of operating procedure, thereby on each such equipment, produce computer implemented process, so that the instruction of carrying out is provided for being implemented in the step of stipulating in one or more square frames of flow chart and/or block diagram on this equipment.
Abovely principle of the present invention is illustrated, but these explanations are exemplary, should not be construed as any limitation of the invention in conjunction with preferred implementation of the present invention.Those skilled in the art can carry out various changes and distortion to the present invention, and can not deviate from by the spirit and scope of the present invention that claim limited of enclosing.
Claims (15)
1. the method for a searching resource in peer-to-peer network comprises:
Receive metadata from other peer node in advance, the metadata of each peer node comprises can be for the fileinfo of sharing in this peer node;
In response to demand, judge that according to the metadata that receives which peer node claims to have described specific resource from the specific resource of other peer node requests;
Only to claiming that other peer node with described specific resource send request.
2. method according to claim 1 wherein receives step reception when network is idle of metadata in advance from other peer node.
3. method according to claim 2, wherein determine network free time by following at least a mode: a) utilize the detecting of network traffics survey tool, and/or b) specify by the user.
4. method according to claim 1, wherein said generator data are used one of following mode:
Local resource preparation of document index to other peer node in the network is shared in hope, with file institute index as metadata;
With the keyword of above-mentioned file index as metadata; Perhaps
Use Bloom filter algorithm the keyword of above-mentioned file index to be handled the generator data.
5. method according to claim 4, wherein judge that according to the metadata that receives which peer node claims that the step with described specific resource comprises:
When the user wishes to search for the resource that contains certain keyword, if metadata is the keyword of file index or file index, the keyword of described file index is compared successively with the metadata that obtains from each neighbor node, judge whether each neighbor node is to claim the neighbor node that has institute's request resource.
6. method according to claim 4, wherein judge that according to the metadata that receives which peer node claims that the step with described specific resource comprises:
When the metadata of neighbor node is to use Bloom filter method to generate, to the keyword use Bloom filter algorithm of user's input;
To compare from keyword data that generate and the metadata that obtains from each neighbor node, whether may be to judge each neighbor node for claiming the neighbor node that has institute's request resource.
7. method according to claim 1 also comprises metadata is sent to other peer node in the network.
8. equipment that is used for peer-to-peer network, described equipment constitutes one of a plurality of peer node in the peer-to-peer network, and described equipment comprises:
Communicator receives metadata from other peer node in advance, and the metadata of each node comprises can be for the fileinfo of sharing in this peer node;
Judgment means in response to the demand from the specific resource of other peer node requests, judges that according to the metadata that receives which peer node claims to have described specific resource;
Wherein said communicator also is used for the judgement in response to judgment means, only to claiming that the peer node with described specific file sends request.
9. method according to claim 8, wherein said communicator receives the metadata that described other peer node send from other peer node when network is idle.
10. method according to claim 9 also comprises by one of following manner and determines the network device of free time: a) utilize the detecting of network traffics survey tool, and b) specify by the user.
11. equipment according to claim 8 also comprises communication control unit, is used for controlling other peer node that described communicator sends to metadata network in advance.
12. equipment according to Claim 8, wherein said generator data are used one of following mode:
Local resource preparation of document index to other peer node in the network is shared in hope, with file institute index as metadata;
With the keyword of above-mentioned file index as metadata; Perhaps
Use Bloom filter algorithm the keyword of above-mentioned file index to be handled the generator data.
13. equipment according to claim 12, wherein said judgment means judges that according to the metadata that receives which peer node claims that the step with described specific resource comprises:
When the user wishes to search for the resource that contains certain keyword, if metadata is the keyword of file index or file index, the keyword of described file index is compared successively with the metadata that obtains from each neighbor node, judge whether each neighbor node is to claim the neighbor node that has institute's request resource.
14. equipment according to claim 12, wherein said judgment means judges that according to the metadata that receives which peer node claims that the step with described specific resource comprises:
When the metadata of neighbor node is to use Bloom filter method to generate, to the keyword use Bloom filter algorithm of user's input;
To compare from keyword data that generate and the metadata that obtains from each neighbor node, whether may be to judge each neighbor node for claiming the neighbor node that has institute's request resource.
15. a peer-to-peer network comprises a plurality of as each described equipment among the claim 8-14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810129457A CN101640623A (en) | 2008-07-31 | 2008-07-31 | Method and equipment for searching resource in peer-to-peer network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810129457A CN101640623A (en) | 2008-07-31 | 2008-07-31 | Method and equipment for searching resource in peer-to-peer network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101640623A true CN101640623A (en) | 2010-02-03 |
Family
ID=41615428
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810129457A Pending CN101640623A (en) | 2008-07-31 | 2008-07-31 | Method and equipment for searching resource in peer-to-peer network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101640623A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102256270A (en) * | 2010-05-20 | 2011-11-23 | 国际商业机器公司 | Dynamic self configuring overlays |
| CN102843426A (en) * | 2012-08-09 | 2012-12-26 | 网宿科技股份有限公司 | Method and system for sharing Web cached resource based on intelligent father node |
| CN103037017A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | Passive P2P data distribution method and node client-side |
| CN103229163A (en) * | 2010-12-17 | 2013-07-31 | 英派尔科技开发有限公司 | Device discovery in a ubiquitous computing environment |
| CN103460671A (en) * | 2011-01-17 | 2013-12-18 | 阿尔卡特朗讯公司 | Traffic localization in peer-to-peer networks |
| CN106101174A (en) * | 2016-05-25 | 2016-11-09 | 广州酷狗计算机科技有限公司 | A kind of method and apparatus transmitting data |
| CN106095769A (en) * | 2016-05-05 | 2016-11-09 | 北京思特奇信息技术股份有限公司 | The storage of a kind of data, method for reading data and the system of correspondence |
| CN106790387A (en) * | 2016-11-25 | 2017-05-31 | 同济大学 | A kind of P2P network optimized approach based on alien |
| CN108418882A (en) * | 2018-03-05 | 2018-08-17 | 北京云端智度科技有限公司 | A kind of CDN network content distribution system and method |
| CN109510877A (en) * | 2018-12-21 | 2019-03-22 | 中国航空工业集团公司西安航空计算技术研究所 | A kind of maintaining method, device and the storage medium of dynamic resource group |
| CN113382072A (en) * | 2021-06-09 | 2021-09-10 | 上海交通大学 | Peer-to-peer network-based federated search system |
| CN114422388A (en) * | 2022-01-24 | 2022-04-29 | 北京科软在线科技有限责任公司 | Remote data supervisory systems |
-
2008
- 2008-07-31 CN CN200810129457A patent/CN101640623A/en active Pending
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8650218B2 (en) | 2010-05-20 | 2014-02-11 | International Business Machines Corporation | Dynamic self configuring overlays |
| CN102256270B (en) * | 2010-05-20 | 2014-12-24 | 国际商业机器公司 | Dynamic self configuring overlays method and system |
| CN102256270A (en) * | 2010-05-20 | 2011-11-23 | 国际商业机器公司 | Dynamic self configuring overlays |
| CN103229163B (en) * | 2010-12-17 | 2016-08-10 | 英派尔科技开发有限公司 | Equipment in general calculation entironment finds |
| CN103229163A (en) * | 2010-12-17 | 2013-07-31 | 英派尔科技开发有限公司 | Device discovery in a ubiquitous computing environment |
| CN103460671A (en) * | 2011-01-17 | 2013-12-18 | 阿尔卡特朗讯公司 | Traffic localization in peer-to-peer networks |
| CN102843426B (en) * | 2012-08-09 | 2015-11-18 | 网宿科技股份有限公司 | Based on Web cache resources shared system and the method for intelligent father node |
| CN102843426A (en) * | 2012-08-09 | 2012-12-26 | 网宿科技股份有限公司 | Method and system for sharing Web cached resource based on intelligent father node |
| CN103037017A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | Passive P2P data distribution method and node client-side |
| CN106095769A (en) * | 2016-05-05 | 2016-11-09 | 北京思特奇信息技术股份有限公司 | The storage of a kind of data, method for reading data and the system of correspondence |
| CN106101174A (en) * | 2016-05-25 | 2016-11-09 | 广州酷狗计算机科技有限公司 | A kind of method and apparatus transmitting data |
| CN106790387A (en) * | 2016-11-25 | 2017-05-31 | 同济大学 | A kind of P2P network optimized approach based on alien |
| CN106790387B (en) * | 2016-11-25 | 2019-12-27 | 同济大学 | P2P network optimization method based on vernier |
| CN108418882A (en) * | 2018-03-05 | 2018-08-17 | 北京云端智度科技有限公司 | A kind of CDN network content distribution system and method |
| CN109510877A (en) * | 2018-12-21 | 2019-03-22 | 中国航空工业集团公司西安航空计算技术研究所 | A kind of maintaining method, device and the storage medium of dynamic resource group |
| CN109510877B (en) * | 2018-12-21 | 2022-03-15 | 中国航空工业集团公司西安航空计算技术研究所 | Method and device for maintaining dynamic resource group and storage medium |
| CN113382072A (en) * | 2021-06-09 | 2021-09-10 | 上海交通大学 | Peer-to-peer network-based federated search system |
| CN114422388A (en) * | 2022-01-24 | 2022-04-29 | 北京科软在线科技有限责任公司 | Remote data supervisory systems |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101640623A (en) | Method and equipment for searching resource in peer-to-peer network | |
| JP4277918B2 (en) | Data search device, data search method, and data search program | |
| JP2005353039A5 (en) | ||
| JP4806462B2 (en) | Peer-to-peer gateway | |
| JP2010250799A (en) | Method for requesting position information of resource, user node and server for the method | |
| JP2009193250A (en) | Distributed directory server, distributed directory system, distributed directory method, and program | |
| JP5845877B2 (en) | Information processing apparatus, data control method, and data control program | |
| Chen et al. | BloomCast: Efficient and effective full-text retrieval in unstructured P2P networks | |
| CN103107944A (en) | Content locating method and route equipment | |
| CN102821122A (en) | Method and apparatus for node distribution and computer program product | |
| Al-Dmour et al. | Peer-to-Peer Protocols for Resource Discovery in the Grid. | |
| Liu et al. | Efficient and scalable search on scale-free P2P networks | |
| Konstantinidis et al. | Intelligent search in social communities of smartphone users | |
| CN103118113B (en) | A kind of peer-to-peer network and network consultancy service method thereof | |
| JP2008269141A (en) | Overlay retrieving device, overlay retrieving system, overlay retrieving method, and program for overlay retrieval | |
| Chung et al. | Direction-aware resource discovery in large-scale distributed computing environments | |
| JP2006195533A (en) | Index server and p2p network system | |
| Gu et al. | A peer-to-peer architecture for context lookup | |
| KR20220078180A (en) | Apparatus for placing query in distributed networks environment and method thereof | |
| Blanas et al. | Contention-based performance evaluation of multidimensional range search in peer-to-peer networks | |
| JP2005038339A (en) | Grid computing system and computing resource collection method for grid computing system | |
| Murugan et al. | A survey of resource discovery approaches in distributed computing environment | |
| Rostami et al. | Semantic partitioning of peer-to-peer search space | |
| JP2003256478A (en) | Network for discovering object, construction method for network, method of discovering object, node, method of transferring query message of object, program, and recording medium | |
| Chen et al. | A hybrid peer-to-peer architecture for global geospatial web service discovery |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100203 |