A Unified Analysis to the Queue Length Distributions in M^x(κ)/G/1/N and GI/M^Y(κ)/1/N Queues

スポンサーリンク

概要

• 論文の詳細を見る

• We study an efficient iterative algorithm for computing the stationary distributions in M^X/G/1/N queues with arbitrary state-dependent arrivals, that is, M^X(κ)/G/1/N queues. M^X(κ)/G/1/N queues include the well studied special cases, such as PBAS (partially batch acceptance strategy) M^X/G/1/N queues and WBAS (whole batch acceptance strategy) M^X/G/1/N queues. We only require the Laplace-Stieltjes transform of the service time distribution. Furthermore, we can obtain the algorithm for computing the stationary queue length distributions in GI/M^Y/1/N queues with state-dependent services, or GI/M^Y(κ)/1/N queues by using a relationship between the stationary queue length distributions in GI/M^Y(κ)/1/N and M^X(κ)/G/1/N+1 queues.

• 横浜国立大学の論文

著者

• 馬場 裕

  Department Of Mathematics Faculty Of Education Yokohama National University

• 馬場 裕

  Department of Mathematics, Faculty of Education, Yokohama National University

関連論文

• Symbolic Calculation of Moments for an M^X/G/1 Queue
• A Unified Analysis to the Queue Length Distributions in M^x(κ)/G/1/N and GI/M^Y(κ)/1/N Queues

スポンサーリンク