Large Deviation Bounds for a Polling System with Two Queues and Multiple Servers

概要

論文の詳細を見る
In this paper, we present large deviation bounds for a discrete-time polling system consisting of two-par-allel queues and m servers. The arrival process in each queue is an arbitrary, and possibly correlated, stochastic process. Each server (serves) independently serves the two queues according to a Bernoulli service schedule. Using large deviation techniques, we analyze the tail behavior of the stationary distribution of the queue length processes, and derive upper and lower bounds of the buffer overflow probability for each queue. These results have important implications for traffic management of high-speed communication networks such as call admission, bandwidth allocation, and server control.
名古屋工業大学の論文
2004-03-31