Dmytro Korenko

Work place: National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”/ Department of computer engineering, Department of information systems and technologies, Kyiv, 03056, Ukraine

E-mail: korenko.dima98@gmail.com

Website: https://orcid.org/0000-0003-0463-189X

Research Interests: Mathematics of Computing, Type Systems, Information Systems, Distributed Computing, Computer Architecture and Organization, Computer systems and computational processes

Biography

PHD Student Dmytro Korenko, Department of Computer Engineering, National Technical University of Ukraine, “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine

(ORCID ID https://orcid.org/0000-0003-0463-189X)

Areas of scientific interests: Designing computer networks and organizing computing processes in them, developing and implementing network technologies, SDN technology, multipath routing algorithms, network topological organization, traffic and load balancing. 

Author Articles
Traffic Engineering with Specified Quality of Service Parameters in Software-defined Networks

By Artem Volokyta Alla Kogan Oleksii Cherevatenko Dmytro Korenko Dmytro Oboznyi Yurii Kulakov

DOI: https://doi.org/10.5815/ijcnis.2024.05.01, Pub. Date: 8 Oct. 2024

A method of traffic engineering (TE) based on the method of multi-path routing is proposed in the study. Today, one of the main challenges in networking is to organize an efficient TE system that will provide such parameters of quality of service (QoS) as the allowable value of packet loss and time for traffic re-routing. Traditional one-way routing facilities do not provide the required quality of service (QoS) parameters for TE. Modern computer networks use static and dynamic routing algorithms, which are characterized by big time complexity and a large amount of service information. This negatively affects the overall state of the network, namely: leads to network congestion, device failure, loss of information during routing and increases the time for traffic re-routing. Research has shown that the most promising way to solve the TE problem in computer networks is a comprehensive approach, which consists of multi-path routing, SDN technology and monitoring of the overall situation of the network. This paper proposes a method of traffic engineering in a software-defined network with specified quality of service parameters, which has reduced the time of traffic re-routing and the percentage of packet loss due to the combination of the centralized TE method and multi-path routing. From a practical point of view, the obtained method, will improve the quality of service in computer networks in comparison with the known method of traffic construction.

[...] Read more.
Extended DragonDeBrujin Topology Synthesis Method

By Artem Volokyta Heorhii Loutskii Pavlo Rehida Artem Kaplunov Bohdan Ivanishchev Oleksandr Honcharenko Dmytro Korenko

DOI: https://doi.org/10.5815/ijcnis.2022.06.03, Pub. Date: 8 Dec. 2022

Scaling high performance computer systems needs increasing the fault tolerance at the design stage of a topology. There are several approaches of designing simple fast routing with fault tolerance. One of effective approach is to ensure fault tolerance at the topology level. This article discusses two methods for optimizing topologies synthesized using Dragonfly and Excess De Brujin. Methods of topology saturation are discusses, which allow to increase the dimension of the system without deterioration of topological characteristics due to the optimization of the synthesis method. Three scaling constraint methods are also proposed to reduce the topology dimension to the desired performance.

[...] Read more.
Other Articles