Irina Kochetkova (Gudkova)

Dr. Irina Kochetkova (Gudkova)

RUDN University (People's Friendship University of Russia), Moscow, Moskva, Russia
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
Ammar MuthannaAmmar Muthanna
Ammar Muthanna
Abdelhamied A. AteyaAbdelhamied A. Ateya
Abdelhamied A. Ateya
AKAbdukodir Khakimov
Abdukodir Khakimov
IGIrina Gudkova
Irina Gudkova
AAAbdelrahman Abuarqoub
Abdelrahman Abuarqoub
Andrey KoucheryavyAndrey Koucheryavy
Andrey Koucheryavy
Designing Internet of Things (IoT) applications faces many challenges including security, massive traffic, high availability, high reliability and energy constraints. Recent distributed computing paradigms, such as Fog and multi-access edge computing (MEC), software-defined networking (SDN), network virtualization and blockchain can be exploited in IoT networks, either combined or individually, to overcome the aforementioned challenges while maintaining system performance. In this paper, we present a framework for IoT that employs an edge computing layer of Fog nodes controlled and managed by an SDN network to achieve high reliability and availability for latency-sensitive IoT applications. The SDN network is equipped with distributed controllers and distributed resource constrained OpenFlow switches. Blockchain is used to ensure decentralization in a trustful manner. Additionally, a data offloading algorithm is developed to allocate various processing and computing tasks to the OpenFlow switches based on their current workload. Moreover, a traffic model is proposed to model and analyze the traffic indifferent parts of the network. The proposed algorithm is evaluated in simulation and in a testbed. Experimental results show that the proposed framework achieves higher efficiency in terms of latency and resource utilization.

Verified
Journal Article
Open access
PDF file
Abdelhamied A. AteyaAbdelhamied A. Ateya
Abdelhamied A. Ateya
Ammar MuthannaAmmar Muthanna
Ammar Muthanna
IGIrina Gudkova
Irina Gudkova
AAAbdelrahman Abuarqoub
Abdelrahman Abuarqoub
AVAnastasia Vybornova
Anastasia Vybornova
Andrey KoucheryavyAndrey Koucheryavy
Andrey Koucheryavy
One of the main design aspects of the Tactile Internet system is the 1 ms end-to-end latency, which is considered as being the main challenge with the system realization. Forced by recent development and capabilities of the fifth generation (5G) cellular system, the Tactile Internet will become a real. One way to overcome the 1 ms latency is to employ a centralized controller in the core of the network with a global knowledge of the system, together with the concept of network function virtualization (NFV). This is the idea behind the software defined networking (SDN). This paper introduces a Tactile Internet system structure, which employs SDN in the core of the cellular network and mobile edge computing (MEC) in multi-levels. The work is mainly concerned with the structure of the core network. The system is simulated over a reliable environment and introduces a round trip latency of orders of 1 ms. This can be interpreted by the reduction of intermediate nodes that are involved in the communication process.

28 August 2023 in Future Internet
Verified
Journal Article
Open access
PDF file
IKIrina Kochetkova
Irina Kochetkova
Anna KushchazliAnna Kushchazli
Anna Kushchazli
SBSofia Burtseva
Sofia Burtseva
Andrey K. GorsheninAndrey K. Gorshenin
Andrey K. Gorshenin
Fifth-generation (5G) networks require efficient radio resource management (RRM) which should dynamically adapt to the current network load and user needs. Monitoring and forecasting network performance requirements and metrics helps with this task. One of the parameters that highly influences radio resource management is the profile of user traffic generated by various 5G applications. Forecasting such mobile network profiles helps with numerous RRM tasks such as network slicing and load balancing. In this paper, we analyze a dataset from a mobile network operator in Portugal that contains information about volumes of traffic in download and upload directions in one-hour time slots. We apply two statistical models for forecasting download and upload traffic profiles, namely, seasonal autoregressive integrated moving average (SARIMA) and Holt-Winters models. We demonstrate that both models are suitable for forecasting mobile network traffic. Nevertheless, the SARIMA model is more appropriate for download traffic (e.g., MAPE [mean absolute percentage error] of 11.2% vs. 15% for Holt-Winters), while the Holt-Winters model is better suited for upload traffic (e.g., MAPE of 4.17% vs. 9.9% for SARIMA and Holt-Winters, respectively).

19 July 2017
Verified
Conference Paper
Open access
PDF file
Abdelhamied A. AteyaAbdelhamied A. Ateya
Abdelhamied A. Ateya
Ammar MuthannaAmmar Muthanna
Ammar Muthanna
IGIrina Gudkova
Irina Gudkova
AVAnastasia Vybornova
Anastasia Vybornova
Andrey KoucheryavyAndrey Koucheryavy
Andrey Koucheryavy

1 January 2014
Verified
Book Chapter
Closed access
PDF file
IGIrina Gudkova
Irina Gudkova
Konstantin SamouylovKonstantin Samouylov
Konstantin Samouylov
IBIvan Buturlin
Ivan Buturlin
VBVladimir Borodakiy
Vladimir Borodakiy
MGMikhail Gerasimenko
Mikhail Gerasimenko
SASergey Andreev
Sergey Andreev

19 May 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
VKValentina Klimenok
Valentina Klimenok
Alexander DudinAlexander Dudin
Alexander Dudin
DODudina Olga
Dudina Olga
IKIrina Kochetkova
Irina Kochetkova
The use of priorities allows us to improve the quality of service of inhomogeneous customers in telecommunication networks, inventory and health-care systems. An important modern direction of research is to analyze systems in which priority of a customer can be changed during his/her stay in the system. We considered a single-server queuing system with a finite buffer, where two types of customers arrive according to a batch marked Markov arrival process. Type 1 customers have non-preemptive priority over type 2 customers. Low priority customers are able to receive high priority after the random amount of time. For each non-priority customer accepted into the buffer, a timer, which counts a random time having a phase type distribution, is switched-on. When the timer expires, the customer with some probability leaves the system unserved and with the complimentary probability gains the high priority. Such a type of queues is typical in many health-care systems, contact centers, perishable inventory, etc. We describe the behavior of the system by a multi-dimensional continuous-time Markov chain and calculate a number of the stationary performance measures of the system including the various loss probabilities as well as the distribution function of the waiting time of priority customers. The illustrative numerical examples giving insights into the system behavior are presented.