AQoSM: scalable QoS multicast provisioning in Diff-Serv networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
Multi-stream synchronization for 3D tele-immersive and collaborative environment
Proceedings of the 2nd International Conference on Immersive Telecommunications
AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On algorithm for estimation of selecting core
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Multicast tree construction with qos guaranties
MMNS'05 Proceedings of the 8th international conference on Management of Multimedia Networks and Services
On algorithm for the delay- and delay variation-bounded multicast trees based on estimation
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
| Hi-index | 0.00 |
More and more multicast communications are becoming real-time. In real-time communications, massages 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. 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. Our research subject in the presented in this paper is concerned with the minimization of multicast delay variation under the multicast end-to-end delay constraint. The problem has been proved to be NP-complete and a heuristic algorithm for it called DVMA (Delay Variation Multicast Algorithm) has been proposed. 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 (klmn4). 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 (mn2) and with a satisfactory performance. Computer simulations also testify that our algorithm is both fast and efficient.