Advertisement

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

  • Wei Fu
  • Yingjie Zhao
  • Nong Xiao
  • Xicheng Lu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5245)

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.

Keywords

Time Complexity Short Path Tree Total Time Complexity Replica Placement Local Replica 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Patiño-Martinez, M., Jiménez-Peris, R., et al.: MIDDLE-R: Consistent database replication at the middleware level. ACM Transactions on Computer Systems (TOCS) 23(4), 375–423 (2005)CrossRefGoogle Scholar
  2. 2.
    Zhang, J., Honeyman, P.: Hierarchical Replication Control in a Global File System. In: Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGRID 2007, pp. 155–162 (2007)Google Scholar
  3. 3.
    Gkantsidis, C., Rodriguez, P.R.: Network coding for large scale content distribution. In: 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, pp. 2235–2245 (2005)Google Scholar
  4. 4.
    Krishnamurthy, B., Wills, C., Zhang, Y.: On the use and performance of content distribution networks. In: Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement table of contents, pp. 169–182Google Scholar
  5. 5.
    Malkhi, D., Novik, L., Purcell, C.: P2P replica synchronization with vector sets. ACM SIGOPS Operating Systems Review archive 41(2), 68–74 (2007)CrossRefGoogle Scholar
  6. 6.
    Ann Chervenak, I.F., Kesselman, C., Salisbury, C., Tuecke, S.: The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientic Datasets. Journal of Network and Computer Applications 23, 187–200 (2001)CrossRefGoogle Scholar
  7. 7.
    Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the Placement of Web Server Replicas. In: Proc. IEEE INFOCOM 2001, pp. 1587–1596 (2001)Google Scholar
  8. 8.
    Cidon, I., Kutten, S., Soffer, R.: Optimal Allocation of Electronic Content. In: Proc. IEEE INFOCOM 2001, April 2001, pp. 1773–1780 (2001)Google Scholar
  9. 9.
    Tang, X., Xu, J.: Qos-aware replica placement for content distribution. IEEE Transactions on Parallel and Distributed Systems 10, 921–932 (2005)CrossRefGoogle Scholar
  10. 10.
    Hsiangkai Wang, P.L., Wu, J.-J.: A QoS-Aware Heuristic Algorithm for Replica Placement. In: Grid Computing Conference 2006 (2006)Google Scholar
  11. 11.
    Won, J., Jeon, I.G., Nahrstedt, K.: QoS-aware Object Replication in Overlay Networks. In: IPTPS 2005 (2005)Google Scholar
  12. 12.
    Fu, W., Xiao, N., Lu, X.: QoS-Guaranteed Ring Replication Management with Strong Consistency. In: ApWeb/WAIM Workshops, Huangshan China (2007)Google Scholar
  13. 13.
    Tao, W., Wei-Sheng, L.: A Fast Low-Cost Shortest Path Tree Algorithm. Journal of Software (China) 15(5), 660–665Google Scholar
  14. 14.
  15. 15.
    Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh connected computers. In: Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents, pp. 255–263 (1986)Google Scholar
  16. 16.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: an approach to universal topology generation. In: Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 346–353 (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Wei Fu
    • 1
  • Yingjie Zhao
    • 1
  • Nong Xiao
    • 1
  • Xicheng Lu
    • 1
  1. 1.School of ComputerNational University of Defense TechnologyChangshaP.R. China

Personalised recommendations