Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A delay constrained distributed multicast routing algorithm
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
IDMS '97 Proceedings of the 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
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
| Hi-index | 0.00 |
Many real-time multimedia applications such as distance education, video conferencing have stringent end-to-end delay requirement and consume large amounts of network resources. In order to support these applications efficiently, multicast routing algorithms are needed for computing the least cost multicast trees that satisfy a given end-to-end delay constraint. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has better average cost performance than the other existing algorithms.