Informatika i Ee Primeneniya [Informatics and its Applications]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Informatika i Ee Primeneniya [Informatics and its Applications], 2020, Volume 14, Issue 3, Pages 94–100
DOI: https://doi.org/10.14357/19922264200314
(Mi ia685)
 

This article is cited in 3 scientific papers (total in 3 papers)

Analysis of the network slicing mechanisms with guaranteed allocated resources for various traffic types

K. A. Ageeva, E. S. Sopinab, N. V. Yarkinaa, K. E. Samouylovab, S. Ya. Shorginb

a Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
b Institute of Informatics Problems, Federal Research Center “Computer Sciences and Control” of the Russian Academy of Sciences; 44-2 Vavilov Str., Moscow 119133, Russian Federation
Full-text PDF (436 kB) Citations (3)
References:
Abstract: Network slicing is one of the key capabilities of modern networks, allowing several virtual mobile operators to use the physical resources of one base station. This allows operators and resource owners (tenants) to lease and manage several dedicated logical networks with specific functionality working on top of a common infrastructure. Each of these logical networks is called a network slice and can be adapted to provide certain system behavior to maintain a specified level of quality of service indicators. The paper describes the developed mathematical framework of the network slicing mechanisms and analyzes it by means of extensive simulations.
Keywords: simulation modeling, queuing system, limited resources, network slicing.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation
Russian Foundation for Basic Research 19-07-00933
19-37-90147
The reported study was funded by the “RUDN University Program 5-100” and in part by RFBR, projects Nos. 19-07-00933 and 19-37-90147.
Received: 15.07.2020
Document Type: Article
Language: Russian
Citation: K. A. Ageev, E. S. Sopin, N. V. Yarkina, K. E. Samouylov, S. Ya. Shorgin, “Analysis of the network slicing mechanisms with guaranteed allocated resources for various traffic types”, Inform. Primen., 14:3 (2020), 94–100
Citation in format AMSBIB
\Bibitem{AgeSopYar20}
\by K.~A.~Ageev, E.~S.~Sopin, N.~V.~Yarkina, K.~E.~Samouylov, S.~Ya.~Shorgin
\paper Analysis of~the~network slicing mechanisms with~guaranteed allocated resources for~various traffic types
\jour Inform. Primen.
\yr 2020
\vol 14
\issue 3
\pages 94--100
\mathnet{http://mi.mathnet.ru/ia685}
\crossref{https://doi.org/10.14357/19922264200314}
Linking options:
  • https://www.mathnet.ru/eng/ia685
  • https://www.mathnet.ru/eng/ia/v14/i3/p94
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024