Near-optimal broadcasting figures in computer networks

The authors develop an efficient algorithm (NOBF) to calculate a near-optimal broadcasting figure (a broadcast with a near-optimal transmission delay) in arbitrary point-to-point computer networks. This algorithm is based on the following heuristic: choose in each broadcast cycle those nodes that, on the one hand, are minimally linked to the nodes already informed and, on the other hand, maximize a certain function of weight. Static and dynamic assignments of weights have been considered. The efficiency of the algorithm is analyzed as a function of the transmission delay and the algorithmic complexity. Of all the functions of weight considered, the function based on the concept of accumulative depth stands out for its efficiency.<>