On the Stability of Greedy Polling Systems with General Service Policies
暂无分享,去创建一个
[1] R. Schaβberger. Stability of Polling Networks with State-Dependent Server Routing , 1995 .
[2] John Lamperti,et al. Criteria for the recurrence or transience of stochastic process. I , 1960 .
[3] Jean-Marc Lasgouttes,et al. A State-Dependent Polling Model with Markovian Routing , 1995 .
[4] modelsChristine Fricker,et al. Monotonicity and stability of periodic polling , 1994 .
[5] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[6] Christine Fricker,et al. Monotonicity and stability of periodic polling models , 1994, Queueing Syst. Theory Appl..
[7] Serguei Foss,et al. Stability of polling systems with exhaustive service policies and state-dependent routing , 1996 .
[8] S. Foss,et al. Ergodicity of queuing networks , 1991 .
[9] Guy Fayolle,et al. On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I , 1989, Queueing Syst. Theory Appl..
[10] Hideaki Takagi,et al. Stochastic Analysis of Computer and Communication Systems , 1990 .