Information exchange by intelligent mobile agents in a network

• US 6,009,456 A
• Filed: 07/30/1997
• Issued: 12/28/1999
• Est. Priority Date: 07/30/1997
• Status: Expired due to Term

• Current Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Original Assignee: Lockheed Martin Corporation (Martin Marietta Corporation)
• Inventors: Whitebread, Kenneth Robert, Mendenhall, Henry Hindle, Frew, Russell Ernest
• Primary Examiner(s): Barry, Esq., Lance Leonard
• Application Number:
  US08/903,346
• Time in Patent Office: 881 Days
• Field of Search: 395/200.32, 395/200.77, 709/202, 709/247
• US Class Current: 709/202
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/34 involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416
• CPC Class Codes: H04L 69/04 Protocols for data compression, e.g. ROHC
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

Intelligent mobile agents in a distributed network carry information tokens among network nodes. Each token includes compressed information or data, and an indication of the compression algorithm which can decompress the information. At least some of the nodes have at least one decompression algorithm. A copy of a token may be left at a node by an intelligent mobile agent moving through the network. A later-arriving intelligent mobile agent can interrogate the node to determine what information it has in the form of tokens, and can use the token information, or take the token (or a copy) elsewhere.

Claims

1. A method for performing, by the use of plural intelligent mobile agents, processing on a distributed network of nodes, each of which includes an intermediary module, said method comprising the steps of:

selecting one compression algorithm from among the compression algorithms of a suite of compression algorithms to thereby identify a selected compression algorithm;

generating a compressed representation of a piece of information using said selected compression algorithm, to thereby generate a compressed piece of information;

generating an information token by attaching to said compressed piece of information the identity of said selected compression algorithm used in said step of generating a compressed representation;

attaching said information token to a first intelligent mobile agent;

from one of said nodes in the system, transmitting said first intelligent mobile agent, together with its attached token, to at least a second one of said nodes of said network;

from a node in said system, transmitting a second intelligent mobile agent to at least said second one of said nodes of said network, whereby said first and second intelligent mobile agents reside at said second one of said nodes of said network;

at said second node, at least copying said token from said first intelligent mobile agent to said intermediary module of said second node;

in said intermediary module of said second node, decompressing said piece of information in said token using said identity of said selected compression algorithm, to thereby produce a reconstituted piece of information;

at least copying said reconstituted piece of information to said second intelligent mobile agent.

2. A method according to claim 1, wherein said first mobile agent arrives at said second node at a time at which said second mobile agent is not at said node, said method further comprising the steps of:

at said first mobile agent, determining that said second mobile agent may eventually arrive at said second node, to thereby decide to leave a copy of said token at said second node;

at said first mobile agent, leaving a copy of said token with said intermediary module at said second node in response to said decision to leave a copy.

3. A method according to claim 2, wherein said method further comprises the steps of:

at said intermediary module of said second node, storing said token until that time at which arrival is identified of an intelligent mobile agent which can make use of said piece of information;

at said intermediary module, decompressing said piece of information in said token using said identity of said selected compression algorithm, to thereby produce at said time a reconstituted piece of information; and

at least copying said reconstituted piece of information to said second intelligent mobile agent.

4. A method according to claim 1, further comprising the preliminary steps of:

transmitting to at least said second node at least some decompression algorithms, which decompress corresponding ones of said compression algorithms of said suite of compression algorithms, including said selected compression algorithm, together with their corresponding identifications.