TY - GEN
T1 - The priority of inbound calls over outbound calls modeled as a discrete-time retrial/delay system
AU - Nobel, Rein
AU - Dekker, Maik
PY - 2017/1/1
Y1 - 2017/1/1
N2 - A one-server discrete-time queueing model is studied with two arrival streams. Both arrival streams are in batches and we distinguish between a stream of low-priority customers, who are put in a queue which is served on a first-come-first-served basis, and a stream of (primary) high-priority customers, who are served uninterruptedly when the batch of high-priority customers finds the server idle upon arrival. High-priority customers are treated as retrial customers, but once in the orbit they lose their high-priority status. The Late Arrival Setup is chosen with Delayed Access. The high-priority retrial customers can be interpreted as inbound calls, and the low-priority customers as outbound calls in a call-center. The joint steady-state distribution of the queue length of the low-priority customers and the orbit size of secondary retrial customers is studied using probability generating functions. Several performance measures will be calculated, such as the mean queue length of the low-priority customers and the orbit size of the secondary retrial customers.
AB - A one-server discrete-time queueing model is studied with two arrival streams. Both arrival streams are in batches and we distinguish between a stream of low-priority customers, who are put in a queue which is served on a first-come-first-served basis, and a stream of (primary) high-priority customers, who are served uninterruptedly when the batch of high-priority customers finds the server idle upon arrival. High-priority customers are treated as retrial customers, but once in the orbit they lose their high-priority status. The Late Arrival Setup is chosen with Delayed Access. The high-priority retrial customers can be interpreted as inbound calls, and the low-priority customers as outbound calls in a call-center. The joint steady-state distribution of the queue length of the low-priority customers and the orbit size of secondary retrial customers is studied using probability generating functions. Several performance measures will be calculated, such as the mean queue length of the low-priority customers and the orbit size of the secondary retrial customers.
KW - Discrete-time retrial queue
KW - Generating functions
KW - Inbound and outbound calls
KW - Priority customers
UR - http://www.scopus.com/inward/record.url?scp=85036467600&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85036467600&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-68520-5_13
DO - 10.1007/978-3-319-68520-5_13
M3 - Conference contribution
AN - SCOPUS:85036467600
SN - 9783319685199
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 199
EP - 216
BT - Queueing Theory and Network Applications - 12th International Conference, QTNA 2017, Proceedings
A2 - Yue, Wuyi
A2 - Li, Quan-Lin
A2 - Jin, Shunfu
A2 - Ma, Zhanyou
PB - Springer Verlag
T2 - 12th International Conference on Queueing Theory and Network Applications, QTNA 2017
Y2 - 21 August 2017 through 23 August 2017
ER -