Introduction

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, we develop queuing models for P2P service systems and a taxonomy for different variations of these queueing models. For several basic classes of these systems, we 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. Numerical experiments verify our results, and indicate that higher server dynamics lead to less time a job spends in the system on average.

Publications

• Taoyu LI, Minghua CHEN, Dah-Ming CHIU, Maoke CHEN, Queuing Models for Peer-to-peer Systems, In 8th International Workshop on Peer-to-Peer Systems (IPTPS '09), 2009. [PDF][HTML] [Slides(PPSX)]