Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
A Method for the Solution of the Nth Best Path Problem
Journal of the ACM (JACM)
An algorithm for multicast tree generation in networks with asymmetric links
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Multicast routing with end-to-end delay and delay variation constraints
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints
Expert Systems with Applications: An International Journal
The Study on a New Immune Optimization Routing Model
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks
Computer Communications
Restoration of virtual private networks with qos guarantees in the pipe model
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to destination node; (2) minimum cost of the multicast tree; (3) dynamic multicast tree status which is maintained by updating the existing multicast tree when nodes in the network request to join or leave. Copyright © 1999 John Wiley & Sons, Ltd.