RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2019 Volume 19, Issue 2, Pages 226–232 (Mi isu803)

Scientific Part
Computer Sciences

Administration of virtual data processing center over OpenFlow

V. M. Solovyeva, A. A. Belousovb

a Volga Region Centre of New Information Technologies in Volga Region, Saratov State University, 83 Astrakhanskaya St., Saratov 410012, Russia
b Saratov State University, 83 Astrakhanskaya St., Saratov 410012, Russia

Abstract: This paper researches the building principles and administration of virtual data processing centers based on hyper-converged systems over OpenFlow. We provide the implementation features of such virtual centers on the basis of software-defined networking that is managed by a dedicated controller (a server). We suggest the graph administration model of hyper-converged system resources compliant with required performance on the one hand and economic requirements on the other. Based on the proposed model, the implementation of a greedy control algorithm for the virtual data processing center over OpenFlow was examined. This algorithm assigns the requests to physical resources by using of dedicated server software. The advantages of such hyper-converged system model on performance issues were outlined, e.g., multi-threaded routing and security, elimination of the majority of current threats. We summarize the possibilities of transition to network infrastructure in these virtual data processing centers. Such infrastructure is focused on data and usage of blockchain technology providing high reliability and content protection.

Key words: converged infrastructure, hyper-converged infrastructure, software defined networks, OpenFlow, virtual data center, service level agreement, multi-threaded routing, quality of service, Data Oriented Network Architecture (DONA), blockchain.

UDC: 004.75

Received: 29.05.2018
Revised: 05.09.2018
Accepted: 28.05.2019

Language: English

DOI: 10.18500/1816-9791-2019-19-2-226-232



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024