Tree Spanners for Subgraphs and Related Tree Covering Problems
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Reducing Multicast Inter-receiver Delay Jitter - A Server Based Approach
ICN '01 Proceedings of the First International Conference on Networking-Part 1
An efficient QoS routing algorithm for quorumcast communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS-based MPLS multicast tree selection algorithms
Proceedings of the 7th International Conference on Frontiers of Information Technology
On solving the rooted delay- and delay-variation-constrained steiner tree problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
We consider a constrained Steiner tree problem in which it is necessary to provide bounded delays between the source and all destinations, as well as bounded variation among these delays. The delay and delay variation bounds are directly related to the quality of service requirements of real-time interactive applications that will use the tree for multicast communication. The main contribution of our work is a new strategy for constructing constrained multicast trees. We present a heuristic that exhibits good average case behavior for the maximum delay variation among the destinations while keeping the overall cost of the multicast tree low. Our heuristic compares favorably with existing multicast algorithms in terms of tree cosst, system running time, and the satisfaction of the delay and delay variation constraints.