Multipoint communication by hierarchically encoded data
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Prospects for Interactive Video-on-Demand
IEEE MultiMedia
Distance Learning with Digital Video
IEEE MultiMedia
Video distribution on multicast networks
IEEE Journal on Selected Areas in Communications
Low-complexity video coding for receiver-driven layered multicast
IEEE Journal on Selected Areas in Communications
Video multicast over the Internet
IEEE Network: The Magazine of Global Internetworking
WSEAS Transactions on Computers
| Hi-index | 0.01 |
Layered video is a video-compression technique to encode video data in multiple layers. It typically consists of a base layer and some additional layers that provide enhanced video quality. The multicasting operation of layered video consists of many receivers dynamically joining and leaving different multicast sessions of different layers depending on their network condition. A layered video multicasting system needs to satisfy: (i) bounded end-to-end delay from the video source to each receiver; (ii) minimum total cost; and (iii) minimum delay jitter between the various video streams received by each receiver. The problem of computing such data distribution paths is NP-complete. This paper presents a new heuristic algorithm, called layered video multicast super-tree routing algorithm, with O(Rn2) time complexity and O(R2) message complexity, where n is the number of nodes in the network and R is the receiver group size. Our investigation shows that the multicast data paths computed by our algorithm can always satisfy the delay constraint with reasonably low total cost.