Table 1. Transfer decision matrix for Figure 1
(single control plane,
1=l )
C1 (P control,
positive)
C2(P control,
negative)
C3(D control,
positive)
(
1
3
C
Th ,
1
4
C
Th
and
2
3
C
Th
are
thresholds set
for 3 different
regions)
Migrate for sure
for a single
primary metric;
1
3
Cr
TP
=
is set to
infinity;
1
3
1
3
CCr
ThTP >>
=
always holds
(PID control
region)
Alarm 1
(A1): for
2
3
1
4
C
C
l
ThTP <
else migrate
(region
2
3
C ,
D+I control
only)
C4 (D control,
negative)
Alarm 2 (A2): for
1
4
1
4
C
C
l
ThTP <
, else
migrate
(region
1
4
C , P+1
control only)
Don’t care
or Inert state
(no action
region
2
4
C )
3 EXPERIMENTS
The simulation experiments to verify the SDITPM
are carried out in the Java Aglets mobile agent
environment. This platform is chosen because: a) it
is stable, b) it has rich user experience, c) it supports
agent mobility and d) it is designed for the Internet
and this makes the experimental results scalable to
the real Internet environment. The domain for the
simulated PCI is a part of the PolyU Intranet
annexed by the PI technique (Wong, 2000). Within
the PI the agents migrate freely, and the driver(s),
the agent(s), the CA entity, and the Monitor (Figure
2) are all aglets (agile applets). The driver and the
agent server interact in a client/server relationship.
From the TOW (table of waveforms in Figure 2) the
driver(s) picks a waveform or trace, which embeds
an unknown pattern, to simulate a primary metric. In
Figure 2 two primary metrics are leveraged. The
migration behavior of the agent is recorded in a real-
time fashion by the Visual visualization tool (Wong,
2000). The CA exists as an API so that an agent can
invoke it for computing any waveform means
quickly and accurately, for example, the mean
queuing time
Queuing
Mean . These mean values by
the CA, which is invoked by an agent, are the
“interior” ones in the SDITPM context.
The Monitor that gathers the PI/PCI domain
statistics also invokes its own CA to calculate
different mean values on the fly. In contrast, these
are the “exterior mean values”.
Figure 2. Setup for the SDITPM experiments
The interior and exterior mean values contribute
to the
CI
Threshold computation for evaluating the
“
TP
C
O
ThresholdTP > AND
CI
C
O
ThresholdCI << ” condition for a possible
transfer policy migration. Many experiments were
conducted with the Java SDITPM prototype
leveraging different simulated primary metrics. The
preliminary results indicate that the SDITPM is
indeed responsive for W&W applications. Figure 3
shows the changes of the three primary metrics
being leverage by SDITPM in the experiment:
context switching (CS) cycle time, queuing time
(Queuing), and agent’s service time (CPU). These
metrics represent a stack of three (
3=N ) control
planes and therefore incidental integration is
required for the
c
r
TP
computation. Figure 4 shows
the regional changes in SDIPM over time.
In this particular experiment one threshold is
assumed for all the control regions for simplicity as
shown in Figure 4. The rectangular pulse in Figure 4
is not a part of the SDITPM behaviour but explains
what happens with respect to time. At the rising
edge “a” SDITPM makes the decision to migrate
and the agent server moves to another PCI/PI node.
This decision is based on the transfer probability
1
3
C
TP of region R1 or
1
3
C
for PID control;
1
3
C
TP exceeds the given threshold. The agent
migrates at the rising edges “b”, “c”, and “d”. The
contributing factor for the subsequent migrations is
also
1
3
C
TP
. It shows inside the rectangular pulse
width how the dominance of one control region is
taken over by another. If the agent had not migrated,
it would have seen these changes. For example,
inside the pulse width between “a” and “b” rising
edges the
1
3
C
TP and
2
4
C
TP transfer probability
distributions for the R1 and R2 (
2
4
C for “D+I”
ICETE 2005 - WIRELESS COMMUNICATION SYSTEMS AND NETWORKS
162