Analysis of Content Replication Mechanism in Random Search in Peer-to-Peer Networks

Abstract

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.

An Agent-Based Model of Task-Allocation and Resource-Sharing for Social Internet of Things

“…Computer networks allow computers/devices to exchange data [18]. In the past, resources would be placed on a centrally-managed server, accessible by the client machines, whereas, P2P architecture allows machines to share their own resources in the network such as file storage, processing power, and peripherals with another machine connected to the same network with or without any dedicated server [19,20]. Thus, a machine works both as a server as well as a client in P2P networks.…”

A Simulation Model Demonstrating the Impact of Social Aspects on Social Internet of Things

“…In contrast, P2P technology allows client machines on a network to share their own resources (file store, processing power, and peripherals.) with other network-connected machines with or without involvement of any centralize server [11]. Thus, it enables machines to act as a client as well as server at the same time.…”