Skip to main content
Springer Nature Link
Log in

Cloud Resource Combinatorial Double Auction Algorithm Based on Genetic Algorithm and Simulated Annealing

  • Conference paper
  • First Online:
Quality, Reliability, Security and Robustness in Heterogeneous Networks (QShine 2016)

  • 1019 Accesses

Abstract

In this paper, on the basis of the analysis of common market model and some economic theories in the cloud computing resource management process, we propose a cloud resource management model based on combinatorial double auction. In order to solve the winner determination problem (WDP) in the combinatorial double auction, a cloud resource combinatorial double auction algorithm based on genetic algorithm and simulated annealing algorithm is proposed. Simulation results reveal that the algorithm combines genetic algorithm with simulated annealing algorithm (SAGA) outperforms genetic algorithm on fitness value and stability, and as the number of bidders increase, the solution have higher fitness value can be obtained.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Barroso, L.A., Clidaras, J., Holzle, U.: The datacenter as a computer: an introduction to the design of warehouse-scale machines. Synth. Lect. Comput. Archit. 8(3), 1–154 (2013)

    Article  Google Scholar 

  2. Armbrust, M., Fox, A., Griffith, R., Joseph, A.D.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  3. Zuo, L., Shu, L., Dong, S., et al.: A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing. IEEE Access 3, 2687–2699 (2015)

    Article  Google Scholar 

  4. Zuo, L., Dong, S., Shu, L., et al.: A multiqueue interlacing peak scheduling method based on tasks classification in cloud computing. IEEE Syst. J. PP(99), 1–13 (2016)

    Article  Google Scholar 

  5. Zuo, L., Shu, L., Dong, S., et al.: Dynamically weighted load evaluation method based on self-adaptive threshold in cloud computing. Mob. Netw. Appl. 1–15 (2016)

    Google Scholar 

  6. Buyya, R., Yeo, C.S., Venugopal, S.: Market-oriented cloud computing: vision, hype, and reality for delivering it services as computing utilities. In: 10th IEEE International Conference on High Performance Computing and Communications (HPCC), pp. 5–13 (2008)

    Google Scholar 

  7. Samimi, P., Teimouri, Y., Mukhtar, M.: A combinatorial double auction resource allocation model in cloud computing. Inf. Sci. (2014)

    Google Scholar 

  8. Xia, M., Stallaert, J., Whinston, A.B.: Solving the combinatorial double auction problem. Eur. J. Oper. Res. 164(1), 239–251 (2005)

    Article  MATH  Google Scholar 

  9. Hsieh, F.S., Liao, C.S.: Schemes to reward winners in combinatorial double auctions based on optimization of surplus. Electron. Commer. Res. Appl. 14(6), 405–417 (2015)

    Article  Google Scholar 

  10. Son, J., Dastjerdi, A.V., Calheiros, R.N.: CloudSimSDN: modeling and Simulation of software-defined cloud data centers. In: 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp. 475–484 (2015)

    Google Scholar 

Download references

Acknowledgement

This paper was supported by the National Natural Science Foundation of China (Nos. 61170276, 61373135); Project for Production Study and Research of Jiangsu Province (Grant No. BY2013011); Science and Technology Enterprises Innovation Fund Project of Jiangsu Province (Grant No. BC2013027); Key University Science Research Project of Jiangsu Province (Grant No.12KJA520003); Natural Science Foundation of Jiangsu Province of China (Grant No. BK20140883).

Author information

Authors and Affiliations

  1. Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Nanjing, China

    Bing Hu, Lin Yao & Zinxin Sun

  2. Nanjing LongYuan Microelectronic Company Limited, Nanjing, China

    Yong Chen

Authors
  1. Bing Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zinxin Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zinxin Sun .

Editor information

Editors and Affiliations

  1. Sangmyung University, Cheonan, Korea (Republic of)

    Jong-Hyouk Lee

  2. Korea University, Seoul, Korea (Republic of)

    Sangheon Pack

Rights and permissions

Reprints and permissions

Copyright information

© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Hu, B., Yao, L., Chen, Y., Sun, Z. (2017). Cloud Resource Combinatorial Double Auction Algorithm Based on Genetic Algorithm and Simulated Annealing. In: Lee, JH., Pack, S. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 199. Springer, Cham. https://doi.org/10.1007/978-3-319-60717-7_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60717-7_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60716-0

  • Online ISBN: 978-3-319-60717-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics