Patent US7263560B2 successfully refreshed from Google Patents.
US7263560B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decentralized peer-to-peer advertisement
Assignee: Oracle America Inc
•
Filing: 2002-08-30
•
Granted: 2007-08-28
•
Expires: 2022-08-30
Abstract
Abstract Embodiments of a shared resource distributed index mechanism that peers in a peer-to-peer network may utilize to distribute index entries corresponding to resources to indexes of shared resources among one or more other peers. These indexes may be used to direct queries to peers where the queries are most likely to be answered. When a query is received by a rendezvous peer including one or more indexes, contents of the query may be “looked up” in the index to find matches. The results of the lookup may include information on one or peer(s) that may hold advertisement(s) to the resource requested by the query. The query may then be forwarded to one or more peers that may hold the advertisement for the resource. Embodiments may provide “loosely-coupled” distribution of index entries for use in querying for resources in the peer-to-peer network.
Inventors
- 👤 Mohamed M. Abdelaziz
- 👤 Bernard A. Traversat
- 👤 Michael J. Duigou
- 👤 Jean-Christophe Hugly
- 👤 Sherif Botros
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 19:55
CPC Classifications
H; H04; H04L; H04L67/00; H04L67/01; H04L67/10; H04L67/104; H04L67/1059; H04L67/1061; H04L67/1068; H04L67/107; H04L67/50; H04L67/51; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/329; H04L2101/00; H04L2101/30; H04L2101/365; H04L61/00; H04L61/30
Claims Analysis
Total Claims: 55
Claim 1
Independent Claim
213 words
A peer computing system, comprising: a plurality of peer nodes, wherein each peer node comprises a network interface configured to communicate with one or more other ones of said peer nodes over one or more networks, and wherein each peer node is configured to store advertisements to network resources, wherein each network resource advertisement comprises a plurality of key/value pairs; one of the plurality of peer nodes configured to: cache an index comprising one or more key/value pairs from one or more network resource advertisements stored on others of the plurality of peer nodes, wherein each key/value pair indicates a particular one of the others of the peer nodes that a corresponding network resource advertisement is stored on; receive a query message from another one of the plurality of peer nodes, wherein the query message requests a particular network resource, and wherein the query message includes one or more key/value pairs of an advertisement for the particular network resource; perform a search of the cached index for matches to the one or more key/value pairs from the query message; and if one or more matching key/value pairs is found in the cached index, forward the query message to one or more of the plurality of peer nodes indicated by the matching key/value pairs.
Claim 2
Dependent Claim
213 words
A peer computing system, comprising: a plurality of peer nodes, wherein each peer node comprises a network interface configured to communicate with one or more other ones of said peer nodes over one or more networks, and wherein each peer node is configured to store advertisements to network resources, wherein each network resource advertisement comprises a plurality of key/value pairs; one of the plurality of peer nodes configured to: cache an index comprising one or more key/value pairs from one or more network resource advertisements stored on others of the plurality of peer nodes, wherein each key/value pair indicates a particular one of the others of the peer nodes that a corresponding network resource advertisement is stored on; receive a query message from another one of the plurality of peer nodes, wherein the query message requests a particular network resource, and wherein the query message includes one or more key/value pairs of an advertisement for the particular network resource; perform a search of the cached index for matches to the one or more key/value pairs from the query message; and if one or more matching key/value pairs is found in the cached index, forward the query message to one or more of the plurality of peer nodes indicated by the matching key/value pairs.
Claim 3
Dependent Claim
109 words
The peer computing system as recited in claim 1 , wherein the cached index is a hash table comprising hashes of the one or more key/value pairs from the one or more network resource advertisements, and wherein, to perform a search of the cached index for matches to the one or more key/value pairs from the query message, the one of the plurality of peer nodes is further configured to: hash the one or more key/value pairs from the query message; and compare the hashed one or more key/value pairs from the query message to the one or more key/value pairs from the one or more network resource advertisements.
Claim 4
Dependent Claim
49 words
The peer computing system as recited in claim 1 , wherein, if one or more matching key/value pairs is found in the cached index, said search returns a peer identifier for each of the one or more of the plurality of peer nodes indicated by the matching key/value pairs.
Claim 5
Dependent Claim
55 words
The peer computing system as recited in claim 1 , wherein the one of the plurality of peer nodes is a rendezvous peer configured to: cache network resource information including one or more indexes of key/value pairs; and assist the plurality of peers in discovery of the network resources using the cached network resource information.
Claim 6
Dependent Claim
35 words
The peer computing system as recited in claim 1 , wherein the one of the plurality of peer nodes is further configured to provide the cached index to another of the plurality of peer nodes.
Claim 7
Dependent Claim
75 words
The peer computing system as recited in claim 1 , wherein each of the one or more of the plurality of peer nodes indicated by the matching key/value pairs is configured to: receive the query message forwarded from the one of the plurality of peer nodes; and inform the other one of the plurality of peer nodes that the peer node stores an advertisement for the particular network resource in response to the query message.
Claim 8
Dependent Claim
58 words
The peer computing system as recited in claim 6 , wherein the other one of the plurality of peer nodes is configured to access the particular network resource in accordance with the advertisement for the particular network resource stored on one of the one or more of the plurality of peer nodes indicated by the matching key/value pairs.
Claim 9
Dependent Claim
53 words
The peer computing system as recited in claim 1 , wherein, if no matching key/value pair is found in the cached index, the one of the plurality of peer nodes is further configured to forward the query message to at least one other peer node comprising a different cached index of key/value pairs.
Claim 10
Dependent Claim
55 words
The peer computing system as recited in claim 1 , wherein the one of the plurality of peer nodes is further configured to: receive one or more key/value pairs from at least one of the others of the plurality of peer nodes; and update the cached index with the received one or more key/value pairs.
Claim 11
Dependent Claim
45 words
The peer computing system as recited in claim 1 , wherein the one of the plurality of peer nodes is further configured to garbage collect the cached index to remove key/value pairs from network resource advertisements stored on peer nodes that are no longer accessible.
Claim 12
Dependent Claim
69 words
The peer computing system as recited in claim 1 , wherein the plurality of peer nodes are configured to participate in a peer-to-peer environment on the network in accordance with one or more peer-to-peer platform protocols for enabling the plurality of peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share the network resources in the peer-to-peer environment.
Claim 13
Dependent Claim
216 words
A peer computing system, comprising: a plurality of peer nodes, wherein each peer node comprises a network interface configured to communicate with one or more other ones of said peer nodes over one or more networks, and wherein each peer node is configured to store advertisements to network resources, wherein each network resource advertisement comprises a plurality of key/value pairs; a plurality of rendezvous nodes each configured to: cache an index comprising one or more key/value pairs from one or more network resource advertisements stored on one or more of the plurality of peer nodes local to the particular rendezvous node, wherein each key/value pair indicates a particular one of the local peer nodes that a corresponding network resource advertisement is stored on; receive a query message from one of the plurality of peer nodes, wherein the query message requests a particular network resource, and wherein the query message includes one or more key/value pairs of an advertisement for the particular network resource; perform a search of the cached index for matches to the one or more key/value pairs from the query message; and if one or more matching key/value pairs is found in the cached index, forward the query message to one or more of the local peer nodes indicated by the matching key/value pairs.
Claim 14
Dependent Claim
216 words
A peer computing system, comprising: a plurality of peer nodes, wherein each peer node comprises a network interface configured to communicate with one or more other ones of said peer nodes over one or more networks, and wherein each peer node is configured to store advertisements to network resources, wherein each network resource advertisement comprises a plurality of key/value pairs; a plurality of rendezvous nodes each configured to: cache an index comprising one or more key/value pairs from one or more network resource advertisements stored on one or more of the plurality of peer nodes local to the particular rendezvous node, wherein each key/value pair indicates a particular one of the local peer nodes that a corresponding network resource advertisement is stored on; receive a query message from one of the plurality of peer nodes, wherein the query message requests a particular network resource, and wherein the query message includes one or more key/value pairs of an advertisement for the particular network resource; perform a search of the cached index for matches to the one or more key/value pairs from the query message; and if one or more matching key/value pairs is found in the cached index, forward the query message to one or more of the local peer nodes indicated by the matching key/value pairs.
Claim 15
Dependent Claim
105 words
The peer computing system as recited in claim 12 , wherein the cached index is a hash table comprising hashes of the one or more key/value pairs from the one or more network resource advertisements, and wherein, to perform a search of the cached index for matches to the one or more key/value pairs from the query message, the particular rendezvous node is further configured to: hash the one or more key/value pairs from the query message; and compare the hashed one or more key/value pairs from the query message to the one or more key/value pairs from the one or more network resource advertisements.
Claim 16
Dependent Claim
48 words
The peer computing system as recited in claim 12 , wherein, if one or more matching key/value pairs is found in the cached index, said search returns a peer identifier for each of the one or more of the local peer nodes indicated by the matching key/value pairs.
Claim 17
Dependent Claim
36 words
The peer computing system as recited in claim 12 , wherein each of the plurality of rendezvous nodes is configured to share the cached index with one or more others of the plurality of rendezvous nodes.
Claim 18
Dependent Claim
70 words
The peer computing system as recited in claim 12 , wherein each of the one or more of the local peer nodes indicated by the matching key/value pairs is configured to: receive the query message forwarded from the particular rendezvous node; and inform the one of the plurality of peer nodes that the local peer node stores an advertisement for the particular network resource in response to the query message.
Claim 19
Dependent Claim
56 words
The peer computing system as recited in claim 16 , wherein the one of the plurality of peer nodes is configured to access the particular network resource in accordance with the advertisement for the particular network resource stored on one of the one or more of the local peer nodes indicated by the matching key/value pairs.
Claim 20
Dependent Claim
53 words
The peer computing system as recited in claim 12 , wherein, if no matching key/value pair is found in the cached index, the particular rendezvous node is further configured to forward the query message to at least one other of the plurality of rendezvous nodes comprising a different cached index of key/value pairs.
Claim 21
Dependent Claim
47 words
The peer computing system as recited in claim 12 , wherein the particular rendezvous node is further configured to: receive one or more key/value pairs from at least one of the local peer nodes; and update the cached index with the received one or more key/value pairs.
Claim 22
Dependent Claim
42 words
The peer computing system as recited in claim 12 , wherein the particular rendezvous node is further configured to garbage collect the cached index to remove key/value pairs from network resource advertisements stored on local peer nodes that are no longer accessible.
Claim 23
Dependent Claim
79 words
The peer computing system as recited in claim 12 , wherein the plurality of peer nodes and the plurality of rendezvous nodes are configured to participate in a peer-to-peer environment on the network in accordance with one or more peer-to-peer platform protocols for enabling the plurality of peer nodes to discover each other, communicate with each other, discover the network resources, and cooperate with each other to form peer groups and share the network resources in the peer-to-peer environment.
Claim 24
Dependent Claim
161 words
A peer node comprising: one or more network interfaces for coupling to a network; a cached index comprising one or more key/value pairs from one or more network resource advertisements stored on one or more other peer nodes on the network, wherein each key/value pair indicates a particular one of the other peer nodes that a corresponding network resource advertisement is stored on; wherein the peer node is configured to: receive a query message from another peer node on the network, wherein the query message requests a particular network resource, and wherein the query message includes one or more key/value pairs of an advertisement for the particular network resource; perform a search of the cached index for matches to the one or more key/value pairs from the query message; and if a matching key/value pair is found in the cached index, forward the query message to one of the one or more other peer nodes indicated by the matching key/value pair.
Claim 25
Dependent Claim
161 words
A peer node comprising: one or more network interfaces for coupling to a network; a cached index comprising one or more key/value pairs from one or more network resource advertisements stored on one or more other peer nodes on the network, wherein each key/value pair indicates a particular one of the other peer nodes that a corresponding network resource advertisement is stored on; wherein the peer node is configured to: receive a query message from another peer node on the network, wherein the query message requests a particular network resource, and wherein the query message includes one or more key/value pairs of an advertisement for the particular network resource; perform a search of the cached index for matches to the one or more key/value pairs from the query message; and if a matching key/value pair is found in the cached index, forward the query message to one of the one or more other peer nodes indicated by the matching key/value pair.
Claim 26
Dependent Claim
103 words
The peer node as recited in claim 22 , wherein the cached index is a hash table comprising hashes of the one or more key/value pairs from the one or more network resource advertisements, and wherein, to perform a search of the cached index for matches to the one or more key/value pairs from the query message, the peer node is further configured to: hash the one or more key/value pairs from the query message; and compare the hashed one or more key/value pairs from the query message to the one or more key/value pairs from the one or more network resource advertisements.
Claim 27
Dependent Claim
44 words
The peer node as recited in claim 22 , wherein, if a matching key/value pair is found in the cached index, said search returns a peer identifier for the one of the one or more other peer nodes indicated by the matching key/value pair.
Claim 28
Dependent Claim
58 words
The peer node as recited in claim 22 , wherein the peer node is a rendezvous peer, and wherein the peer node is further configured to: cache network resource information including one or more indexes of key/value pairs; and assist other peer nodes on the network in discovery of the network resources using the cached network resource information.
Claim 29
Dependent Claim
23 words
The peer node as recited in claim 22 , further configured to provide the cached index to other peer nodes on the network.
Claim 30
Dependent Claim
50 words
The peer node as recited in claim 22 , wherein, if no matching key/value pair is found in the cached index, the peer node is further configured to forward the query message to at least one other peer node on the network comprising a different cached index of key/value pairs.
Claim 31
Dependent Claim
38 words
The peer node as recited in claim 22 , further configured to: receive one or more key/value pairs from another peer node on the network; and update the cached index with the received one or more key/value pairs.
Claim 32
Dependent Claim
34 words
The peer node as recited in claim 22 , further configured to garbage collect the cached index to remove key/value pairs from network resource advertisements stored on peer nodes that are no longer accessible.
Claim 33
Dependent Claim
64 words
The peer node as recited in claim 22 , further configured to participate in a peer-to-peer environment with other peer nodes on the network in accordance with one or more peer-to-peer platform protocols for enabling the peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share the network resources in the peer-to-peer environment.
Claim 34
Independent Claim
120 words
A method, comprising: receiving from a peer node a query message including one or more key/value pairs of an advertisement for a particular network resource; searching for matches to the one or more key/value pairs from the query message in a cached index comprising one or more key/value pairs from one or more network resource advertisements stored on other peer nodes, wherein each key/value pair in the cached index indicates a particular one of the other peer nodes that a corresponding network resource advertisement is stored on; and if one or more matching key/value pairs is found in the cached index, forwarding the query message to one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 35
Independent Claim
120 words
A method, comprising: receiving from a peer node a query message including one or more key/value pairs of an advertisement for a particular network resource; searching for matches to the one or more key/value pairs from the query message in a cached index comprising one or more key/value pairs from one or more network resource advertisements stored on other peer nodes, wherein each key/value pair in the cached index indicates a particular one of the other peer nodes that a corresponding network resource advertisement is stored on; and if one or more matching key/value pairs is found in the cached index, forwarding the query message to one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 36
Dependent Claim
93 words
The method as recited in claim 31 , wherein the cached index is a hash table comprising hashes of the one or more key/value pairs from the one or more network resource advertisements, and wherein searching for matches to the one or more key/value pairs from the query message in a cached index comprises: hashing the one or more key/value pairs from the query message; and comparing the hashed one or more key/value pairs from the query message to the one or more key/value pairs from the one or more network resource advertisements.
Claim 37
Dependent Claim
46 words
The method as recited in claim 31 , wherein, if one or more matching key/value pairs is found in the cached index, said searching returns a peer identifier for each of the one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 38
Dependent Claim
68 words
The method as recited in claim 31 , wherein said receiving, said searching, and said forwarding are performed by a rendezvous peer participating in a peer-to-peer networking environment implemented in accordance with one or more peer-to-peer platform protocol for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share the network resources in the peer-to-peer environment.
Claim 39
Dependent Claim
21 words
The method as recited in claim 34 , further comprising the rendezvous peer providing the cached index to another rendezvous peer.
Claim 40
Dependent Claim
82 words
The method as recited in claim 31 further comprising: each of the one or more of the other peer nodes indicated by the matching key/value pairs receiving the forwarded query message; and each of the one or more of the other peer nodes indicated by the matching key/value pairs informing the peer node that originated the query message that the peer node that received the forwarded query message stores an advertisement for the particular network resource in response to the query message.
Claim 41
Dependent Claim
49 words
The method as recited in claim 36 , further comprising the peer node that originated the query message accessing the particular network resource in accordance with the advertisement for the particular network resource stored on one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 42
Dependent Claim
40 words
The method as recited in claim 31 , further comprising, if no matching key/value pair is found in the cached index, forwarding the query message to at least one other peer node comprising a different cached index of key/value pairs.
Claim 43
Dependent Claim
33 words
The method as recited in claim 31 , further comprising: receiving one or more key/value pairs from another peer node; and updating the cached index with the received one or more key/value pairs.
Claim 44
Dependent Claim
32 words
The method as recited in claim 31 , further comprising garbage collecting the cached index to remove key/value pairs from network resource advertisements stored on peer nodes that are no longer accessible.
Claim 45
Dependent Claim
132 words
A computer-accessible storage medium, comprising program instructions, wherein the program instructions are configured to implement: receiving from a peer node a query message including one or more key/value pairs of an advertisement for a particular network resource; searching for matches to the one or more key/value pairs from the query message in a cached index comprising one or more key/value pairs from one or more network resource advertisements stored on other peer nodes, wherein each key/value pair in the cached index indicates a particular one of the other peer nodes that a corresponding network resource advertisement is stored on; and if one or more matching key/value pairs is found in the cached index, forwarding the query message to one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 46
Dependent Claim
132 words
A computer-accessible storage medium, comprising program instructions, wherein the program instructions are configured to implement: receiving from a peer node a query message including one or more key/value pairs of an advertisement for a particular network resource; searching for matches to the one or more key/value pairs from the query message in a cached index comprising one or more key/value pairs from one or more network resource advertisements stored on other peer nodes, wherein each key/value pair in the cached index indicates a particular one of the other peer nodes that a corresponding network resource advertisement is stored on; and if one or more matching key/value pairs is found in the cached index, forwarding the query message to one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 47
Dependent Claim
104 words
The computer-accessible storage medium as recited in claim 41 , wherein the cached index is a hash table comprising hashes of the one or more key/value pairs from the one or more network resource advertisements, and wherein, in said searching for matches to the one or more key/value pairs from the query message in a cached index, the program instructions are further configured to implement: hashing the one or more key/value pairs from the query message; and comparing the hashed one or more key/value pairs from the query message to the one or more key/value pairs from the one or more network resource advertisements.
Claim 48
Dependent Claim
48 words
The computer-accessible storage medium as recited in claim 41 , wherein, if one or more matching key/value pairs is found in the cached index, said searching returns a peer identifier for each of the one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 49
Dependent Claim
70 words
The computer-accessible storage medium as recited in claim 41 , wherein said receiving, said searching, and said forwarding are performed by a rendezvous peer participating in a peer-to-peer networking environment implemented in accordance with one or more peer-to-peer platform protocol for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share the network resources in the peer-to-peer environment.
Claim 50
Dependent Claim
30 words
The computer-accessible storage medium as recited in claim 44 , wherein the program instructions are further configured to implement the rendezvous peer providing the cached index to another rendezvous peer.
Claim 51
Dependent Claim
91 words
The computer-accessible storage medium as recited in claim 41 wherein the program instructions are further configured to implement: each of the one or more of the other peer nodes indicated by the matching key/value pairs receiving the forwarded query message; and each of the one or more of the other peer nodes indicated by the matching key/value pairs informing the peer node that originated the query message that the peer node that received the forwarded query message stores an advertisement for the particular network resource in response to the query message.
Claim 52
Dependent Claim
58 words
The computer-accessible storage medium as recited in claim 46 , wherein the program instructions are further configured to implement the peer node that originated the query message accessing the particular network resource in accordance with the advertisement for the particular network resource stored on one or more of the other peer nodes indicated by the matching key/value pairs.
Claim 53
Dependent Claim
49 words
The computer-accessible storage medium as recited in claim 41 , wherein the program instructions are further configured to implement, if no matching key/value pair is found in the cached index, forwarding the query message to at least one other peer node comprising a different cached index of key/value pairs.
Claim 54
Dependent Claim
42 words
The computer-accessible storage medium as recited in claim 41 , wherein the program instructions are further configured to implement: receiving one or more key/value pairs from another peer node; and updating the cached index with the received one or more key/value pairs.
Claim 55
Dependent Claim
41 words
The computer-accessible storage medium as recited in claim 41 , wherein the program instructions are further configured to implement garbage collecting the cached index to remove key/value pairs from network resource advertisements stored on peer nodes that are no longer accessible.
References Cited (Backward Citations)
EP0022876A1
Cited
US5109483A
Cited
US5224205A
Cited
US5517622A
Cited
US5442637A
Cited
US5931916A
Cited
US6671746B1
Cited
US5675782A
Cited
US5729682A
Cited
US5719861A
Cited
US5675629A
Cited
US5999530A
Cited
US5768527A
Cited
US5758087A
Cited
US5805820A
Cited
US5896503A
Cited
US6032175A
Cited
US6408341B1
Cited
US5941988A
Cited
US6721286B1
Cited
US6212558B1
Cited
US6105064A
Cited
US6061734A
Cited
US6795917B1
Cited
US6477590B1
Cited
US6269099B1
Cited
US6324580B1
Cited
US6182136B1
Cited
EP0993163A1
Cited
US6651105B1
Cited
US20050053093A1
Cited
US6826763B1
Cited
US6611872B1
Cited
US6456600B1
Cited
US6892230B1
Cited
US6574655B1
Cited
US20030067912A1
Cited
US6810259B1
Cited
US6782527B1
Cited
US6845091B2
Cited
US6778491B1
Cited
US6658540B1
Cited
US6742023B1
Cited
US20010042204A1
Cited
US6591310B1
Cited
US6865600B1
Cited
US6816461B1
Cited
US6732180B1
Cited
US6633761B1
Cited
US6681282B1
Cited
US20040068477A1
Cited
US20020062375A1
Cited
US6636854B2
Cited
US20020073204A1
Cited
US20020073075A1
Cited
US20020107935A1
Cited
US7136927B2
Cited
US7065587B2
Cited
US20020161821A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2010-08-27 | 2011-02-26 | 2011-08-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2014-08-27 | 2015-02-26 | 2015-08-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2018-08-27 | 2019-02-26 | 2019-08-28 | $7700.00 | Window Closed / Lapsed |