A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

摘要

More and more multicast communications are becoming real-time. In real-time communications, messages must be transmitted to their destination nodes within a certain amount of time; otherwise the messages will be rendered futile. To support real-time multicast commu- nications, computer networks have to guarantee an upper bound on the end-to-end delay from the source node to each of the destination nodes. This is known as the multicast end-to-end delay problem [10]. On the other hand, if the same message fails to arrive at each destination node at the same time, there will probably arise inconsistency or unfairness problem among users.