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)
Media scaling for audiovisual communication with the Heidelberg transport system
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
FLID-DL: congestion control for layered multicast
COMM '00 Proceedings of NGC 2000 on Networked group communication
Joint source/channel coding for multicast packet video
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1
| Hi-index | 0.00 |
Congestion control is critical for a multicast transport protocol to be deployed and coexist fairly with current unicast transport protocols, such as TCP. We present a new congestion control protocol for video multicast: Routing-based Video Multicast Congestion Control (RVMCC), which combats congestion from a new direction: enriching abstractions of the routing layer. RVMCC overcomes most of the disadvantages of current end-to-end multi-layer video multicast congestion control schemes, such as unstable throughput and unfair sharing of bandwidth with other sessions [9] [10]. These disadvantages are inherent for end-to-end multi-layer video multicast congestion control schemes and extremely hard for them to deal with [10]. RVMCC not only achieves good stability of throughput but also approaches Max-Min fairness closely at bottlenecks. The former is necessary for ensuring the viewing quality of transmitted video, while the latter is necessary for the deployment of multicast in the current Internet. Furthermore, unlike existing network-assisted video multicast congestion control schemes, RVMCC does not require the change of the queuing, scheduling, or forwarding structure of the current Internet. RVMCC can be integrated with minimum assistance from network by enriching the abstractions of the routing layer.