Decentralized multi-point routing in wide area networks

A heuristic for the point-to-multipoint routing problem for a decentralized network is presented. The error percentage compares favorably with those obtained using a centralized heuristic. The results apply only to static networks. The algorithm was run on a set of ten networks. Parameter r, which is the ration of the total number of links to the total number of nodes in the network, was varied from two to three. The percentage error between the estimated solution of the heuristic and the optimal solution varied from 0 to 25%. This percentage error, however, had no relation to the number of nodes or to r