Multiserver queue with guard channel for priority and retrial customers (Q1788118)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiserver queue with guard channel for priority and retrial customers |
scientific article; zbMATH DE number 6948429
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiserver queue with guard channel for priority and retrial customers |
scientific article; zbMATH DE number 6948429 |
Statements
Multiserver queue with guard channel for priority and retrial customers (English)
0 references
8 October 2018
0 references
Summary: This paper considers a retrial queueing model where a group of guard channels is reserved for priority and retrial customers. Priority and normal customers arrive at the system according to two distinct Poisson processes. Priority customers are accepted if there is an idle channel upon arrival while normal customers are accepted if and only if the number of idle channels is larger than the number of guard channels. Blocked customers (priority or normal) join a virtual orbit and repeat their attempts in a later time. Customers from the orbit (retrial customers) are accepted if there is an idle channel available upon arrival. We formulate the queueing system using a level dependent quasi-birth-and-death (QBD) process. We obtain a Taylor series expansion for the nonzero elements of the rate matrices of the level dependent QBD process. Using the expansion results, we obtain an asymptotic upper bound for the joint stationary distribution of the number of busy channels and that of customers in the orbit. Furthermore, we develop an efficient numerical algorithm to calculate the joint stationary distribution.
0 references
retrial queueing model
0 references
quasi-birth-and-death process
0 references
guard channels
0 references
0 references
0 references
0 references
0 references
0 references