Broadcasting algorithm in computer networks: accumulative depth

Introduces the concept of accumulative depth of a node in a computer network. By utilising this concept as a criterion in the assignment of weights to the nodes of the network, the authors develop an efficient algorithm (NOBF) to calculate a near-optimal broadcasting figure (a broadcast with a near-minimal transmission delay) in arbitrary point-to-point computer networks. Static and dynamic assignments of weights have been considered. The authors analyse the efficiency of the algorithm based on accumulative depth as a function of the transmission delay and the algorithmic complexity.