
244 Simulation Technologies in Networking and Communications
In the next phase of the study, effectiveness of heuristic algorithms depending on the value of the
maximum delay along the path was studied. The analysis of the graphs shown in Figures 9.9 and
9.10 leads to a conclusion that an increase in the ∆ parameter is followed by an increase in the aver-
age cost of trees generated by the studied algorithms. A decrease in the value of the ∆ parameter is
followed by addition of paths that satisfy the condition of the maximum value of delay to the tree:
(, )
,
ij p
ij ij
de
∈
∑
≤Δ
but these are not the minimum cost paths. Eventually, this leads to an i ...