CPI: A Novel Three-Phase Algorithm for QoS-Aware Replica Placement Problem

Authors:
Wei Fu;Yingjie Zhao;Nong Xiao;Xicheng Lu
Affiliations:
School of Computer, National University of Defense Technology, Changsha, P.R. China;School of Computer, National University of Defense Technology, Changsha, P.R. China;School of Computer, National University of Defense Technology, Changsha, P.R. China;School of Computer, National University of Defense Technology, Changsha, P.R. China
Venue:
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Year:
2008

Citing 8
Cited 0

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the use and performance of content distribution networks

IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
QoS-Aware Replica Placement for Content Distribution

IEEE Transactions on Parallel and Distributed Systems
MIDDLE-R: Consistent database replication at the middleware level

ACM Transactions on Computer Systems (TOCS)
P2P replica synchronization with vector sets

ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Hierarchical Replication Control in a Global File System

CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
A QoS-Aware Heuristic Algorithm for Replica Placement

GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

QoS-aware replica placement decides how many replicas are needed and where to deploy them to meet every request from individual clients. In this paper, a novel three-phase algorithm, namely CPI, is proposed. By dividing candidate nodes into proper medium-scale partitions, CPI is capable to handle with large-scale QoS-aware replica placement problem. Pharos-based clustering algorithm obtains ideal grouping, and partition integrating method is developed to obtain final replica policy. Theoretical analysis and experiments show that CPI has lower computation complexity and good scalability. The replicating cost and updating cost remains acceptable under different simulating conditions.