A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
International Journal of Network Management
ICON '99 Proceedings of the 7th IEEE International Conference on Networks
Research: Source-based delay-bounded multicasting in multimedia networks
Computer Communications
| Hi-index | 0.00 |
The integrated network (mixed with fixed network, cellular wireless network and ad hoc network etc.) would have different dynamic properties to the single-technique-based network, such as the movement of nodes and the change of delay of links. In this paper, we propose a new dynamic multicast routing model with a mechanism called local rearrangement to handle the changes in integrated network. Furthermore, D-IOA, an immune algorithm based on clone process, which employs gene library to improve the effectiveness of D-IOA to meet the real-time requirement in online multicast routing fields, is given to optimize the multicast sub-tree within the range of local rearrangement. The simulation results indicate that our algorithm balances three metrics better compared with other two famous dynamic multicast routing algorithms.