Information Technology Reference
In-Depth Information
F
IG
. 6. A graph, its linear sequences, and associated retrieval costs.
One method in obtaining an optimal linear sequence is to enumerate and calculate
all possible linear sequences with their associated costs and then choose the sequence
with the minimum cost. Naturally, such a solution, though simple, is computationally
impractical. Hence, in practice heuristic rules are used to generate a linear sequence
with a reasonable cost.
The average response time is a function of the broadcast length—reducing the
broadcast length could also reduce the response time. The broadcast length can be
reduced if objects are broadcast along parallel air channels. To follow our cluster-
