IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0869453
(2010-08-26)
|
등록번호 |
US-8537717
(2013-09-17)
|
발명자
/ 주소 |
- Harchol-Balter, Mor
- Leighton, F. Thomson
- Lewin, Daniel
|
출원인 / 주소 |
- Massachusetts Institute of Technology
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
0 인용 특허 :
20 |
초록
▼
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 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.
대표청구항
▼
1. A method for discovery of cooperating nodes in a network of nodes in which the cooperating nodes cooperate to perform content caching and in which each cooperating node has information about at least one other cooperating node, comprising the steps of: (a) selecting by a first node, from cooperat
1. A method for discovery of cooperating nodes in a network of nodes in which the cooperating nodes cooperate to perform content caching and in which each cooperating node has information about at least one other cooperating node, comprising the steps of: (a) selecting by a first node, from cooperating node information available to the first node, a second node;(b) transmitting from the first node to the second node at least a portion of the cooperating node information available to the first node, the transmitted cooperating node information comprising a description of content cached by the first node; and(c) periodically repeating steps (a) and (b). 2. The method of claim 1 wherein step (a) comprises randomly choosing by a first node, from cooperating node information available to the first node, a second node. 3. The method of claim 1 wherein step (a) comprises pseudo-randomly choosing by a first node, from cooperating node information available to the first node, a second node. 4. The method of claim 1 wherein step (a) comprises choosing from an ordered list, by a first node, from cooperating node information available to the first node, a second node. 5. The method of claim 1 wherein step (a) comprises choosing by a first node, from cooperating node information stored in the first node, one second node. 6. The method of claim 1 wherein step (b) further comprises transmitting from the first node to the second node at least a portion of the cooperating node information available to the first node, said cooperating node information comprising a list of cooperating nodes and resources available at each cooperating node. 7. The method of claim 1 wherein step (b) comprises transmitting from the first node to the second node at least a portion of the cooperating node information available to the first node, said at least a portion of the cooperating node information comprising all of the first node's cooperating node information. 8. The method of claim 1 wherein step (c) comprises periodically repeating steps (a) and (b) by each of the cooperating nodes. 9. The method of claim 1 wherein: step (a) comprises selecting, by a first node, from cooperating node information available to the first node, a second cooperating node and a third cooperating node; andstep (b) comprises transmitting from the first node to the second node and the third node the cooperating information available to the first node. 10. The method of claim 1 wherein: step (a) comprises selecting, by a first node, from cooperating node information available to the first node, three cooperating nodes; andstep (b) comprises transmitting from the first node to the three cooperating nodes the cooperating information available to the first node. 11. The method of claim 1 further comprising, after step (b) and prior to step (c), the step of: (b1) merging, by the second node, the cooperating node information transmitted by the first node with cooperating node information available to the second node;and wherein step (c) comprises periodically repeating steps (a), (b), and (b1). 12. The method of claim 1 further comprising, after step (b) and prior to step (c), the steps of: (b1) requesting, by the first node, from the second node, at least a portion of the cooperating node information available to the second node;(b2) receiving, by the first node, from the second node, at least a portion of the cooperating node information available to the second node;and wherein step (c) comprises periodically repeating steps (a), (b), (b1), and (b2). 13. The method of claim 1 further comprising, after step (b) and prior to step (c), the steps of: (b1) merging, by the second node, the cooperating node information transmitted by the first node with cooperating node information available to the second node;(b2) requesting, by the first node, from the selected cooperating node, at least a portion of the cooperating node information available to the second node;(b3) receiving, by the first node, from the selected cooperating node, at least a portion of the cooperating node information available to the second node;(b4) merging, by the first node, the cooperating node information transmitted by the second node with cooperating node information available to the first node;and wherein step (c) comprises periodically repeating steps (a), (b), (b1), (b2), (b3), and (b4). 14. A first node in a system of cooperating nodes in which the cooperating nodes cooperate to perform content caching and in which each cooperating node can discover information about the other cooperating nodes, said first node comprising: a selector for selecting, from cooperating node information available to the first node, a second node;a transmitter for transmitting from the first node to the second node at least a portion of the cooperating node information available to the first node, the transmitted cooperating node information comprising a description of content cached by the first node; anda timer control for periodically triggering the selector and the transmitter. 15. A method for discovery of cooperating nodes in a network of nodes in which the cooperating nodes cooperate to perform content caching and in which each cooperating node has information about at least one other cooperating node, comprising the steps of: (a) selecting, by a first node from cooperating node information available to the first node, a second node;(b) requesting, by the first node from the second node, at least a portion of the cooperating node information available to the second node;(c) receiving, by the first node from the second node, at least a portion of the cooperating node information available to the second node, the received cooperating node information comprising a description of content cached by the second node; and(d) periodically repeating steps (a), (b), and (c).
※ AI-Helper는 부적절한 답변을 할 수 있습니다.