Content distribution strategy using web-cached multicast technique

Authors:
Backhyun Kim;Iksoo Kim
Affiliations:
Department of Information and Telecommunication Engineering, Univ. of Incheon, Incheon, Korea;Department of Information and Telecommunication Engineering, Univ. of Incheon, Incheon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2006

Citing 8
Cited 0

The multimedia multicasting problem

Multimedia Systems
Patching: a multicast technique for true video-on-demand services

MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
On filter effects in web caching hierarchies

ACM Transactions on Internet Technology (TOIT)
Prospects for Interactive Video-on-Demand

IEEE MultiMedia
The Split and Merge Protocol for Interactive Video-on-Demand

IEEE MultiMedia
An Alternative Paradigm for Scalable On-Demand Applications: Evaluating and Deploying the Interactive Multimedia Jukebox

IEEE Transactions on Knowledge and Data Engineering
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
System design issues for internet middleware services: deductions from a large client trace

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose content distribution strategy to evenly disperse traffic over network and to reduce the required bandwidth for transmitting content data by merging the adjacent multicasts depending upon the number of proxies n that have requested the same one. In our technique, streaming for the identical content is fragmented as long as the grouping interval for batching multicast and can be stored among proxies in order of the requests. A client might have to download data on two channels simultaneously, one from server through multicast and the other from proxies through unicast or multicast. According to the popularity of content, the grouping interval of multicast can be dynamically expanded up to n times and so it can be reduced server's workload and network traffic. We adopt the cache replacement strategy as LFU (Least-Frequently-Used) for popular content, LRU (Least-Recently-Used) for unpopular content, and the method for replacing the first block of content last to reduce end-to-end latency. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we achieve that the proposed content distribution strategy offers significantly better performance.