Izvestiya of Saratov University.

Mathematics. Mechanics. Informatics

ISSN 1816-9791 (Print)
ISSN 2541-9005 (Online)

For citation:

Solovyev V. M. Convergent and Hyperconvergent Computing Systems. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2018, vol. 18, iss. 1, pp. 84-100. DOI: 10.18500/1816-9791-2018-18-1-84-100, EDN: YABQRF

This is an open access article distributed under the terms of Creative Commons Attribution 4.0 International License (CC-BY 4.0).
Published online: 
Full text:
(downloads: 210)
Article type: 

Convergent and Hyperconvergent Computing Systems

Solovyev Vladimir Mihajlovich, Saratov State University

In the work the questions of construction of hyperconvergent computer systems and their functioning on the basis of a program-configurable network are considered. The features of the OpenFlow protocol and technological solutions that transfer control of the software-configurable network to a dedicated controller (server) are presented. A graph model of resource management of a hyperconvergent computer system is proposed that meets the requirements of a given quality of service on the one hand and economic requirements on the other. Based on the proposed model, an embodiment of a greedy algorithm for managing a converged infrastructure using the OpenFlow protocol and realizing requests for physical resources using the controller software is considered. The advantages of multithreading routing realized with the environment of hyperconvergent infrastructure are shown, using for its description the minimal Steiner tree. The issues of reliability and safety of hyperconvergent computing systems that make most of today's threats not relevant are considered. The paper shows the possibilities of import substitution and the prospects for switching to a network infrastructure, focused on content.

  1. Orlov S. Import substitution in ICT: the view of producers. Network Solutions Journal / LAN, 2015, no. 10, pp. 48–50 (in Russian).
  2. OpenFlow Switch Specification. Version 1.3.4. Open Networking Foundation. 2014. 171 p. URL: https://www.opennetworking.org/images/stories/downloads/sdn-resources/on... (Accessed 4 July 2017)
  3. OpenFlow Table Type Patterns. Version 1.0. Open Networking Foundation. 2014. 55 p. URL: https://www.opennetworking.org/images/stories/downloads/sdn-resources/on... (Accessed 4 July 2017).
  4. Clos C. A study of non-blocking switching networks // The Bell System Technical Journal. 1953. Vol. 32, № 2. P. 406–424. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6770468 (Accessed 4 July 2017). DOI: https://doi.org/10.1002/j.1538-7305.1953.tb01433.x.
  5. Zotov I. A., Kostenko V. A. Resource allocation algorithm in data centers with a unified scheduler for different types of resources. Journal of Computer and Systems Sciences International. 2015, vol. 54, no. 1, pp. 59–68. DOI: https://doi.org/10.7868/S000233881501014X.
  6. Meng X., Pappas V., Zhang L. Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement // INFOCOM, 2010 Proceedings IEEE. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5461930 (Accessed 4 July 2017). DOI: https://doi.org/10.1109/INFCOM.2010.5461930.
  7. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. Introduction to Algorithms. Cambridge MA : MIT Press and McGrawHill, 2001. P. 595–601.
  8. Zhao M., Figueiredo R. J. Experimental Study of Virtual Machine Migration in Support of Reservation of Cluster Resources // VTDC ’07 Proceedings of the 2nd international workshop on Virtualization technology in distributed computing. 2007. P. 1–8. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5483380 (Accessed 4 July 2017). DOI: https://doi.org/10.1145/1408654.1408659.
  9. Smelyansky R. L. The concept of software-configured networks: from idea to standardization. CONNECT! Mir sviazi: Nauka. Biznes. Upravlenie [CONNECT! The World of Connection: Science. Business. Control], 2016, no. 4, pp. 62–67 (in Russian).
  10. Smelyansky R. Present and future of SDN&NFV. Last Mile, 2016, no. 3, pp. 78–85 (in Russian).
Short text (in English):
(downloads: 123)