An Efficient Algorithm for Delay Delay-Variation Bounded Least Cost Multicast Routing
Many multimedia communication applications require a source to transmit messages to multiple destinations subject to Quality of Service (QoS) delay constraint. To support delay constrained multicast communications, computer networks need to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. This is known as multicast delay problem. On the other hand, if the same message fails to arrive at each destination node at the same time, there may arise inconsistency and unfairness problem among users. This is related to multicast delay-variation problem. The problem to find a minimum cost multicast tree with delay and delay-variation constraints has been proven to be NP-Complete.