(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 5, August 2010
EFRRA : An Efficient Fault-Resilient-Replica-Algorithm for Content Distribution Networks
Assistant Professor, CSEArulmigu Kalasalingam College of EngineeringKrishnankoil, Virudhunagar, INDIAamutharajj@yahoo.com
Senior Professor, CSEArulmigu Kalasalingam College of EngineeringKrishnankoil, Virudhunagar, INDIAsrk@akce.ac.in
— Nowadays, content distribution is an important peer-to-peer application on the Internet that has received considerableresearch attention. Content distribution applications typicallyallow personal computers to function in a coordinated manner asa distributed storage medium by contributing, searching, andobtaining digital content. The primary task in CDN is to replicatethe contents over several mirrored web servers (i.e., surrogateservers) strategically placed at various locations in order to dealwith the flash crowds. Geographically distributing the webservers’ facilities is a method commonly used by serviceproviders to improve performance and scalability. Hence,contents in CDN are replicated in many surrogate serversaccording to some content distribution strategies dictated by theapplication environment. Devising an efficient and resilientcontent replication policy is crucial since, the content distributioncan be limited by several factors in the network.Hence, we propose a novel Efficient Fault Resilient ReplicaAlgorithm (EFRRA) to replicate the content from the originserver to a set of surrogate servers in an efficient and reliablemanner. The contributions of this paper are twofold. First weintroduce a novel EFRRA distribution policy and theoreticallyanalyze its performance with traditional content replicationalgorithms. Then, by means of a simulation based performanceevaluation, we assess the efficiency and resiliency of the proposedEFRR Algorithm, and compare its performance with traditionalcontent replication algorithms stated in the literature. Wedemonstrate in experiment that EFRRA significantly reduces thefile replication time and maintaining the Delivery ratio ascompared with traditional strategies such as sequential unicast,multiple unicast, Fast Replica (FR), Resilient Fast Replica(R-FR),and Tornado codes (TC). This paper also analyzes theperformance of sequential unicast, multiple unicast, Fast Replica(FR), Resilient Fast Replica(R-FR), Tornado codes, and EFRRAalgorithms in terms of average replication time and maximumreplication time.
CDN, Fast Replica, Resilient Fast Replica, Efficient Fault Resilient Replica Algorithm, Tornado Codes.
Content Delivery Networks (CDNs)  provideservices that improve network performance by maximizingbandwidth, accessibility and maintaining correctness throughcontent replication. It offers fast and reliable applications andservices by distributing content to cache or edge servers locatedclose to users . A CDN has some combination of content-delivery, request-routing, distribution and accountinginfrastructure. The content-delivery infrastructure consists of aset of edge servers (also called surrogates) that deliver copiesof content to end-users. The request-routing infrastructure isresponsible to directing client request to appropriate edgeservers. It also interacts with the distribution infrastructure tokeep an up-to-date view of the content stored in the CDNcaches.In particular, Content Delivery Networks (CDNs) optimizecontent delivery by putting the content closer to the consumerand shorting the delivery path via global networks of strategically placed servers . The CDN’s edge servers are thecaching servers, and if the requested content is not yet in thecache, this document is pulled from the original server. Forlarge documents, software packages, and media files, pushoperational mode is preferred. It is desirable to replicate thesefiles at edge servers in advance .While transferring a large file with individual point-to-point connections from an original server can be a viablesolution in the case of limited number of mirror server, thismethod does not scale when the content needs to be replicatedacross a CDN with thousands of geographically distributededge replica nodes .This paper is organized as follows. Section II describes therelated work. Next, we present the working mechanisms of different content distribution algorithms and our proposedEFRRA content distribution algorithm. Section IV presentsdiscussion on analytical study, experimental results andanalyzes the performance of different content distributionalgorithms. Finally, the conclusion and future work issummarized.II.
Ludmila et al.  proposed a novel algorithm, called FastReplica, for an efficient and reliable replication of large files inthe Internet environment. Instead of downloading the entire filefrom one server, a user downloads different parts of the samefile from different servers in parallel. Once all the parts of thefile are received, the user reconstructs the original file byreassembling the different parts. There are several advantageswhile using a dynamic parallel access. First, as the block size is