Automatic clustering for self-organizing grids
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
H04L-029/08
H04L-012/911
H04L-012/24
H04L-012/26
H04L-012/733
H04L-012/721
H04L-012/727
G06Q-010/06
출원번호
US-0770798
(2013-02-19)
등록번호
US-9602573
(2017-03-21)
발명자
/ 주소
Abu-Ghazaleh, Nael
Yang, Weishuai
Lewis, Michael
출원인 / 주소
NATIONAL SCIENCE FOUNDATION
대리인 / 주소
Brundidge & Stanger, P.C.
인용정보
피인용 횟수 :
0인용 특허 :
174
초록▼
A cluster of nodes, comprising: a plurality of nodes, each having a security policy, and being associated task processing resources; a registration agent configured to register a node and issue a node certificate to the respective node; a communication network configured to communicate certificates
A cluster of nodes, comprising: a plurality of nodes, each having a security policy, and being associated task processing resources; a registration agent configured to register a node and issue a node certificate to the respective node; a communication network configured to communicate certificates to authorize access to computing resources, in accordance with the respective security policy; and a processor configured to automatically dynamically partition the plurality of nodes into subnets, based on at least a distance function of at least one node characteristic, each subnet designating a communication node for communicating control information and task data with other communication nodes, and to communicate control information between each node within the subnet and the communication node of the other subnets.
대표청구항▼
1. A method for clustering node devices for accomplishing a task, comprising: automatically dynamically repartitioning a set of node devices within a communication network into a plurality of subnets as node devices join and leave the set, using a partitioning algorithm based at least a distance fun
1. A method for clustering node devices for accomplishing a task, comprising: automatically dynamically repartitioning a set of node devices within a communication network into a plurality of subnets as node devices join and leave the set, using a partitioning algorithm based at least a distance function of at least one node device characteristic, each subnet having a communication node device within for communicating at least control information and task data with respective communication node devices of other respective subnets, the communication node device within the each subnet being selected from among node devices within the same subnet to control each node device within the subnet,communicating control information from the each node device within the subnet to the communication node device of the subnet in which it is partitioned, anddesignating a set of preferred node devices for allocation of portions of a task, wherein the designated set is dependent on both the partitioning and the task. 2. The method according to claim 1, wherein the node devices are partitioned based on a link delay metric. 3. The method according to claim 1, wherein the at least one node device characteristic comprises a pairwise communication latency between respective node devices. 4. The method according to claim 1, wherein the automatically dynamically repartitioning is initiated prior to allocating portions of a task, and wherein partitions defined by the repartitioning are dynamically controlled in dependence on current conditions determined by at least proactive communications. 5. The method according to claim 4, wherein the proactive communications comprise a heartbeat signal. 6. The method according to claim 5, wherein the heartbeat signal is provided as part of a communication between respective node devices provided for at least one other purpose. 7. The method according to claim 1, wherein the repartitioning occurs while a task is in progress. 8. The method according to claim 1, wherein communication node devices are selected dynamically. 9. The method according to claim 1, wherein the set of node devices or organized hierarchically, in a hierarchy having at least three levels. 10. The method according to claim 9, further comprising estimating a network state representing the set of node devices based on communications with fewer than all available node devices in the set of node devices. 11. The method according to claim 1, further comprising placing a new node device within a subnet, or deleting an existing node device from the subnet, while a task is being accomplished, and reallocating a portion of the task in response to the placement of the new node device. 12. The method according to claim 1, further comprising splitting a subnet while a task is being accomplished, into a plurality of subsets, each subnet having a node device selected to be a communication node device, and reallocating a portion of the task in response to the splitting of the subnet. 13. The method according to claim 1, further comprising moving a node device from a first subnet to a second subnet while the node device is accomplishing a portion of the task, without interrupting the accomplishing the portion of the task. 14. The method according to claim 1, further comprising: providing security policies for each respective node device;registering node devices with at least one registration agent and upon successful registration with the registration agent, issuing a node device certificate to the respective node devices; andcommunicating certificates from respective node devices for authorizing access to computing resources associated with other node devices, in accordance with the respective security policies. 15. A method for clustering node devices for accomplishing a task, comprising: providing a network comprising node devices configured for communications, the node devices having associated computing resources for processing tasks, the node device having respective security policies;registering node devices with at least one registration agent and upon successful registration with the registration agent, issuing a node device certificate to the respective node devices;communicating certificates from respective node devices for authorizing access to computing resources of other node devices, in accordance with the respective security policies;automatically dynamically partitioning a set of node devices within the network into a plurality of subnets, based on at least a distance function of at least one node device characteristic, each respective subnet having a communication node device within for communicating at least control information and task data with respective communication node devices of other respective subnets of the network, the communication node device within the each subnet being selected from among node devices within the same subnet to control each node device within the subnet; andcommunicating control information between the each node device within the subnet and the communication node device of the respective subnet. 16. The method according to claim 15, further comprising designating a set of preferred node devices for allocation of portions of a task, wherein the designated set is dependent on both the partitioning and the task. 17. The method according to claim 15, wherein the at least one node device characteristic comprises a pairwise communication latency between respective node devices. 18. The method according to claim 15, wherein the automatically dynamically partitioning is dynamically controlled in dependence on current conditions determined by at least proactive communications within the network. 19. A cluster of node devices for accomplishing a task, comprising: a plurality of node devices configured for communications, each having a respective security policy, the plurality of node devices having associated computing resources for processing tasks;at least one registration agent configured to register a node device and upon successful registration issue a node device certificate to the respective node device;a communication network configured to communicate certificates from a first node device to a second node device, to authorize access to computing resources of the second node device in accordance with the respective security policy of the second node device; andat least one processor configured to automatically dynamically partition the plurality of node devices within the network into a plurality of subnets, based on at least a distance function of at least one node device characteristic, each respective subnet designating a communication node device within for communicating at least control information and task data with respective communication node devices of other respective subnets of the network, the communication node device within the each subnet being selected from among node devices within the same subnet to control each node device within the subnet, and to communicate control information between each node device within the subnet and the communication node device of other respective subnets. 20. The cluster of node devices according to claim 19, wherein at least one processor is further configured to designate a set of preferred node devices for allocation of portions of the task, wherein the designated set is dependent on both the partitioning and the task.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (174)
Steven M. Hoffberg ; Linda I. Hoffberg-Borghesani, Adaptive pattern recognition based control system and method.
Traversat, Bernard A.; Gong, Li; Pabla, Kuldipsingh; Yeager, William J.; Abdelaziz, Mohamed M.; Duigou, Michael J.; Pouyoul, Eric; Hugly, Jean Christophe; Joy, William N.; Clary, Michael J., Advertisements for peer-to-peer computing resources.
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Apparatus for compact internetworked wireless integrated network sensors (WINS).
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Apparatus for internetworked hybrid wireless integrated network sensors (WINS).
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Apparatus for internetworked wireless integrated network sensors (WINS).
Fellenstein, Craig William; Hamilton, II, Rick Allen; Joseph, Joshy; Seaman, James W, Automating responses by grid providers to bid requests indicating criteria for a grid job.
Schoening Charles B. ; Smith ; Jr. Richard J. ; Schleimer Stephen I., Component extensible parallel execution of multiple threads assembled from program components specified with partial inter-component sequence information.
Kan,Gene H.; Faybishenko,Yaroslav; Cutting,Douglass R.; Camarda,Thomas J.; Doolin,David M.; Waterhouse,Steve, Distributed information discovery through searching selected registered information providers.
Quon,Colin Shong Chin; LaPorte,Jeff A.; Lieu,John Thach Vinh; Song,Miryung Jessica; Parmar,Taranjit Singh, Distributed system for sharing of communication service resources between devices and users.
Chan, Gary Shueng Han; Lei, Vanessa Meng I; Fan, Patrick Chun Sing; Kwok, Marvin Yuk Kit; Lau, Reeve Kit Wah; Lee, Ivan Ka Wai, Efficient person search mechanism in peer-to-peer networks.
Fellenstein, Craig William; Hamilton, II, Rick Allen; Joseph, Joshy; Seaman, James W, Estimating future grid job costs by classifying grid jobs and storing results of processing grid job microcosms.
Nemirovsky Paul (3 Bouldercrest Ct. Rockville MD 20850) Ball Michael (1012 S. Mansion Dr. Silver Spring MD 20770) Dahl Roy (8152 Mandan Ter. Greenbelt MD 20770), Method and apparatus for aggregating terminals into clusters to assist in the construction of a distributed data communi.
Johnson,Kirk; O'Toole,James; Kaashoek,M. Frans; Jannotti,John, Method and apparatus for determining a network topology in the presence of network address translation.
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Method and apparatus for distributed signal processing among internetworked wireless integrated network sensors (WINS).
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Method and apparatus for internetworked wireless integrated network sensor (WINS) nodes.
Popescu, George V.; Liu, Zhen; Sahu, Sambit, Method and apparatus to support application and network awareness of collaborative applications using multi-attribute clustering.
Lowery, Keith A.; Chin, Bryan S.; Consolver, David A.; DeMasters, Gregg A., Method and system for dynamic distributed data caching when a source of data is not available.
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Method for collecting data using compact internetworked wireless integrated network sensors (WINS).
Gelvin, David C.; Girod, Lewis D.; Kaiser, William J.; Merrill, William M.; Newberg, Fredric; Pottie, Gregory J.; Sipos, Anton I.; Vardhan, Sandeep, Method for internetworked hybrid wireless integrated network sensors (WINS).
Fox, Kevin L.; Frieder, Ophir; Knepper, Margaret M.; Killam, Robert A.; Nemethy, Joseph M.; Cusick, Gregory J.; Snowberg, Eric J., Multiple engine information retrieval and visualization system.
Fox, Kevin L.; Frieder, Ophir; Knepper, Margaret M.; Killam, Robert A.; Nemethy, Joseph M.; Cusick, Gregory J.; Snowberg, Eric J., Multiple engine information retrieval and visualization system.
Traversat, Bernard A.; Abdelaziz, Mohamed M.; Duigou, Michael J.; Pouyoul, Eric; Hugly, Jean-Christophe; Gong, Li; Yeager, William J.; Joy, William N.; Clary, Michael J., Peer-to-peer communication pipes.
Traversat, Bernard A.; Slaughter, Gregory L.; Saulpaugh, Thomas E.; Abdelaziz, Mohamed M.; Duigou, Michael J.; Pouyoul, Eric; Hugly, Jean-Christophe; Gong, Li; Yeager, William J.; Joy, William N.; Clary, Michael J., Peer-to-peer network computing platform.
Traversat, Bernard A.; Abdelaziz, Mohamed M.; Duigou, Michael J.; Pouyoul, Eric; Hugly, Jean Christophe; Gong, Li; Yeager, William J.; Joy, William N.; Clary, Michael J., Relay peers for extending peer availability in a peer-to-peer networking environment.
Traversat, Bernard A.; Abdelaziz, Mohamed M.; Duigou, Michael J.; Pouyoul, Eric; Hugly, Jean-Christophe; Gong, Li; Yeager, William J.; Joy, William N.; Clary, Michael J., Reliable peer-to-peer connections.
Harvey, Nicholas J.; Jones, Michael B.; Saroiu, Stefan; Theimer, Marvin M.; Wolman, Alastair; Adya, Atul, System and method for creating improved overlay network with an efficient distributed data structure.
Hugly,Jean Christophe; Abdelaziz,Mohamed M.; Pouyoul,Eric; Traversat,Bernard A.; Duigou,Michael J., System and method for describing and identifying abstract software modules in peer-to-peer network environments.
Pouyoul,Eric; Abdelaziz,Mohamed M.; Hugly,Jean Christophe; Duigou,Michael J.; Traversat,Bernard A., System and method for dynamic, transparent migration of services.
Hugly, Jean Christophe; Abdelaziz, Mohamed M.; Pouyoul, Eric; Traversat, Bernard A.; Duigou, Michael J., System and method for multiplatform implementation of abstract software modules in peer-to-peer network environments.
Faybishenko,Yaroslav; Kan,Gene H.; Camarda,Thomas J.; Doolin,David M.; Waterhouse,Steve; Beatty,John, System and method for multiple data sources to plug into a standardized interface for distributed deep search.
Sorvari, Antti; Kähäri, Markus; Toivonen, Hannu; Mannila, Heikki; Salmenkaita, Jukka Pekka, System and method for providing context sensitive recommendations to digital services.
Hugly,Jean Christophe; Abdelaziz,Mohamed M.; Pouyoul,Eric; Traversat,Bernard A.; Duigou,Michael J., System and method for providing multiple embodiments of abstract software modules in peer-to-peer network environments.
Faybishenko, Yaroslav; Kan, Gene H.; Camarda, Thomas J.; Botros, Sherif; Beatty, John; Cutting, Douglass R., System and method for resolving distributed network search queries to information providers.
Verbeke,Jerome M.; Nadgir,Neelakanth M.; Ruetsch,Gregory R.; Sharapov,Ilya A.; Vernik,Michael J.; Trang,Vu, System and method for submitting and performing computational tasks in a distributed heterogeneous networked environment.
Nadgir, Neelakanth M.; Verbeke, Jerome M.; Sharapov, Ilya A.; Ruetsch, Gregory R.; Trang, Vu; Vernik, Michael J., System and method for unique naming of resources in networked environments.
Abdelaziz,Mohamed M.; Pouyoul,Eric; Hugly,Jean Christophe; Traversat,Bernard A.; Duigou,Michael J., System and method of using a pipe advertisement for a peer-to-peer network entity in peer-to-peer presence detection.
Deng, Yuefan; Engel, Stephen J.; Giustozzi, Joseph; O'Brien, Thomas, System for balance distribution of requests across multiple servers using dynamic metrics.
Traversat,Bernard A.; Gong,Li; Yeager,William J.; Abdelaziz,Mohamed M.; Duigou,Michael J.; Pouyoul,Eric; Hugly,Jean Christophe; Joy,William N.; Clary,Michael J., System using peer discovery and peer membership protocols for accessing peer-to-peer platform resources on a network.
Kapoor, Harsh; Akerman, Moisey; Justus, Stephen D.; Ferguson, JC; Korsunsky, Yevgeny; Gallo, Paul S.; Lee, Charles Ching; Martin, Timothy M.; Fu, Chunsheng; Xu, Weidong, Systems and methods for processing data flows.
Cabrera, Luis F.; Christensen, Erik B.; Della-Libera, Giovanni M.; Kaler, Christopher G.; Levin, David E.; Lovering, Bradford H.; Lucco, Steven E.; Millet, Stephen J.; Shewchuk, John P.; Wahbe, Robert S.; Wortendyke, David A., Virtual network with adaptive dispatcher.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.