A Novel Resource Provisioning Model for DHT-Based Cloud Storage Systems

  • Jingya Zhou
  • Wen He
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8707)


Cloud storage providers build a distributed storage system by utilizing cloud resources located in data centers. The interactions among servers in a DHT (Distributed Hash Table)-based cloud storage system depend on the routing process, and its execution logic is more complicated. Hence, how to allocate resources to not only guarantee service performance (e.g., data availability, response delay), but also help service providers to reduce cost became a challenge. To address this challenge, this paper presents a novel resource provisioning model for cloud storage systems. The model utilizes queuing network for analysis of both service performance level and cost calculation. Then the problem is defined as a cost optimization with performance constrains, and a novel algorithm is proposed. Furthermore, we implemented a DHT-based storage system on top of an infrastructure platform built with OpenStack. Based on real-world traces collected from our system, we show that our model could effectively guarantee the target data availability and response delay with lower cost.


Arrival Rate Rejection Rate Response Delay Distribute Hash Table Cloud Storage 
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.


  1. 1.
    DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., et al.: Dynamo: Amazon’s Highly Available Key-value Store. In: ACM Symp. Operating Systems Principles (SOSP 2007), pp. 205–220. ACM Press (2007)Google Scholar
  2. 2.
    Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review 44, 35–40 (2010)CrossRefGoogle Scholar
  3. 3.
    Stonebraker, M.: The Case for Shared Nothing. IEEE Database Engineering Bulletin 9, 4–9 (1986)Google Scholar
  4. 4.
    Idilio, D., Marco, M., Maurizio, M.-M., Anna, S., Ramin, S., Aiko, P.: Inside Dropbox: Understanding Personal Cloud Storage Services. In: ACM Conf. Internet Measurement Conference (IMC 2012), pp. 481–494. ACM Press (2012)Google Scholar
  5. 5.
    Jing, J., Jie, L., Quan, Z.-G., Dong, L.-G.: Optimal Cloud Resource Auto-Scaling for Web Applications. In: IEEE/ACM Symp. Cluster, Cloud and Grid Computing (CCGrid 2013), pp. 58–65. IEEE CS Press (2013)Google Scholar
  6. 6.
    Ferretti, S., Ghini, V., Panzieri, F., Pellegrini, M., Turrini, E.: QoS-Aware Clouds. In: IEEE Conf. Cloud Computing (CLOUD 2010), pp. 321–328. IEEE CS Press (2010)Google Scholar
  7. 7.
    Jing, B., Liang, Z.-Z., Xiong, T.-R., Bo, W.-Q.: Dynamic Provisioning Modeling for Virtualized Multi-tier Applications in Cloud Data Center. In: IEEE Conf. Cloud Computing (CLOUD 2010), pp. 370–377. IEEE CS Press (2010)Google Scholar
  8. 8.
    Lama, P., Xiao, B.-Z.: Efficient Server Provisioning with Control for End-to-End Response Time Guarantee on Multitier Clusters. IEEE Trans. Parallel and Distributed Systems 23, 78–86 (2012)CrossRefGoogle Scholar
  9. 9.
    Zhu, Z., Bi, J., Yuan, H., Chen, Y.: SLA Based Dynamic Virtualized Resources Provisioning for Shared Cloud Data Centers. In: IEEE Conf. Cloud Computing (CLOUD 2011), pp. 630–637. IEEE CS Press (2011)Google Scholar
  10. 10.
    Zhu, Q., Agrawal, G.: Resource Provisioning with Budget Constraints for Adaptive Applications in Cloud Environments. In: ACM Symp. High Performance Distributed Computing (HPDC 2010), pp. 304–307. ACM Press (2010)Google Scholar
  11. 11.
    Zhang, C., Chen, H.-P., Gao, S.-T.: ALARM: Autonomic Load-Aware Resource Management for P2P Key-Value Stores in Cloud. In: IEEE Conf. Dependable, Autonomic and Secure Computing, pp. 404–410. IEEE CS Press (2011)Google Scholar
  12. 12.
    Gross, D., Shortle, J.-F., Thompson, J.-M., Harris, C.-M.: Fundamentals of queueing theory, 4th edn. John Wiley & Sons (2008)Google Scholar
  13. 13.
    MacGregor, S.-J.: Properties and performance modelling of finite buffer M/G/1/K networks. Computers & Operations Research 38, 740–754 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Tijms, H.: Heuristics for finite-buffer queues. Probability in the Engineering and Informational Sciences 6, 277–285 (1992)CrossRefzbMATHGoogle Scholar
  15. 15.
    HP LoadRunner Tutorial (2010)Google Scholar
  16. 16.

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • Jingya Zhou
    • 1
    • 2
  • Wen He
    • 2
  1. 1.School of Computer Science and TechnologySoochow UniversitySuzhouP.R. China
  2. 2.School of Computer Science and EngineeringSoutheast UniversityNanjingP.R. China

Personalised recommendations