Multicast Transmission Prefix and Popularity Aware Interval Caching Based Admission Control Policy
P. Jayarekha, T.R. Gopalakrishnan Nair

TL;DR
This paper proposes a multicast transmission and interval caching-based admission control policy that improves server resource utilization and QoS by considering object popularity and caching intervals.
Contribution
It introduces a novel admission control algorithm that combines multicast transmission with popularity-aware interval caching for multimedia servers.
Findings
Increased request serving capacity due to multicast transmission.
Reduced disk operations by caching data between requests.
Enhanced QoS adherence through popularity-aware caching.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Advanced Data Storage Technologies · Cooperative Communication and Network Coding
