An efficient distributed dynamic multicast routing with delay and delay variation constraints

Authors:
Kun Zhang;Hong Zhang;Jian Xu
Affiliations:
Computer Department, Nanjing University of Science & Technology, Nanjing, P.R.China;Computer Department, Nanjing University of Science & Technology, Nanjing, P.R.China;Computer Department, Nanjing University of Science & Technology, Nanjing, P.R.China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 4
Cited 0

Multicast routing for real-time communication of high-speed networks

Multicast routing for real-time communication of high-speed networks
Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

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

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The delay and delay variation-bounded multicast tree (DVBMT) problem is known to be NP-complete. In this paper, we propose an efficient distributed dynamic multicast routing algorithm to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed, and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms, and performs excellently in delay variation performance under lower time complexity, which ensures it to support the requirements of real-time multimedia communications more effectively.