US6857012B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for initializing a new node in a network
Assignee: Intel Corp
•
Filing: 2001-05-18
•
Granted: 2005-02-15
•
Expires: 2021-05-18
Abstract
Abstract A method for initializing a new node in a network. The network has multiple nodes arranged in a virtual tree format. The new node is a node of the tree, and each node of the tree has a set of attributes and a set of rolled up attributes to identify each node. A query is automatically sent to the nodes to determine what contents to download. The contents are then stored as block files in the nodes. The query contains the set of attributes and rolled up attributes for the new node. The query receives replies from a subset of the nodes that have the contents needed for the new node. Each reply identifies what subset of the block files is available and the performance characteristics of that replying node. Then the desired contents from the subset of the block files from nodes that are least congested is downloaded.
Inventors
- 👤 Siew Yong Sim
- 👤 Desmond Cho-Hung Chan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 20:19
CPC Classifications
H; H04; H04L; H04L67/00; H04L67/01; H04L67/10; H04L67/1095; G; G06; G06F; G06F16/00; G06F16/10; G06F16/18; G06F16/182; G06F16/188; H04L47/00; H04L47/10; H04L47/12; H04L47/125; H04L67/1001; H04L67/1004; H04L67/1008; H04L67/101; H04L67/1017; H04L67/1019; H04L67/1023; H04L67/1027; H04L67/1034; H04L67/1097; H04L69/00; H04L69/14; Y; Y02; Y02D; Y02D30/00; Y02D30/50
Claims Analysis
Total Claims: 47
Claim 1
Independent Claim
180 words
A method for initializing a new node in a network comprising: adding a new node to a network having a plurality of nodes, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes for identification; sending a query automatically to the plurality of nodes to determine what contents to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; downloading desired portions of the contents from the subset of the block files from the replying nodes that are least congested.
Claim 2
Independent Claim
180 words
A method for initializing a new node in a network comprising: adding a new node to a network having a plurality of nodes, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes for identification; sending a query automatically to the plurality of nodes to determine what contents to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; downloading desired portions of the contents from the subset of the block files from the replying nodes that are least congested.
Claim 3
Dependent Claim
13 words
The method of claim 1 , wherein the network comprises a packet-communication network.
Claim 4
Dependent Claim
36 words
The method of claim 1 , wherein the set of attributes comprises a bitmap and the set of rolled up attributes comprises a combination of the set of attributes of all lineal descendants of the node.
Claim 5
Dependent Claim
21 words
The method of claim 3 , wherein the combination comprises the binary OR of the all lineal descendants of the node.
Claim 6
Dependent Claim
65 words
The method of claim 1 , wherein the sending the query automatically to the plurality of nodes comprises: announcing the new node's inclusion in the network by sending a notification to at least one neighbor node; and forwarding the notification to nodes neighboring the at least one neighbor node, the forwarding continuing until each of the plurality of nodes in the network receives the notification.
Claim 7
Dependent Claim
19 words
The method of claim 5 , wherein the new node does not receive the notification from a neighbor node.
Claim 8
Dependent Claim
22 words
The method of claim 6 , wherein the content is stored as block files in the plurality of nodes having the content.
Claim 9
Dependent Claim
37 words
The method of claim 7 , wherein each of the replies from a replying node comprises: identification of what content the new node should have; and identification of portions of the content available in the replying node.
Claim 10
Dependent Claim
31 words
The method of claim 8 , wherein the downloading the desired portion of the content comprises downloading a desired subset of the block files from the replying nodes in close proximity.
Claim 11
Dependent Claim
16 words
The method of claim 9 , wherein the least congested is determined from the performance characteristics.
Claim 12
Dependent Claim
18 words
The method of claim 9 , wherein the nodes in close proximity comprise nodes having the least latency.
Claim 13
Dependent Claim
24 words
The method of claim 9 , wherein the downloading the desired subset of block files, is performed in parallel from the least congested nodes.
Claim 14
Independent Claim
179 words
A method for initializing a new node in a network comprising: adding a new node to a network having a plurality of nodes, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes for identification; sending a query automatically from the new node to the plurality of nodes to determine what contents to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and downloading desired subsets of the block files from the replying nodes that are least congested.
Claim 15
Independent Claim
179 words
A method for initializing a new node in a network comprising: adding a new node to a network having a plurality of nodes, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes for identification; sending a query automatically from the new node to the plurality of nodes to determine what contents to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and downloading desired subsets of the block files from the replying nodes that are least congested.
Claim 16
Dependent Claim
13 words
The method of claim 13 , wherein the network comprises a packet-communication network.
Claim 17
Dependent Claim
35 words
The method of claim 13 , wherein the set of attributes comprises bitmap and the set of rolled up attributes comprises a combination of the set of attributes of all lineal descendants of the node.
Claim 18
Dependent Claim
195 words
A machine-readable medium that provides instructions, which when executed by a machine, causes the machine to perform operations comprising: initializing a new node in a network, the machine-readable medium configured to: add a new node to a network having a plurality of nodes, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set rolled up attributes for identification; send a query automatically to the plurality of nodes to determine what content to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; receive replies to the query from a subset of the plurality of nodes having the content for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and download a desired subset of the block files from the replying nodes that are least congested.
Claim 19
Dependent Claim
195 words
A machine-readable medium that provides instructions, which when executed by a machine, causes the machine to perform operations comprising: initializing a new node in a network, the machine-readable medium configured to: add a new node to a network having a plurality of nodes, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set rolled up attributes for identification; send a query automatically to the plurality of nodes to determine what content to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; receive replies to the query from a subset of the plurality of nodes having the content for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and download a desired subset of the block files from the replying nodes that are least congested.
Claim 20
Dependent Claim
14 words
The machine-readable medium of claim 16 , wherein the network comprises a packet-communication network.
Claim 21
Dependent Claim
37 words
The machine-readable medium of claim 16 , wherein the set of attributes comprises a bitmap and the set of rolled up attributes comprises a combination of the set of attributes of all lineal descendants of the node.
Claim 22
Dependent Claim
22 words
The machine-readable medium of claim 18 , wherein the combination comprises the binary OR of the all lineal descendants of the node.
Claim 23
Dependent Claim
65 words
The machine-readable medium of claim 16 , wherein the send a query automatically to the plurality of nodes comprises: announcing the new node's inclusion in the network by sending a notification to at least one neighbor node; forwarding the notification to nodes neighboring the at least on neighbor node, the forwarding continuing until each of the plurality of nodes in the network receives the notification.
Claim 24
Dependent Claim
20 words
The machine-readable medium of claim 20 , wherein the new node does not receive the notification from a neighbor node.
Claim 25
Dependent Claim
23 words
The machine-readable medium of claim 21 , wherein the content is stored as block files in the plurality of nodes having the content.
Claim 26
Dependent Claim
44 words
The machine-readable medium of claim 22 , wherein each of the replies from a replying node comprises: identification of what content the new node should have; identification of portions of the content available in the replying node; and performance characteristics of the replying node.
Claim 27
Dependent Claim
37 words
The machine-readable medium of claim 23 , wherein the download the desired portion of the content comprises computer program product configured to download a desired subset of the block files from the replying nodes in close proximity.
Claim 28
Dependent Claim
17 words
The machine-readable medium of claim 24 , wherein the least congested is determined from the performance characteristics.
Claim 29
Dependent Claim
19 words
The machine-readable medium of claim 24 , wherein the nodes in close proximity comprise nodes having the least latency.
Claim 30
Dependent Claim
24 words
The machine-readable medium of claim 24 , wherein the download the desired subset of block file is performed in parallel from the replying nodes.
Claim 31
Independent Claim
218 words
An apparatus for initializing a new node in a network comprising: a network having a plurality of nodes, each of the plurality of nodes having one or more distribution servers in a distribution server cluster, the plurality of nodes having one or more content for distribution in the network; a new node added to the network, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes or identification; the new node sending a query automatically to the plurality of nodes to determine what contents to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; the new node receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and the new node downloading desired subsets of the block files the from the replying nodes that are least congested.
Claim 32
Independent Claim
218 words
An apparatus for initializing a new node in a network comprising: a network having a plurality of nodes, each of the plurality of nodes having one or more distribution servers in a distribution server cluster, the plurality of nodes having one or more content for distribution in the network; a new node added to the network, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes or identification; the new node sending a query automatically to the plurality of nodes to determine what contents to download, the content being stored as block files in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; the new node receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and the new node downloading desired subsets of the block files the from the replying nodes that are least congested.
Claim 33
Dependent Claim
13 words
The apparatus of claim 28 , wherein the network comprises a packet-communication network.
Claim 34
Dependent Claim
36 words
The apparatus of claim 28 , wherein the set of attributes comprises a bitmap and the set of rolled up attributes comprises a combination of the set of attributes of all lineal descendants of the node.
Claim 35
Dependent Claim
21 words
The apparatus of claim 30 , wherein the combination comprises the binary OR of the all lineal descendants of the node.
Claim 36
Dependent Claim
65 words
The apparatus of claim 28 , wherein the sending a query automatically to the plurality of nodes comprises: announcing the new node's inclusion in the network by sending a notification to at least one neighbor node; and forwarding the notification to nodes neighboring the at least on neighbor node, the forwarding continuing until each of the plurality of nodes in the network receives the notification.
Claim 37
Dependent Claim
19 words
The apparatus of claim 32 , wherein the new node does not receive the notification from a neighbor node.
Claim 38
Dependent Claim
22 words
The apparatus of claim 33 , wherein the content is stored as block files in the plurality of nodes having the content.
Claim 39
Dependent Claim
43 words
The apparatus of claim 34 , wherein each of the replies from a replying node comprises: identification of what content the new node should have; identification of portions of the content available in the replying node; and performance characteristics of the replying node.
Claim 40
Dependent Claim
31 words
The apparatus of claim 35 , wherein the downloading the desired portion of the content comprises downloading a desired subset of the block files from the replying nodes in close proximity.
Claim 41
Dependent Claim
16 words
The apparatus of claim 36 , wherein the least congested is determined from the performance characteristics.
Claim 42
Dependent Claim
18 words
The apparatus of claim 36 , wherein the nodes in close proximity comprise nodes having the least latency.
Claim 43
Dependent Claim
23 words
The apparatus of claim 36 , wherein the downloading the desired subset of block files is performed in parallel from the replying nodes.
Claim 44
Independent Claim
224 words
A system for initializing a new node in a network comprising: a storage device coupled to a network; the network having a plurality of nodes, each of the plurality of nodes having one or more distribution servers in a distribution server cluster, the plurality of nodes having one or more content for distribution in the network; a new node added to the network, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes for identification; the new node sending a query automatically to the plurality of nodes to determine what contents to download, the content being stored as block file in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; the new node receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and the new node downloading desired subsets of the block files from the replying nodes that are least congested.
Claim 45
Independent Claim
224 words
A system for initializing a new node in a network comprising: a storage device coupled to a network; the network having a plurality of nodes, each of the plurality of nodes having one or more distribution servers in a distribution server cluster, the plurality of nodes having one or more content for distribution in the network; a new node added to the network, wherein the plurality of nodes is arranged in the form of a virtual tree and the new node is a node of the tree, each node of the tree having a set of attributes and a set of rolled up attributes for identification; the new node sending a query automatically to the plurality of nodes to determine what contents to download, the content being stored as block file in one or more nodes of the network, the query comprising the set of attributes and the set of rolled up attributes for the new node; the new node receiving replies to the query from a subset of the plurality of nodes having the contents for the new node, wherein each of the replies identifies what subset of the block files is available in a replying node and performance characteristics of the replying node; and the new node downloading desired subsets of the block files from the replying nodes that are least congested.
Claim 46
Dependent Claim
13 words
The system of claim 40 , wherein the network comprises a packet-communication network.
Claim 47
Dependent Claim
36 words
The system of claim 40 , wherein the set of attributes comprises a bitmap and the set of rolled up attributes comprises a combination of the set of attributes of all lineal descendants of the node.
References Cited (Backward Citations)
US4466060A
Cited
US5079767A
Cited
US5367698A
Cited
US5903566A
Cited
US5905847A
Cited
US5751968A
Cited
US5926101A
Cited
US5924116A
Cited
US6038601A
Cited
US6105029A
Cited
US6081840A
Cited
EP0967559A1
Cited
US6370146B1
Cited
US6515967B1
Cited
US6108703A
Cited
US20020138640A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2008-02-15 | 2008-08-16 | 2009-02-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2012-02-15 | 2012-08-16 | 2013-02-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2016-02-15 | 2016-08-16 | 2017-02-15 | $7700.00 | Window Closed / Lapsed |