Information Technology Reference
In-Depth Information
3. The agent
A
g
0
generates (creates) the agent
A
g
1
and sends it to the environment
to other nodes in order to search for the nodes with an overflow of the resource
and is able to send it.
4. The agent
A
g
1
“travels” through the environment relocating from one node to
another in order to find the potential giver of the resource.
5. If it finds the appropriate node which is the potential giver, it starts the process of
sending the negotiated amount of the resource to its home node.
Similarly, the scenario of the activity of the agent
A
g
2
includes the following
stages:
1. The agent
A
g
0
ascertains that there is an overflow of the resource (the level of the
resource is above the upper limit) in the home node.
2. The agent
A
g
0
checks the amount of the resource in the neighbouring nodes. If
it finds there the one that has an underflow of the resource and is able to take
a certain amount of it, then the agent negotiates the amount of the resource to
be given, and afterwards a transfer takes place. However; if there is no potential
“receiver” of the resource in the neighbouring nodes, the agent starts searching
for the potential “receiver” in the nodes placed beyond the neighbouring nodes.
3. The agent
A
g
0
generates (creates) the agent (of type)
A
g
2
and sends it to the
environment to other nodes in order to search for the nodes with an underflow of
the resource.
4. The agent
A
g
2
travels through the environment moving from one node to another
in order to find the potential receiver of the resource.
5. If the agent
A
g
2
finds the appropriate node which is the potential receiver of the
resource, it starts the process of sending the negotiated amount of the resource
from the home node
A
g
0
.
As a result of the agent's activity described above, the resource is relatively
uniformly distributed in the nodes of the graph.
On the basis of these scenarios, the agents (of the types)
A
g
1
and
A
g
2
are generated
by the agent
A
g
0
in a given node, which is the beginning of their
existence
(
life
).
However, the end of
existence
(
life
) of the agent (of type
A
g
1
or
A
g
2
) takes place in
two cases:
1. The agent
A
g
1
finds the node of the
giver
(
A
g
2
of the node of the
receiver
)ofthe
resource (the negotiated amount of the resource is sent between the appropriate
nodes), a given agent (of type
A
g
1
or
A
g
2
) realizes the operation of self-destruction.
2. A given agent (of type)
A
g
1
or
A
g
2
is not able to realize its task (there is an
underflow or an overflow of the resource in the whole graph environment), it
must stop its activity, i.e. perform self-destruction. To this purpose, each agent
of type
A
g
1
and
A
g
2
is equipped with a
life energy
reserve at the moment of
creation. During each displacement between the nodes agents work off a certain
amount of life energy. If the amount of energy drops to 0 (or below the established
threshold), then the agent is eliminated.
At the moment of elimination a given agent (of type
A
g
1
or
A
g
2
) may inform the
agent of type
A
g
0
in its home node about the termination of its activity (that it is
