The bandwidth-intensive and long-lived nature of high quality digital video makes it a challenging problem to transmit such video over the Internet. In this paper, we propose a scalable and flexible framework integrating proxy-based prefix caching with periodic broadcast of the suffix of a video from the server, for efficiently streaming a set of popular videos to a large number of asynchronous...

This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...

In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.? 

Earlier performance studies of client-server database systems have investigated algorithms for caching locks and data at client worhxtations to reafuce latency and offload the server. These studies have been restricted to algorithms in which d&abase pages that were not in the local client buffer pool or the server buffer pool were read in from disk. In this paper we investigate a technique that...

In a client-server system, the minimum bandwidth required to transmit a pre-recorded VBR media can be computed in O(n). As the frame number n is usually very large, this resource management procedure is not suitable for online computation. Although an O(nlogn) algorithm has been proposed to characterize the bandwidth-buffer tradeoff for the optimal resource management (a native algorithm takes ...

We carefully believe that server workload for interactive multimedia service exhibits different characteristics from legacy application, e.g. ftp server, web server, ASP server and etc., and that there are greater chance of improvement with better understanding of streaming workload. In this work, we present a novel buffer management algorithm for interactive multimedia streaming workload. We c...

The present paper extends the so-called Effective Process Time (EPT) approach to single server flowlines with finite buffers and blocking. The power of the EPT approach is that it quantifies variability in workstation process times without the need to identify each of the contributing disturbances, and that it directly provides an algorithm for the actual computation of EPTs. It is shown that E...

We report on an observational study of user response following the OpenSSL remote buffer overflows of July 2002 and the worm that exploited it in September 2002. Immediately after the publication of the bug and its subsequent fix we identified a set of vulnerable servers. In the weeks that followed we regularly probed each server to determine whether its administrator had applied one of the rel...