Single Server Queues with Batch Poisson Input and Multiple Types of Outgoing Calls

2019 ◽  
pp. 177-187
Author(s):  
Anatoly Nazarov ◽  
Tuan Phung-Duc ◽  
Svetlana Paul ◽  
Olga Lizura
Keyword(s):  
Single Server ◽  
Single Server Queues ◽  
Poisson Input

Asymptotic transient behaviour of the bulk service queue

1963 ◽  
Vol 3 (4) ◽  
pp. 503-512 ◽  
Author(s):  
B. D. Craven
Keyword(s):  
Service Time ◽  
Single Server ◽  
Transient Behaviour ◽  
Single Server Queues ◽  
Poisson Input ◽  
Bulk Service ◽  
Service Times

Various authors have studied the transient behaviour of single-server queues. Notably, Takacs [13], [14] has analysed a queue with recurrent input and exponential service time distributions, Keilson and Kooharian [9], [10] and Finch [5] have considered a queue with general independent input and service times, Finch [6] has analysed a queue with non-recurrent input and Erlang service, and Jaiswal [8] has considered the bulk-service queue with Poisson input and Erlang service.

scholarly journals BOUNDS AND AN APPROXIMATION FOR SINGLE SERVER QUEUES

1983 ◽  
Vol 26 (2) ◽  
pp. 118-134 ◽  
Author(s):  
Jeyaveerasingam George Shanthikumar
Keyword(s):  
Single Server ◽  
Single Server Queues

Some perturbation results for the single-server queue with Poisson input

1965 ◽  
Vol 2 (2) ◽  
pp. 462-466 ◽  
Author(s):  
A. M. Hasofer
Keyword(s):  
Service Time ◽  
Single Server ◽  
Single Server Queue ◽  
Poisson Input ◽  
Server Queue ◽  
Image Position ◽  
General Service

In a previous paper [2] the author has studied the single-server queue with non-homogeneous Poisson input and general service time, with particular emphasis on the case when the parameter of the Poisson input is of the form

Convex ordering of the attained waiting times in single-server queues and related problems

1991 ◽  
Vol 28 (02) ◽  
pp. 433-445 ◽  
Author(s):  
Masakiyo Miyazawa ◽  
Genji Yamazaki
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Waiting Times ◽  
Service Discipline ◽  
Single Server ◽  
Waiting Time Distribution ◽  
Convex Order ◽  
Convex Ordering ◽  
Single Server Queues ◽  
Service Disciplines

The attained waiting time of customers in service of the G/G/1 queue is compared for various work-conserving service disciplines. It is proved that the attained waiting time distribution is minimized (maximized) in convex order when the discipline is FCFS (PR-LCFS). We apply the result to characterize finiteness of moments of the attained waiting time in the GI/GI/1 queue with an arbitrary work-conserving service discipline. In this discussion, some interesting relationships are obtained for a PR-LCFS queue.

Sign in / Sign up

Export Citation Format

Share Document