By Topic

A Comparative Study on Replica Placement Algorithms for Content Delivery Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mohammad H. Al-Shayeji ; Comput. Eng. Dept., Kuwait Univ., Safat, Kuwait ; Sam Rajesh M. D ; Manal Alsarraf ; Reem Alsuwaid

In today's web based IT environment response time and availability are of major concerns, a few seconds delay in response time or non-availability of a resource can significantly impact customer satisfaction. Replication provides better performance and higher availability by maintaining multiple copies of data called replicas at various strategic locations. An important issue that must be addressed before replication is performed is where to place replicas. Several replica placement algorithms have been proposed and each has its own advantages and disadvantages. In this paper we study the various replica placement algorithms with respect to content delivery networks. Our main contribution in this paper is to compare popular replica placement algorithms and provide general scenarios for content delivery networks with proposed suitable algorithm for each of the scenarios. The scenarios can be a reference point for system designer for choosing a right replica placement algorithm for content delivery networks.

Published in:

Advances in Computing, Control and Telecommunication Technologies (ACT), 2010 Second International Conference on

Date of Conference:

2-3 Dec. 2010