Delay-constrained localized multicast routing

Delay-constrained multicasting is a fundamental issue in distributed computing and networking. It can be formulated as that of finding a minimum-cost Steiner tree with bounded end-to-end delay along the path from the source node to each destination node and is known to be NP-complete. Several heuristics have been presented for this problem, but most of them require global information in order to construct a multicast tree. Our algorithm uses information only from neighboring nodes, which makes it more practical. The algorithm performs as well as some heuristics using global information