Queuing Models for Peer-to-Peer Systems
Source: Chinese University of Hong Kong
Recent development of Peer-To-Peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems not studied before. In these new systems, both job and server arrive and depart randomly. The server dynamics may or may not correlate to the job dynamics. Motivated by these observations, the authors develop queuing models for P2P service systems and a taxonomy for different variations of these queueing models. For several basic classes of these systems, they show that they are stable, i.e. all arriving job will be served and cleared in finite time, if the average workload does not exceed the average system service capacity.