期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2011
卷号：11
期号：5
页码：189-196
出版社：International Journal of Computer Science and Network Security
摘要：Queuing models for peer to peer system is an encouraging many research scholars to attempt the problems of the system avoid formulation of queue or minimize the waiting time. Many scholars have developed models where both job and server arrive and depart randomly. In this paper an attempt is made to study the stability of different queuing models. In this study the value of utilization factor will be always less than one. To prove that the stability of the system, Poisson arrivals, negative exponential service is assumed and use of Markov process to show how the system is stable and the policy of the system to put emphasis on first come first service(FCFS) is also discussed.
