Optimal Fault Indicator Placement in Distribution Networks Using SFLA Algorithm
A New Replica Placement Algorithm for Improving the...
2
A New Replica Placement Algorithm for Improving the Performance in CDNs LEI ZHANG 1 , HUI TIAN 1 , and STEPHAN STEGLICH 2 1 Key Laboratory of Universal Wireless Communications (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, P.R. China 2 Fraunhofer Institute for Open Communication Systems (FOKUS), Berlin, Germany With the advent of services and applications over the Internet, speed and reliability have become critical issues for clients, and the Internet currently is not well suited for the purpose of the emerging new service delivery contemplated by today’s applications. In response to these challenges, commercial Content Distribution Network (CDN) deploys a set of proxy servers called replicas and improves the content delivery performance by replicating the content to multiple replicas in the Internet. These issues motivate us to do research in how to efficiently place replicas in the network, and then propose a cost-based replica placement algorithm which selects replica locations using a greedy fashion iteratively. We evaluated that it can yield close to optimal performance at low management and computation cost among several replica placement strategies. The key contributions of this paper are threefold: 1. A practical cost function from the game theoretic perspective is designed, and is limited by various parameters and constraints. It can minimize either its clients’ latency or its total bandwidth consumption. 2. A cost-based replica placement integrating a greedy algorithm is proposed, which can provide CDNs with the performance close to optimal. 3. The performance of the diversified replica placement algorithms is evaluated by simulating their behavior on synthetic and real network topologies. To the best of our knowledge, there are few studies on this subject. In summary, we study the online problem of placing web replicas in CDNs to minimize the cost for clients to access data replicated from the original web servers. The novel cost-based replica placement is designed combining with the minimum k-median heuristic greedy algorithm. We evaluate the performance of the different replica placement algorithms by simulating their behavior on both synthetic and real network topologies. Based upon simulation results, we conclude that our cost-based greedy algorithm for web server replica placement can provide CDNs with performance that is close to optimal. Although the greedy algorithm depends upon estimation, we find it is a viable and practical algorithm to use in the general Internet environment. As for future work, we are interested in exploring incremental versions of the placement algorithms that also take into account the cost of changing the set of replica sites. Ideally, for placement strategies with similar performance, we prefer the one that incurs the least amount of perturbation to the system. Keywords Access frequency; Cost function; Content Distribution Network (CDN); Replica place- ment algorithm; Web replica International Journal of Distributed Sensor Networks, 5: 35, 2009 Copyright Ó Taylor & Francis Group, LLC ISSN: 1550-1329 print / 1550-1477 online DOI: 10.1080/15501320802524011 This work was supported by National 863 High Tech R&D Program of China, No. 2006DFA11050 and No. 2006AA01Z283, National Natural Science Foundation (NSFC) of China, No. 60632030 and No. 60496312, and the German Federal Ministry of Education and Research within the ‘‘Universal Service Terminal Enhancement (UST+)’’ project. Address correspondence to Lei Zhang, Key Laboratory of Universal Wireless Communications, Beijing University of Posts and Telecommunications, Ministry of Education, Beijing, P.R. China. E-mail: [email protected] 35
Transcript of A New Replica Placement Algorithm for Improving the...
A New Replica Placement Algorithm for Improvingthe Performance in CDNs
LEI ZHANG1, HUI TIAN1, and STEPHAN STEGLICH2
1Key Laboratory of Universal Wireless Communications (Beijing University of
Posts and Telecommunications), Ministry of Education, Beijing, P.R. China2Fraunhofer Institute for Open Communication Systems (FOKUS), Berlin, Germany
With the advent of services and applications over the Internet, speed and reliability have become criticalissues for clients, and the Internet currently is not well suited for the purpose of the emerging newservice delivery contemplated by today’s applications. In response to these challenges, commercialContent Distribution Network (CDN) deploys a set of proxy servers called replicas and improves thecontent delivery performance by replicating the content to multiple replicas in the Internet.
These issues motivate us to do research in how to efficiently place replicas in the network, andthen propose a cost-based replica placement algorithm which selects replica locations using a greedyfashion iteratively. We evaluated that it can yield close to optimal performance at low managementand computation cost among several replica placement strategies.
The key contributions of this paper are threefold:
1. A practical cost function from the game theoretic perspective is designed, and is limited by variousparameters and constraints. It can minimize either its clients’ latency or its total bandwidthconsumption.
2. A cost-based replica placement integrating a greedy algorithm is proposed, which can provideCDNs with the performance close to optimal.
3. The performance of the diversified replica placement algorithms is evaluated by simulating theirbehavior on synthetic and real network topologies. To the best of our knowledge, there are fewstudies on this subject.
In summary, we study the online problem of placing web replicas in CDNs to minimize the costfor clients to access data replicated from the original web servers. The novel cost-based replicaplacement is designed combining with the minimum k-median heuristic greedy algorithm. Weevaluate the performance of the different replica placement algorithms by simulating theirbehavior on both synthetic and real network topologies. Based upon simulation results, weconclude that our cost-based greedy algorithm for web server replica placement can provide CDNswith performance that is close to optimal. Although the greedy algorithm depends upon estimation, wefind it is a viable and practical algorithm to use in the general Internet environment. As for futurework, we are interested in exploring incremental versions of the placement algorithms that also takeinto account the cost of changing the set of replica sites. Ideally, for placement strategies with similarperformance, we prefer the one that incurs the least amount of perturbation to the system.
Keywords Access frequency; Cost function; Content Distribution Network (CDN); Replica place-ment algorithm; Web replica
International Journal of Distributed Sensor Networks, 5: 35, 2009
Copyright � Taylor & Francis Group, LLC
ISSN: 1550-1329 print / 1550-1477 online
DOI: 10.1080/15501320802524011
This work was supported by National 863 High Tech R&D Program of China,No. 2006DFA11050 and No. 2006AA01Z283, National Natural Science Foundation (NSFC) ofChina, No. 60632030 and No. 60496312, and the German Federal Ministry of Education andResearch within the ‘‘Universal Service Terminal Enhancement (UST+)’’ project.
Address correspondence to Lei Zhang, Key Laboratory of Universal Wireless Communications,Beijing University of Posts and Telecommunications, Ministry of Education, Beijing, P.R. China.E-mail: [email protected]
35
International Journal of
AerospaceEngineeringHindawi Publishing Corporationhttp://www.hindawi.com Volume 2010
RoboticsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Active and Passive Electronic Components
Control Scienceand Engineering
Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
International Journal of
RotatingMachinery
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporation http://www.hindawi.com
Journal ofEngineeringVolume 2014
Submit your manuscripts athttp://www.hindawi.com
VLSI Design
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Shock and Vibration
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Civil EngineeringAdvances in
Acoustics and VibrationAdvances in
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Electrical and Computer Engineering
Journal of
Advances inOptoElectronics
Hindawi Publishing Corporation http://www.hindawi.com
Volume 2014
The Scientific World JournalHindawi Publishing Corporation http://www.hindawi.com Volume 2014
SensorsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Modelling & Simulation in EngineeringHindawi Publishing Corporation http://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Chemical EngineeringInternational Journal of Antennas and
Propagation
International Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Navigation and Observation
International Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
DistributedSensor Networks
International Journal of
