Abstract c: nt~ now, true videwon-dernaad can ody be atievsd hg a dedicated data flow for
web service request. This brute force approach is probibitivdy &\Tensive. Using mtiticast w …

Periodic broadcasting can be used to support near video on demand for popular videos. For
a given bandwidth allocation, pyramid broadcasting schemes substantially reduce the …

Efficiency is essential for video-on-demand (VOD) to be successful. Conventional VOD
servers are inefficient, they dedicate a disk stream for each client, quickly using up all …

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 …

The server's storage I/O and network I/O bandwidths are the main bottleneck of VoD service.
Multicast offers an efficient means of distributing a video program to multiple clients, thus …

Large scale video-on-demand systems require that the servers offering the video retrieval
and playback services are arranged as a distributed system in order to support a large …

In this paper, we address the problem of minimizing the cost of transferring a document or a
file requested by a set of users geographically separated on a network of nodes. We …

We study two variants of the classic knapsack problem, in which we need to place items of
different types in multiple knapsacks; each knapsack has a limited capacity, and a bound on …

Multimedia streaming applications consume a significant amount of server and network
resources due to the high bandwidth and long duration of audio and video clips. Making …

Deployment of a large-scale multimedia streaming application requires an enormous
amount of server and network resources. The simplest delivery technique allocates server …