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)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
Cost-Delay Path Selection Function for Real-Time Multicast Routing
MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
On Providing Quality-of-Service Control for Core-Based Multicast Routing
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Multicast routing in computer networks
Multicast routing in computer networks
Multicast routing with end-to-end delay and delay variation constraints
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
Researchers have proposed the core-based trees (CBT) and protocol independent multicasting protocols to route multicast data on Internet works. Algorithms utilizing CBT construct a single tree for each group, regardless of the number of senders. However, the end-to-end delivery delay is larger for CBT than for a source-based tree (SBT). This paper presents a real-time optimal multicast routing based on modified CBT v2 protocol. The proposed protocol can sustain the scaling advantage of CBT without letting the delay from source to any destination exceed a real-time constraint. We present a new path selection method that takes both cost and delay into consideration. By changing the path selection function, the overall cost of the multicast tree can be reduced significantly while satisfying the real-time delay constraint of the applications. Our simulation results show significant improvement for our proposed protocol over the CBT v2. On average, our proposed protocol allows us to achieve the balance of optimizing cost and delay of the shared multicast group tree.