Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Applying tabu search to backup path planning for multicast networks
Computers and Operations Research
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
QoS-constrained core selection for group communication
Computer Communications
A fast and efficient multicast algorithm for QoS group communications in heterogeneous network
Computer Communications
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Overlay multicast routing algorithm with delay and delay variation constraints
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Optimizing in-network aggregate queries in wireless sensor networks for energy saving
Data & Knowledge Engineering
On multicasting steiner trees for delay and delay variation constraints
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
An efficient distributed dynamic multicast routing with delay and delay variation constraints
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
An efficient multicast tree with delay and delay variation constraints
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A heuristic algorithm for core selection in multicast routing
Journal of Computer Science and Technology - Special issue on Natural Language Processing
On solving the rooted delay- and delay-variation-constrained steiner tree problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On QoS multicast routing algorithms using k-minimum Steiner trees
Information Sciences: an International Journal
| Hi-index | 0.24 |
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 communications, 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. This is related to the multicast delay variation problem[10]. Our research subject in the present paper is concerned with the minimization of multicast delay variation under the multicast end-to-end delay constraint. The problem is first defined and discussed in Ref. [10]. They have proved it to be an NP-complete problem and proposed a heuristic algorithm for it called DVMA (Delay Variation Multicast Algorithm). In this paper, we find that in spite of DVMA's smart performance in terms of multicast delay variations, its time complexity is as high as O(klmn^4). It is strongly believed that such a high time complexity does not fit in modern high-speed computer network environment. Therefore, we will present an alternative heuristic algorithm with a much lower time complexity O(mn^2) and with a satisfactory performance. Computer simulations also testify that our algorithm is both fast and efficient.