Until now, true video-on-demand can only be achieved using a dedicated data ow for each service r... more Until now, true video-on-demand can only be achieved using a dedicated data ow for each service request. This bruteforce approach is prohibitively expensive. Using multicast can signi cantly reduce the system cost. This solution, however, must delay services in order to serve many requests as a batch. In this paper, we consider a third alternative called Patching. In our technique, an existing multicast can expand dynamically to serve new clients. Allowing new clients to join an existing multicast improves the e ciency of the multicast. Furthermore, since all requests can be served immediately, the clients experience no service delay and true video-on-demand can be achieved. A signi cant contribution of this work, is making multicast work for true videoon-demand services. In fact, we are able to eliminate the service latency and improve the e ciency of multicast at the same time. To assess the bene t of this scheme, we perform simulations to compare its performance with that of standard multicast. Our simulation results indicate convincingly that Patching o ers substantially better performance.
Uploads
Papers by Z Triplezeta