首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Stability of token passing rings
Authors:Leonidas Georgiadis  Wojciech Szpankowski
Institution:(1) High Performace Computing and Communication, IBM T.J. Watson Research Center, P.O. Box 704, 10598 Yorkton Heights, NY, USA;(2) Department of Computer Science, Purdue University, 47907 West Lafayette, IN, USA
Abstract:A sufficient stability condition for the standard token passing ring has been ldquoknownrdquo since the seminal paper by Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to the research community. In fact, Watson observed that in the performance evaluation of token passing rings, ldquoit is convenient to derive stability conditions ... (without proof)rdquo. Our intention is to fill this gap, and to provide a formal proof of thesufficient and necessary stability condition for the token passing ring. In this paper, we present the case when the arrival process to each queue is Poisson but service times and switchover times are generally distributed. We consider in depth a gatedl-limited (lle infin) service discipline for each station. We also indicate that the basic steps of our technique can be used to study the stability of some other multiqueue systems.This research was supported by NSF Grant CCR-8900305, and in part by AFOSR Grant 90-0107, and by Grant R01 LM05118 from the National Library of Medicine.
Keywords:Token passing rings  stability  substability  ergodicity  Markov chains  Loynes' scheme  stochastically dominant  Little's formula  regenerative processes
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号