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)
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
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Efficient collective communication in distributed heterogeneous systems
Journal of Parallel and Distributed Computing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints
Expert Systems with Applications: An International Journal
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Modeling and algorithm for topology construction with delay and traffic constraints
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem
Computer Communications
Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks
Computer Communications
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
The Journal of Supercomputing
On the complexity of energy efficient pairwise calibration in embedded sensors
Applied Soft Computing
Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
| Hi-index | 0.00 |
We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then, we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim's algorithm for the unconstrained minimum spanning tree problem. Simulation results under realistic networking conditions show that our heuristic's performance is close to optimal. Delay-constrained minimum Steiner tree heuristics can be used to solve the DCMST problem. Simulation results indicate that the fastest delay-constrained minimum Steiner tree heuristic, DMCT, is not as efficient as the heuristic we propose, while the most efficient delay-constrained minimum Steiner tree heuristic, BSMA, is much slower than our proposed heuristic and does not construct delay-constrained broadcast trees of lower cost.