Providing management functions in decentralized networks
First Claim
1. A method of providing management functions in a decentralized network, comprising steps of:
- creating a persistent node identifier to identify each of a plurality of nodes in the network, even though a different network address may be assigned to the node upon entering the network multiple times;
creating a mapping between the persistent node identifier of each node and a current network address assigned to that node, and revising the mapping to reflect the current network address assigned to the node upon each subsequent entry of the node into the network, such that an identity of each of the nodes can be resolved even though a current network address assigned to the node upon entering the network may vary from one entry to another;
asserting, by a particular one of the nodes, that it is allowed to perform a management function wherein the particular node directs operation of one or more other nodes in the network; and
using the persistent node identifier of the particular node, by a different one of the nodes that receives the assertion, to verify whether the particular node is allowed to perform the management function.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods, systems, and computer program products are disclosed for providing management functions in decentralized networks. Persistent identifiers are defined for nodes, allowing nodes to be identified across sessions and invocations, even though they re-enter the network with a different network address. Paths taken by content resources as they traverse the network (e.g. which nodes forwarded the content) are persisted, along with reputation information about nodes (e.g. indicating how successful they are at answering queries from peers). Trust relationships can be derived using the persisted information. A tiered broadcast strategy is defined for reducing the number of messages exchanged. Preferred embodiments leverage a web services implementation model.
165 Citations
35 Claims
-
1. A method of providing management functions in a decentralized network, comprising steps of:
-
creating a persistent node identifier to identify each of a plurality of nodes in the network, even though a different network address may be assigned to the node upon entering the network multiple times; creating a mapping between the persistent node identifier of each node and a current network address assigned to that node, and revising the mapping to reflect the current network address assigned to the node upon each subsequent entry of the node into the network, such that an identity of each of the nodes can be resolved even though a current network address assigned to the node upon entering the network may vary from one entry to another; asserting, by a particular one of the nodes, that it is allowed to perform a management function wherein the particular node directs operation of one or more other nodes in the network; and using the persistent node identifier of the particular node, by a different one of the nodes that receives the assertion, to verify whether the particular node is allowed to perform the management function. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A system for providing management functions in a decentralized network, comprising:
-
means for associating creating a persistent node identifier to identify each of a plurality of nodes in the network, even though a different network address may be assigned to the node upon entering the network multiple times; means for creating a mapping between the persistent node identifier of each node and a current network address assigned to that node, and revising the manning to reflect the current network address assigned to the node upon each subsequent entry of the node into the network, such that an identity of each of the nodes van be resolved even though a current network address assigned to the node upon entering the network may vary from one entry to another; means for associating a reputation with each of the nodes, wherein the reputation of each node is located using the node'"'"'s persistent node identifier; means for asserting, by a particular one of the nodes, that it is allowed to perform a management function wherein the particular node directs operation of one more other nodes in the network; means for locating, by a different one of the nodes that receives the assertion, the reputation of the particular node using its persistent node identifier; and means for concluding, by the different one, that the particular node is allowed to perform the management functions if the particular node has a suitable reputation. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30)
-
-
31. A computer program product for providing management functions in an ad hoc network, where a collection of nodes making up the network may change over time, the computer program product embodied on one or more computer-readable media and comprising;
-
computer-readable program code means for creating a persistent node identifier in identify each of a plurality of nodes in the network, even though a different network address may be assigned to the node upon entering the network multiple times; computer-readable program code means for creating a mapping between the persistent node identifier of each node and a current network address assigned to that node, and revising the mapping to reflect the current network address assigned to the node upon each subsequent entry of the node into the network, such that an identity of each of the nodes can be resolved even though a current network address assigned to the node upon entering the network may vary from one entry to another; computer-readable program code means for associating a reputation wit each of the nodes, wherein the reputation of each node is located using the node'"'"'s persistent node identifier; computer-readable program code means for asserting, by a particular one of the nodes, that it is allowed to perform a management function wherein the particular node directs operation of one or more other nodes in the network; computer-readable program code means for locating, by a different one of the nodes that receives the assertion, the reputation of the particular node using its persistent node identifier; and computer-readable program code means for concluding by the different one, that the particular node is allowed to perform management functions if the particular node has a suitable reputation. - View Dependent Claims (32, 33, 34, 35)
-
Specification