Study Of Request Queue In P2P Networks System Based On The Queuing Theory

P2P is one of the most important upgrade for the network technology, with its help people can communicate with each other directly. And it makes communication on the internet easier and more direct. The network structure of P2P comes through three major network structures, including Centralized Peer-to-Peer, Distributed Peer-to-Peer, and Hybrid Peer-to-Peer.This paper firstly presents three Queuing Models of Multi-Service Window by combining popular Hybrid P2P Network Structure Model with Queuing Theory for the searching process. And according to the key indicators of these models, we give an analysis for the performance of the search queues which are caused by a large number of random search requests on the index nodes or search nodes. Based on the result of the analysises, we propose the priority model and two priority queue methods after altering three models. For the downloading process, along with analyzing the important parameters of Single-Service Window Queuing Model on the downloading queue, we can adjust the model to improve the performance of overall system and to avoid the serious drawbacks.Finally, the connection processes between request nodes and index nodes, search nodes and peer nodes are described. The details about the thinking of P2P file-sharing and two popular file-downloading methods (Web downloading and P2P downloading) are given as well. With the combination of two popular download methods, a new method is put forward to solve the problems of resource shortage and slow downloading speed.