Information Technology Reference
In-Depth Information
Figure 8.16
Algorithm to obtain least transfer paths between two operations.
are in the same workflow, that is,
t
iq
1
¼
t
q
1
q
2
¼
t
q
k
2
q
k
1
¼
t
q
k
1
j
¼
1
Such a path (or paths) can be found by using the recursive algorithm
shown in Figure 8.16.
Line 1
:Given
T
and
<
o
i
;
o
j
>
, find a service chain between
o
i
and
o
j
with the least transfer.
Line 2
: Initiate the resulting path set to null.
Lines 4-6
:
t
ij
¼
0 means
i
cannot reach
j
by any transfer.
Lines 9-11
:
t
ij
¼
1 means
i
can reach
j
without any transfer; find the
workflow in which
i
can reach
j
, and obtain the service chain in it.
Lines 13-21
:
t
ij
2 means
i
can reach
j
with at least one transfer;
find an immediate node
k
that
i
can reach, and connect it with a least
transfer path from
k
to
j
.
Line 24
: Return the resulting path list.
