2 research outputs found

    Multicast Transmission Prefix and Popularity Aware Interval Caching Based Admission Control Policy

    Full text link
    Admission control is a key component in multimedia servers, which will allow the resources to be used by the client only when they are available. A problem faced by numerous content serving machines is overload, when there are too many clients who need to be served, the server tends to slow down. An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. By caching and streaming only the data in the interval between two successive requests on the same object, the following request can be serviced directly from the buffer cache without disk operations and within the deadline of the request. An admission control strategy based on Popularity-aware interval caching for Prefix [3] scheme extends the interval caching by considering different popularity of multimedia objects. The method of Prefix caching with multicast transmission of popular objects utilizes the hard disk and network bandwidth efficiently and increases the number of requests being served.Comment: 17 pages

    A Strategy to enable Prefix of Multicast VoD through dynamic buffer allocation

    Full text link
    In this paper we have proposed a dynamic buffer allocation algorithm for the prefix, based on the popularity of the videos. More cache blocks are allocated for most popular videos and a few cache blocks are allocated for less popular videos. Buffer utilization is also maximized irrespective of the load on the Video-on-Demand system. Overload can lead the server getting slowed down. By storing the first few seconds of popular video clips, a multimedia local server can shield the users from the delay, throughput, and loss properties of the path between the local server and the central server. The key idea of controlled multicast is used to allow clients to share a segment of a video stream even when the requests arrive at different times. This dynamic buffer allocation algorithm is simulated and its performance is evaluated based on the buffer utilization by multimedia servers and average buffer allocation for the most popular videos. Our simulation results shows efficient utilization of network bandwidth and reduced hard disk utilization hence resulting in increase in the number of requests being served.Comment: International Journal of Computer Science Issues, IJCSI, Vol. 7, Issue 1, No. 2, January 2010, http://ijcsi.org/articles/A-Strategy-to-enable-Prefix-of-Multicast-VoD-through-dynamic-buffer-allocation.ph
    corecore