Research of Queuing Model Based on Request Queue in P2P Network System

With the rapid growth of P2P network, the resource searching and resource delivery are two crucial problems required to be solved in a P2P system. At the resource searching stage, a large number of random resource requests form a search request queue at the node. At the resource delivery stage, if the nodes cannot process new requests at a certain time, the queue of resource requests may be congested at the node. The behavior of each user making a search request is a random phenomenon, so it is necessary to use the knowledge of queuing theory to allocate the users who request different resources and manage these request queues to provide services efficiently, which are based on the hybrid P2P network model in this paper. Firstly, a two-dimensional Markov chain is constructed, and the steady state distribution of system is determined by using the method of matrix geometric solution. Secondly, the expressions of performance indexes, such as the probability that the local Peer Node (PN), the remote PN and Virtual Content Server (VCS) provide the users, are obtained, and the influence of different system parameters on the performance indexes are analyzed using the results of numerical calculations. Finally, in order to avoid congestion of the request queue, the social benefit function is defined, and the optimal user arrival rate of system is obtained.