Abstract
In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. Each video stream is divided into blocks which are the same size of multicast grouping interval I m . Blocks then are evenly distributed into different HENs according to their popularity and the order of requests. Only when the playback time exceeds the amount of cached video data, server generates new multicast channel. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We adopt the cache replacement strategy as LFU (Least-Frequently-Used) for popular videos, LRU (Least-Recently-Used) for unpopular videos, and the method for replacing the first block of video last to reduce end-to-end latency. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the proposed multicast technique offers substantially better performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
