Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
A Framework for Provisioning of Temporal QoS in Core-Based Multicast Routing
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
| Hi-index | 0.00 |
In this paper, we propose a new algorithm for dynamic multicasting based on a new figure of merit called a relative delay constrained tree. The scheme provides a controlled tradeoff between the overall tree cost and the end-to-end delay in constructing a tree without rerouting as the group membership changes through joining and leaving. The computational complexity is kept low by applying the algorithm only within local regions at a slight sacrifice of the global optimization. Simulation results confirm the effectiveness and versatility of the algorithm in the construction of multicast trees with varying emphasis on the overall tree cost versus the end-to-end delay.