Skip to main content
SpringerLink
Log in

QoS-Aware and Fault-Tolerant Replica Placement

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12453))

Abstract

As emerging applications become more and more distributed and decentralized, it has become a more challenging problem to design and build fault-tolerant network systems with high Quality of Service (QoS) guarantee. In this paper, an optimal replica placement problem is formulated in terms of minimizing the replica placement cost subject to both QoS and fault-tolerant constraints. Based on the generalized graph model, the optimal replica placement problem is proved to be NP-hard. The essential properties of the proposed problem are investigated and two criteria, which can quantitatively measure the replica demand of each node and the contribution of one replica to other nodes in the graph, are proposed. The criteria are employed to develop efficient heuristic algorithms. Finally the proposed algorithms are evaluated with extensive network configurations and the experimental results show that the proposed heuristic algorithms can generate solutions very close to the optimal results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For those graphs that inherently cannot meet the preconditions of Q, L M, it is trivial to conclude that no feasible solutions can be found.

  2. 2.

    Interested readers are referred to [8, 17] for details of the topology model and usage of the tool.

References

  1. Aral, A., Ovatman, T.: A decentralized replica placement algorithm for edge computing. IEEE Trans. Netw. Serv. Manage. 15(2), 516–529 (2018)

    Article  Google Scholar 

  2. Charikar, M., Guha, S., Tardos, É., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci. 65(1), 129–149 (2002)

    Article  MathSciNet  Google Scholar 

  3. Cheng, C., Wu, J., Liu, P.: QoS-aware, access-efficient, and storage-efficient replica placement in grid environments. J. Supercomput. 49(1), 42–63 (2009)

    Article  Google Scholar 

  4. Cornuéjols, G., Nemhauser, G., Wolsey, L.: The uncapicitated facility location problem. Cornell University Operations Research and Industrial Engineering, Technical report (1983)

    Google Scholar 

  5. Du, Z., Hu, J., Chen, Y., Cheng, Z., Wang, X.: Optimized QoS-aware replica placement heuristics and applications in astronomy data grid. J. Syst. Softw. 84(7), 1224–1232 (2011)

    Article  Google Scholar 

  6. Du, Z., Zhang, S., Bader, D.A., Hu, J.: A 2-approximation algorithm for QoS-aware and fault-tolerant replica placement. In: 2020 IEEE High Performance Extreme Computing Conference (HPEC). IEEE (2020)

    Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  8. Georgia Tech Internetwork Topology Models. http://www.cc.gatech.edu/projects/gtitm/. Accessed 4 Apr 2012

  9. Ghanbari, H., Litoiu, M., Pawluk, P., Barna, C.: Replica placement in cloud through simple stochastic model predictive control. In: 2014 IEEE 7th International Conference on Cloud Computing, pp. 80–87. IEEE (2014)

    Google Scholar 

  10. Grace, R.K., Manimegalai, R.: Dynamic replica placement and selection strategies in data grids-a comprehensive survey. J. Parallel Distrib. Comput. 74(2), 2099–2108 (2014)

    Article  Google Scholar 

  11. Hashem, I.A.T., et al.: The role of big data in smart city. Int. J. Inf. Manage. 36(5), 748–758 (2016)

    Article  Google Scholar 

  12. Khan, S.U., Maciejewski, A.A., Siegel, H.J.: Robust CDN replica placement techniques. In: the 23rd IEEE International Parallel Distributed Processing Symposium (IPDPS), pp. 1–8. Rome, Italy (2009)

    Google Scholar 

  13. Lim, A., Rodrigues, B., Wang, F., Xu, Z.: k-center problems with minimum coverage. Theoret. Comput. Sci. 332(1–3), 1–17 (2005)

    Article  MathSciNet  Google Scholar 

  14. Mills, K.A.: Algorithms for Optimal Replica Placement in Data Centers. Ph.D. thesis, The University of Texas at Dallas (2017)

    Google Scholar 

  15. Sahoo, J., Salahuddin, M.A., Glitho, R., Elbiaze, H., Ajib, W.: A survey on replica server placement algorithms for content delivery networks. IEEE Commun. Surv. Tutor. 19(2), 1002–1026 (2016)

    Article  Google Scholar 

  16. Tang, X., Xu, J.: QoS-aware replica placement for content distribution. IEEE Trans. Parallel Distrib. Syst. 16(10), 921–932 (2005)

    Article  Google Scholar 

  17. Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)

    Article  Google Scholar 

  18. Yousafzai, A., Gani, A., Noor, R.M.: Availability aware continuous replica placement problem. arXiv preprint arXiv:1605.04069 (2016)

  19. Yu, S.S., Yu, S.: Autonomous unmanned road vehicle for making deliveries (2015), US Patent App. 14/318,690

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Worldmoney Blockchain Management Limited, Hong Kong, Hong Kong

    Jingkun Hu

  2. New Jersey Institute of Technology, Newark, NJ, USA

    Zhihui Du & David A. Bader

  3. State University of New York, College at Oneonta, Oneonta, USA

    Sen Zhang

Authors
  1. Jingkun Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhihui Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David A. Bader
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Zhihui Du or David A. Bader .

Editor information

Editors and Affiliations

  1. Columbia University, New York, NY, USA

    Meikang Qiu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hu, J., Du, Z., Zhang, S., Bader, D.A. (2020). QoS-Aware and Fault-Tolerant Replica Placement. In: Qiu, M. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2020. Lecture Notes in Computer Science(), vol 12453. Springer, Cham. https://doi.org/10.1007/978-3-030-60239-0_11

Download citation

Publish with us

Policies and ethics

Search

Navigation