In distributed networks of cooperating nodes, it is useful to perform resource discovery in a manner that is efficient but that also minimizes communication complexity. A system and method in which nodes in a network efficiently are provided with information about the presence of, and other informat
In distributed networks of cooperating nodes, it is useful to perform resource discovery in a manner that is efficient but that also minimizes communication complexity. A system and method in which nodes in a network efficiently are provided with information about the presence of, and other information about, other nodes in the network provides tangible benefits. In general, in one aspect, a system and method according to the invention features a distributed method for communicating information among a plurality of nodes. The method includes choosing, by a first node, one second node from information about nodes that the first node is aware of. The method further includes communicating from the first node to the second node information about the first node and nodes that the first node is aware of. The method further includes adding or merging, by the second node, the information about the first node and nodes that the first node is aware of with information about nodes that the second node is aware of. The method further includes each of the plurality of cooperating nodes repeating these steps.
대표청구항▼
What is claimed is: 1. A method for discovery of cooperating nodes in a network of nodes in which each cooperating node has information about at least one other cooperating node, comprising the steps of: (a) performing, by each cooperating node, the sub-steps of: (a1) selecting, from its cooperatin
What is claimed is: 1. A method for discovery of cooperating nodes in a network of nodes in which each cooperating node has information about at least one other cooperating node, comprising the steps of: (a) performing, by each cooperating node, the sub-steps of: (a1) selecting, from its cooperating node information, only one second cooperating node; and (a2) transmitting to the second cooperating node, or receiving therefrom, at least a portion of the available cooperating node information; and (b) repeating, at an interval, steps (a), (a1), and (a2). 2. The method of claim 1, wherein the interval is consistent. 3. The method of claim 1, wherein the interval changes over time. 4. The method of claim 1, wherein sub-step (a1) comprises randomly selecting the second cooperating node. 5. The method of claim 1, wherein sub-step (a1) comprises pseudo-randomly selecting the second cooperating node. 6. The method of claim 1, wherein sub-step (a1) comprises selecting the second cooperating node from an ordered list. 7. The method of claim 1, wherein the portion of the available cooperating node information that is transmitted or received in sub-step (a2) comprises a list of cooperating nodes and resources available thereat. 8. A method for discovery of cooperating nodes in a network of nodes in which each cooperating node has information about at least one other cooperating node, comprising the steps of: (a) selecting, by a first cooperating node from its cooperating node information, only one second cooperating node; (b) receiving information at the first cooperating node transmitted from the second cooperating node, the information being at least a portion of the cooperating node information available to the second cooperating node and being transmitted following receipt, at the second cooperating node, of a request for the information issued by the first cooperating node; and (c) repeating, at an interval, steps (a) and (b). 9. The method of claim 8, wherein step (a) comprises randomly selecting the second cooperating node. 10. The method of claim 8, wherein step (a) comprises pseudo-randomly selecting the second cooperating node. 11. The method of claim 8, wherein step (a) comprises selecting the second cooperating node from an ordered list. 12. The method of claim 8, wherein the portion of the cooperating node information received in step (b) comprises a list of cooperating nodes and resources available thereat. 13. The method of claim 8, wherein the portion of the cooperating node information received in step (b) comprises all of the second cooperating node's cooperating node information. 14. The method of claim 8 further comprising repeating, at the interval, steps (a) and (b) by each of the cooperating nodes. 15. The method of claim 8 further comprising merging, by the first cooperating node, the portion of the cooperating node information received in step (b) with cooperating node information previously available to the first cooperating node. 16. The method of claim 8 further comprising transmitting, from the first cooperating node to the second cooperating node, at least a portion of the cooperating node information available to the first cooperating node. 17. The method of claim 16 further comprising merging, by the second cooperating node, the portion of the cooperating node information transmitted by the first cooperating node with cooperating node information previously available to the second cooperating node. 18. A first cooperating node for discovering information about other cooperating nodes in a system of cooperating nodes, the first cooperating node comprising: a selector for selecting, from cooperating node information available to the first cooperating node, only one second cooperating node; a transceiver for transmitting to the second cooperating node, or for receiving therefrom, at least a portion of available cooperating node information; and a timer control for triggering, at an interval, the selector and the transceiver. 19. The first cooperating node of claim 18, wherein the interval is at least one of consistent or changed over time. 20. The first cooperating node of claim 18, wherein the second cooperating node is selected in at least one of a random manner, a pseudo-random manner, or from an ordered list.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (11)
Serkowski Robert J., Automatic learning of network routing by exchanging route information.
Mandler, Benjamin; Haskin, Roger Lee; Schmuck, Frank Bernhard; Wyllie, James Christopher, Maintenance of free resource information in a distributed system.
Chevalier Denis Jean Albert,FRX ; Bazot Philippe Michel,FRX ; Maurel Olivier,FRX ; Levy-Abegnoli Eric,FRX ; Bertin Olivier,FRX ; Nicolas Laurent,FRX ; Chobert Jean-Paul,FRX, Method and system for optimizing connection set-up operations in a high speed digital network.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.