Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
On multicast communications with minimum resources
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Multicast ω-trees based on statistical analysis
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
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
| Hi-index | 0.00 |
We have developed and evaluated a novel heuristic algorithm for the construction of a multicast tree with minimizing tree costs. Our algorithm works on directed asymmetric networks and is shown here to have a perform gain in terms of tree costs for Internet like networks over existing algorithms. The time complexity of our algorithm is O(D脳m) for a m-arc network with D number of members in the multicast group and is comparable to well-known algorithms for multicast tree construction. We have performed empirical evaluation that compares our algorithms with the others on large networks.