Skip to main content

Ant Colony Algorithm for Building of Virtual Machine Disk Images Within Cloud Systems

  • Conference paper
  • First Online:
  • 1323 Accesses

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 47))

Abstract

Nowadays, the development of the cloud systems for collective access to virtual working environments, software, virtual stands and laboratories is very actual. Typically, such systems are created based on virtual machines (IaaS – Infrastructure as a Service), which provide remote access to their resources (including access to desktops). In the case of a large number of cloud system users it is necessary to store a large number of virtual machine disk images with various installed software. But it requires significant financial costs, when public cloud providers are used. In this study it is proposed to build disk images automatically and store them for a short time.

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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

References

  1. Shukhman, A.E., Polezhaev, P.N., Legashev, L.V., Ushakov, Y.A., Bolodurina, I.P.: Creation of regional center for shared access to educational software based on cloud technology. In: Global Engineering Education Conference (EDUCON), pp. 916–919 (2017)

    Google Scholar 

  2. Foulds, L., Graham, R.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3(1), 43–49 (1982)

    Article  MathSciNet  Google Scholar 

  3. Liu, L., Song, Y., Zhang, H., Ma, H., Vasilakos, A.V.: Physarum optimization: a biology-inspired algorithm for the Steiner tree problem in networks. IEEE Trans. Comput. J. 64, 818–831 (2013)

    MathSciNet  MATH  Google Scholar 

  4. Song, Y., Liu, L., Ma, H., Vasilakos, A.V.: A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Trans. Netw. Serv. Manag. J. 11, 417–430 (2014)

    Article  Google Scholar 

  5. Liu, B.H., Nguyen, N.T., Pham, V.T., Wang, W.S.: Constrained node-weighted Steiner tree based algorithms for constructing a wireless sensor network to cover maximum weighted critical square grids. Comput. Commun. J. 81, 52–60 (2016)

    Article  Google Scholar 

  6. Han, X., Liu, J., Liu, D., Liao, Q., Hu, J., Yang, Y.: Distribution network planning study with distributed generation based on Steiner tree model. In: IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC-2014) (2014). https://doi.org/10.1109/appeec.2014.7066185

Download references

Acknowledgment

The research has been supported by the Russian Foundation for Basic Research (projects 16-07-01004, 16-29-09639, 16-47-560335), and by the President of the Russian Federation within the grant for young scientists and PhD students (SP-2179.2015.5).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Shukhman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bolodurina, I., Legashev, L., Polezhaev, P., Shukhman, A., Ushakov, Y. (2019). Ant Colony Algorithm for Building of Virtual Machine Disk Images Within Cloud Systems. In: Auer, M., Langmann, R. (eds) Smart Industry & Smart Education. REV 2018. Lecture Notes in Networks and Systems, vol 47. Springer, Cham. https://doi.org/10.1007/978-3-319-95678-7_77

Download citation

Publish with us

Policies and ethics