Patent US7043522B2 successfully refreshed from Google Patents.
US7043522B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Unbounded computing space
Assignee: Microsoft Technology Licensing LLC
•
Filing: 2002-05-30
•
Granted: 2006-05-09
•
Expires: 2022-05-30
Abstract
Abstract An unbounded computing space including independent nodes is provided. Each node includes a discovery module to detect other nodes within the unbounded computing space, and an interaction module to communicate with the other detected nodes. Any node within the unbounded computing space can introduce an independent agent (e.g., an executable code assembly) into the unbounded computing space. The node in which an independent agent is introduced can subsequently send the independent agent to another node in the unbounded computing space for execution in the other node. Nodes in which an independent agent is introduced can define privileges that are associated with one or more agents and can be used to ensure the agent does not exceed a security policy as defined by the node. This allows for a distributed computing system in which an unlimited number of different agents can be introduced.
Inventors
- 👤 Lance E. Olson
- 👤 Eric K. Zinda
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 07:02
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/50; G06F9/5061; G06F9/5072; G06F2209/00; G06F2209/50; G06F2209/505
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
112 words
A distributed computing architecture, comprising: a plurality of node modules in which agent programs can run, each node module comprising: security module using code access security to execute an agent program in a sandboxed environment regardless of an identity of a source of a source of the agent program; a discovery module that detects other node modules within the distributed computing architecture; and an interaction module through which each node module communicates with other node modules, wherein each node module is capable of introducing the agent program that can be sent to one or more other node modules, via the interaction module, and run in the one or more other node modules.
Claim 2
Dependent Claim
112 words
A distributed computing architecture, comprising: a plurality of node modules in which agent programs can run, each node module comprising: security module using code access security to execute an agent program in a sandboxed environment regardless of an identity of a source of a source of the agent program; a discovery module that detects other node modules within the distributed computing architecture; and an interaction module through which each node module communicates with other node modules, wherein each node module is capable of introducing the agent program that can be sent to one or more other node modules, via the interaction module, and run in the one or more other node modules.
Claim 3
Dependent Claim
28 words
The distributed computing architecture of claim 1 , wherein a discovery module of a first node communicates with a server that maintains a database of active node modules.
Claim 4
Dependent Claim
29 words
The distributed computing architecture of claim 1 , wherein a discovery module of a first node broadcasts an undirected request over a network to detect other active node modules.
Claim 5
Dependent Claim
18 words
The distributed computing architecture of claim 1 , wherein each node module executes in a managed code environment.
Claim 6
Dependent Claim
17 words
The distributed computing architecture of claim 4 , wherein the managed code environment comprises Common Language Runtime.
Claim 7
Dependent Claim
18 words
The distributed computing architecture of claim 4 , wherein the managed code environment comprises a Java virtual machine.
Claim 8
Dependent Claim
20 words
The distributed computing architecture of claim 1 , wherein each interaction module communicates with other node modules using HTTP messages.
Claim 9
Dependent Claim
20 words
The distributed computing architecture of claim 1 , wherein each interaction module communicates with other node modules using TCP messages.
Claim 10
Dependent Claim
24 words
The distributed computing architecture of claim 1 , wherein each node module defines virtual terrain, and each agent program defines a virtual terrain inhabitant.
Claim 11
Dependent Claim
22 words
The distributed computing architecture of claim 1 , wherein the agent program coordinates a distributed task across the plurality of code modules.
Claim 12
Independent Claim
122 words
A method for executing a program on a computer system, comprising: (a) introducing an agent program into a first node of a plurality of nodes, wherein each node provides a secure environment in which the agent program can run; (b) detecting a second node of the plurality of nodes; (c) sending the agent program to the second node, wherein the first node retains no expectation of a return of the agent program to the first node; and (d) executing the agent program in the secure environment of the second node, wherein each secure environment comprises a security module using code access security to execute the agent program in a sandboxed environment regardless of an identity of a source of the agent program.
Claim 13
Independent Claim
122 words
A method for executing a program on a computer system, comprising: (a) introducing an agent program into a first node of a plurality of nodes, wherein each node provides a secure environment in which the agent program can run; (b) detecting a second node of the plurality of nodes; (c) sending the agent program to the second node, wherein the first node retains no expectation of a return of the agent program to the first node; and (d) executing the agent program in the secure environment of the second node, wherein each secure environment comprises a security module using code access security to execute the agent program in a sandboxed environment regardless of an identity of a source of the agent program.
Claim 14
Dependent Claim
30 words
The method of claim 11 , wherein step (b) comprises: (i) sending to a server a node list request; and (ii) receiving from the server a list of active nodes.
Claim 15
Dependent Claim
17 words
The method of claim 11 , wherein step (b) comprises broadcasting an undirected request over a network.
Claim 16
Dependent Claim
18 words
The method of claim 11 , wherein step (c) comprises sending an HTTP message to the second node.
Claim 17
Dependent Claim
16 words
The method of claim 14 , wherein in step (c) the HTTP message comprises POST data.
Claim 18
Dependent Claim
18 words
The method of claim 11 , wherein step (c) comprises sending an XML message to the second node.
Claim 19
Dependent Claim
19 words
The method of claim 11 , wherein step (d) comprises performing a diagnostic service on a local computer system.
Claim 20
Dependent Claim
40 words
The method of claim 17 , wherein step (d) comprises: (i) detecting an amount of available space in a storage device; (ii) when the detected amount of available space is below a predetermined level, deleting unnecessary files meeting predefined criteria.
Claim 21
Dependent Claim
42 words
The method of claim 17 , wherein step (d) comprises: (i) detecting a level of file fragmentation in a storage device; (ii) when the detected level of file fragmentation is above a predetermined level, initiating a defragmentation procedure on the storage device.
Claim 22
Dependent Claim
36 words
The method of claim 11 , wherein further comprising the step of executing the agent program in the first node, wherein the agent program coordinates a distributed task across at least the first and second nodes.
Claim 23
Dependent Claim
198 words
In a computing architecture comprising a plurality of nodes that are capable of executing agent programs, and wherein each node comprises a security module using code access security to execute agent programs in a sandbox environment, a detection module that detects other nodes in the computing architecture, and an interaction module that communicates with other nodes in the computing architecture, a method for distributing agent programs, comprising: (a) introducing a first agent program by a first node of the plurality of nodes; (b) according to a predetermined algorithm, determining a second node to which the first agent program should be sent; (c) sending the first agent program to the second node, without retaining an expectation of a return of the first agent program to the first node of the plurality of nodes; (d) introducing a second agent program by a third node of the plurality of nodes; (e) according to the predetermined algorithm, determining a fourth node to which the second agent program should be sent; and (f) sending the second agent program to the fourth node, without retaining an expectation of a return of the second agent program to the third node of the plurality of nodes.
Claim 24
Dependent Claim
198 words
In a computing architecture comprising a plurality of nodes that are capable of executing agent programs, and wherein each node comprises a security module using code access security to execute agent programs in a sandbox environment, a detection module that detects other nodes in the computing architecture, and an interaction module that communicates with other nodes in the computing architecture, a method for distributing agent programs, comprising: (a) introducing a first agent program by a first node of the plurality of nodes; (b) according to a predetermined algorithm, determining a second node to which the first agent program should be sent; (c) sending the first agent program to the second node, without retaining an expectation of a return of the first agent program to the first node of the plurality of nodes; (d) introducing a second agent program by a third node of the plurality of nodes; (e) according to the predetermined algorithm, determining a fourth node to which the second agent program should be sent; and (f) sending the second agent program to the fourth node, without retaining an expectation of a return of the second agent program to the third node of the plurality of nodes.
Claim 25
Dependent Claim
25 words
The method of claim 21 , wherein the predetermined algorithm comprises selecting a fourth node to which the agent program has not yet been sent.
Claim 26
Dependent Claim
16 words
The method of claim 21 , wherein the predetermined algorithms comprises randomly selecting a fourth node.
Claim 27
Dependent Claim
73 words
A computer architecture comprising a first plurality of computing nodes, wherein any node within the first plurality of computing nodes is capable of introducing a program agent and sending the program agent to any other node within the first plurality of computing nodes, where the program agent subsequently runs in a sandboxed environment using code access security, wherein the sending node does not retain an expectation of a return of the program agent.
Claim 28
Dependent Claim
73 words
A computer architecture comprising a first plurality of computing nodes, wherein any node within the first plurality of computing nodes is capable of introducing a program agent and sending the program agent to any other node within the first plurality of computing nodes, where the program agent subsequently runs in a sandboxed environment using code access security, wherein the sending node does not retain an expectation of a return of the program agent.
Claim 29
Dependent Claim
18 words
The computer architecture of claim 24 , wherein the computer architecture consists of the first plurality of nodes.
Claim 30
Dependent Claim
57 words
The computer architecture of claim 24 , further comprising a second plurality of computing nodes, wherein any node within the second plurality of computing nodes is capable of introducing a second program agent and sending the second program agent to any other node within the second plurality of computing nodes, where the second program agent subsequently runs.
Claim 31
Independent Claim
109 words
A method for performing a task across a distributed computer system, comprising: (a) introducing an agent program into a first node of a plurality of nodes, wherein each of the plurality of nodes provides a secure sandboxed environment in which the agent program can run and is capable of receiving the agent program; (b) dividing a task defined by the agent program into a plurality of sub-tasks; (c) creating a plurality of derivative agent programs, wherein each derivative agent program is based on one sub-task of the plurality of sub-tasks; and (d) sending each of the plurality of derivative agent programs to different nodes of the plurality of nodes.
Claim 32
Independent Claim
109 words
A method for performing a task across a distributed computer system, comprising: (a) introducing an agent program into a first node of a plurality of nodes, wherein each of the plurality of nodes provides a secure sandboxed environment in which the agent program can run and is capable of receiving the agent program; (b) dividing a task defined by the agent program into a plurality of sub-tasks; (c) creating a plurality of derivative agent programs, wherein each derivative agent program is based on one sub-task of the plurality of sub-tasks; and (d) sending each of the plurality of derivative agent programs to different nodes of the plurality of nodes.
Claim 33
Dependent Claim
18 words
The method of claim 27 , wherein a selection of the different nodes is based on predetermined criteria.
Claim 34
Dependent Claim
19 words
The method of claim 28 , wherein the predetermined criteria comprises a processor utilization level below a predetermined threshold.
Claim 35
Dependent Claim
14 words
The method of claim 28 , wherein the predetermined criteria comprises a predetermined resource.
References Cited (Backward Citations)
US5136708A
Cited
US6016393A
Cited
US5812771A
Cited
US5832514A
Cited
US6134580A
Cited
US6233601B1
Cited
US6065039A
Cited
US6192354B1
Cited
US6055562A
Cited
US6115736A
Cited
US6282563B1
Cited
US6065040A
Cited
US6282582B1
Cited
US6009456A
Cited
US6163855A
Cited
US6334146B1
Cited
US6330588B1
Cited
US6782398B1
Cited
US20040205772A1
Cited
US20030182460A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2009-05-08 | 2009-11-07 | 2010-05-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2013-05-08 | 2013-11-07 | 2014-05-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2017-05-08 | 2017-11-07 | 2018-05-09 | $7700.00 | Window Closed / Lapsed |