• Volodymyr Popovskyy Doctor of Technical Science, Professor at Kharkiv National University of Radio Electronics, Head of the Department of Infocommunication Engineering at Kharkiv National University of Radio Electronics,
  • Kateryna Popovska Assistant Lecturer at the Department of Infocommunication Engineering in Kharkiv National University of Radio Electronics, Kharkiv, Ukraine,



peer-to-peer networks, mathematical models, files, performance, algorithm.


Background. Nowadays, file-sharing peer-to-peer (P2P) networks are becoming increasingly popular when providing video over the Internet. Successful reception of a given service is determined by how quickly and qualitatively the necessary content stored in the memory of the peers of this network is found. In structured systems a limited number of transitions are used to find the ordered file, however, for unstructured systems, where random search is used, the delay can be significant, especially when searching for rare files. At the same time, it is unstructured systems that can support complex requests with metainformation, which provides their priority development. There arises a question of how quickly the given file with a certain number of active peers can be obtained.
Objective. The aim of the paper is the analysis of the state of downloaded content on the nodes of unstructured P2P networks.
Methods. Synthesis of the mathematical model of video content replication taking into account the network load and performance analysis based on this model has been performed for the 3 most used algorithms: unified, proportional and “square root”. Numerical quantitative studies have been performed by means of calculation.
Results. A mathematical model that allows estimating the average number of attempts to replicate the ordered file taking into account the size of the network memory has been developed. The examples of the dependence of the
average file search size for different numbers of active peers have been obtained.
Conclusions. The mathematical model of video content replication necessary for the successful search of the requested file is obtained taking into account the network memory size determined by the number of active peers. The obtained dependence of the average number of request attempts when searching for the desired files for the three replication algorithms allows concluding that the “square root” algorithm is expedient.
Keywords: peer-to-peer networks; mathematical models; files; performance; algorithm.


Cisco Visual Netwroking Index; Forecast and Methodology, 2012-2017 Cisco Public, 2013.

Tarcoma S. Overlay Network Toward Information Networking – CRC Press, 2010.

Setton E., Girod B. Peer-to-Peer Video Streaming/Springer. – 2007. – 150 p.

Wehrle K., Gunes M., Gross J. Modeling and tools for Network simulation. Springer, Heidenberg, Dordrecht, London, Net York, 2010.

Дорт-Гольц А.А. Анализ функционирования наложенных сетей в сетях операторов. М. Электросвязь №3, 2014. Стр. 22-27.

Москалец Н.В., Поповская Е.О. Модели одноранговых пиринговых сетей для передачи потоков IPTV. Международный научно-

исследовательский журнал, ISSN 2303-9868, №4, (23) 2014, Часть 2. Стр. 46-50.

Адами Амину, Гайдамака Ю.В. Аппроксимация вероятностных характеристик модели сети Р2Р. Л.2013. Инф.упр. сети. стр.4-10.

Popovskij V., Barkalov A., Titarenko L. Control and Adaptation in Telecommunication Systems, Springer- Verlag Berlin Heidelberg, 2011