Optimizing patching performance Export

@article{citeulike:570516, abstract = {Patching has been shown to be cost efficient for video-on-demand systems. Unlike conventional multicast, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. Since a multicast can now grow dynamically to serve new users, this approach is more efficient than traditional multicast. In addition, since a new request can be serviced immediately without having to wait for the next multicast, true video-on-demand can be achieved. In this paper, we introduce...}, author = {Cai, Y. and Hua, K. and Vu, K.}, booktitle = {Conference on Multimedia Computing and Networking}, citeulike-article-id = {570516}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.267}, keywords = {batch-processing, patching}, month = {January}, posted-at = {2006-03-30 10:53:46}, priority = {2}, title = {Optimizing patching performance}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.267}, year = {1999} }

TY - JOUR ID - citeulike:570516 L3 - citeulike-article-id:570516 N2 - Patching has been shown to be cost efficient for video-on-demand systems. Unlike conventional multicast, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. Since a multicast can now grow dynamically to serve new users, this approach is more efficient than traditional multicast. In addition, since a new request can be serviced immediately without having to wait for the next multicast, true video-on-demand can be achieved. In this paper, we introduce... TI - Optimizing patching performance T2 - Conference on Multimedia Computing and Networking KW - batch-processing KW - patching AU - Cai, Y AU - Hua, K AU - Vu, K PY - 1999/January// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.267 ER -