Skip to main content

An Auction and League Championship Algorithm Based Resource Allocation Mechanism for Distributed Cloud

  • Conference paper

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

Abstract

In cloud computing, all kinds of idle resources can be pooled to establish a resource pool, and different kinds of resources combined as a service is provided to users through virtualization. Therefore, an effective mechanism is necessary for managing and allocating the resources. In this paper, we propose a double combinatorial auction based allocation mechanism based on the characteristics of cloud resources and inspired by the flexibility and effectiveness of microeconomic methods. The feedback evaluation based reputation system with attenuation coefficient of time and the hierarchy of users introduced is implemented to avoid malicious behavior. In order to make decisions scientifically, we propose a price decision mechanism based on a BP (back propagation) neural network, in which various factors are taken into account, so the bidding/asking prices can adapt to the changing supply-demand relation in the market. Since the winner determination is an NP hard problem, a league championship algorithm is introduced to achieve optimal allocation with the optimization goals being market surplus and total reputation. We also conduct empirical studies to demonstrate the feasibility and effectiveness of the proposed mechanism.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vasan, R.: A venture perspective on cloud computing. IEEE Computer 44(3), 60–62 (2011)

    Article  Google Scholar 

  2. Papazoglou, M.P., van den Heuvel, W.: Blueprinting the cloud. IEEE Internet Computing 15(6), 74–79 (2011)

    Article  Google Scholar 

  3. Mell, P., Grance, T.: Definition of cloud computing. Technical report, National Institute of Standard and Technology (NIST) (July 2009)

    Google Scholar 

  4. Tan, Z., Gurd, J.R.: Market-based grid resource allocation using a stable continuous double auction. In: IEEE/ACM International Conference on Grid Computing, pp. 283–290 (September 2007)

    Google Scholar 

  5. Danak, A., Mannor, S.: Efficient bidding in dynamic grid markets. IEEE Transactions on Parallel and Distributed Systems 22(9), 1483–1496 (2011)

    Article  Google Scholar 

  6. Tsai, C.W., Tsai, Z.: Bid-proportional auction for resource allocation in capacity-constrained clouds. In: International Conference on Advanced Information Networking and Applications Workshops (WAINA), pp. 1178–1183 (March 2012)

    Google Scholar 

  7. Prodan, R., Wieczorek, M., Frad, M.: Double auction-based scheduling of scientific applications in distributed grid and cloud environment. Journal of Grid Computing 9(4), 531–548 (2011)

    Article  Google Scholar 

  8. Shang, S., Jiang, J., Wu, Y., Yang, G., Zheng, W.: A knowledge-based continuous double auction model for cloud market. In: International Conference on Semantics Knowledge and Grid (SKG), pp. 129–134 (November 2010)

    Google Scholar 

  9. Song, B., Hassan, M.M., Huh, E.N.: A novel cloud market infrastructure for trading service. In: International Conference on Computational Science and Its Applications (ICCSA), pp. 44–50 (June 2009)

    Google Scholar 

  10. Rassenti, S.J., Smith, V.L., Bulfin, R.L.: A combinatorial auction mechanism for airport time slot allocation. The Bell Journal of Economics 13(2), 402–417 (1982)

    Article  Google Scholar 

  11. Xia, M., Stallaert, J., Andrew, B.: Solving the combinatorial double auction problem. European Journal of Operational Research 164(1), 239–251 (2005)

    Article  MATH  Google Scholar 

  12. Kashan, A.H.: League Championship Algorithm: A new algorithm for numerical function optimization. In: International Conference of Soft Computing and Pattern Recognition, pp. 43–48 (2009)

    Google Scholar 

  13. Deb, K.: An efficient constraint handling method for genetic algorithms. Computation Methods in Applied Mechanics and Engineering 86(2-4), 311–338 (2000)

    Article  Google Scholar 

  14. Hecht-Nielsen, R.: Theory of the backpropagation neural network. In: International Joint Conference on Neural Networks, pp. 593–605 (1989)

    Google Scholar 

  15. Howell, F., McNab, R.: Simjava: a discrete event simulation package for Java with applications in computer systems modelling. In: First International Conference on Web-based Modelling and Simulation (1998)

    Google Scholar 

  16. Amazon Web Services, http://aws.amazon.com/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, J., Wang, X., Li, K., Wu, C., Huang, M., Wang, X. (2013). An Auction and League Championship Algorithm Based Resource Allocation Mechanism for Distributed Cloud. In: Wu, C., Cohen, A. (eds) Advanced Parallel Processing Technologies. APPT 2013. Lecture Notes in Computer Science, vol 8299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45293-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45293-2_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45292-5

  • Online ISBN: 978-3-642-45293-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics