scholarly journals Note—A Single Server Queue with Constant Service Time and Restricted Accessibility

1979 ◽  
Vol 25 (2) ◽  
pp. 205-208 ◽  
Author(s):  
Per Hokstad
Keyword(s):  
Service Time ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue

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

A note on the queueing systems GI/D/1 and D/G/1

1970 ◽  
Vol 7 (2) ◽  
pp. 465-468 ◽  
Author(s):  
A. G. Pakes
Keyword(s):  
Service Time ◽  
Special Form ◽  
Arrival Time ◽  
Queueing Systems ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue ◽  
Image Position ◽  
The Right ◽  
Similar Evaluation

In this note we adopt the notation and terminology of Kingman (1966) without further comment. For the general single server queue one has For the queueing systems GI/D/1 and D/G/1 we shall show that it is possible to make use of the special form of the service time and inter-arrival time distributions, respectively, to evaluate the right hand side of (1). A similar evaluation applies to the limiting distribution when it exists. The results obtained could also be obtained from those of Finch (1969) and Henderson and Finch (1970) by using suitable limiting arguments.

On the integral of the workload process of the single server queue

2003 ◽  
Vol 40 (01) ◽  
pp. 200-225 ◽  
Author(s):  
A. A. Borovkov ◽  
O. J. Boxma ◽  
Z. Palmowski
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Busy Period ◽  
Single Server ◽  
Service Time Distribution ◽  
Whittaker Functions ◽  
Single Server Queue ◽  
Stieltjes Transform ◽  
Server Queue ◽  
Sequential Approximation

This paper is devoted to a study of the integral of the workload process of the single server queue, in particular during one busy period. Firstly, we find asymptotics of the area 𝒜 swept under the workload process W(t) during the busy period when the service time distribution has a regularly varying tail. We also investigate the case of a light-tailed service time distribution. Secondly, we consider the problem of obtaining an explicit expression for the distribution of 𝒜. In the general GI/G/1 case, we use a sequential approximation to find the Laplace—Stieltjes transform of 𝒜. In the M/M/1 case, this transform is obtained explicitly in terms of Whittaker functions. Thirdly, we consider moments of 𝒜 in the GI/G/1 queue. Finally, we show asymptotic normality of .

scholarly journals An M/G/1 queue with multiple types of feedback and gated vacations

1997 ◽  
Vol 34 (03) ◽  
pp. 773-784 ◽  
Author(s):  
Onno J. Boxma ◽  
Uri Yechiali
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Queue Length ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Waiting Time Distribution ◽  
Single Server Queue ◽  
Server Queue ◽  
Poisson Arrivals

This paper considers a single-server queue with Poisson arrivals and multiple customer feedbacks. If the first service attempt of a newly arriving customer is not successful, he returns to the end of the queue for another service attempt, with a different service time distribution. He keeps trying in this manner (as an ‘old' customer) until his service is successful. The server operates according to the ‘gated vacation' strategy; when it returns from a vacation to find K (new and old) customers, it renders a single service attempt to each of them and takes another vacation, etc. We study the joint queue length process of new and old customers, as well as the waiting time distribution of customers. Some extensions are also discussed.

scholarly journals Stationary queue length of a single-server queue with negative arrivals and nonexponential service time distributions

2018 ◽  
Vol 189 ◽  
pp. 02006 ◽  
Author(s):  
S K Koh ◽  
C H Chin ◽  
Y F Tan ◽  
L E Teoh ◽  
A H Pooi ◽  
...  
Keyword(s):  
Service Time ◽  
Queue Length ◽  
Queueing Systems ◽  
Length Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Single Server Queue ◽  
Negative Customers ◽  
Stationary Queue Length ◽  
Server Queue

In this paper, a single-server queue with negative customers is considered. The arrival of a negative customer will remove one positive customer that is being served, if any is present. An alternative approach will be introduced to derive a set of equations which will be solved to obtain the stationary queue length distribution. We assume that the service time distribution tends to a constant asymptotic rate when time t goes to infinity. This assumption will allow for finding the stationary queue length of queueing systems with non-exponential service time distributions. Numerical examples for gamma distributed service time with fractional value of shape parameter will be presented in which the steady-state distribution of queue length with such service time distributions may not be easily computed by most of the existing analytical methods.

Weak convergence theorems for priority queues: preemptive-resume discipline

1971 ◽  
Vol 8 (1) ◽  
pp. 74-94 ◽  
Author(s):  
Ward Whitt
Keyword(s):  
Weak Convergence ◽  
Service Time ◽  
Priority Queues ◽  
Single Server ◽  
Single Server Queue ◽  
Convergence Theorems ◽  
Lower Priority ◽  
Preemptive Resume ◽  
Server Queue ◽  
Customer Returns

We shall consider a single-server queue with r priority classes of customers and a preemptive-resume discipline. In this system customers are served in order of their priority while customers of the same priority are served in order of their arrival. Higher priority customers, immediately upon arrival, replace lower priority customers at the server, while customers displaced in this way return to the server before any other customers of the same priority receive service. When a displaced customer returns to the server, his remaining service time is the uncompleted portion of his original service time (cf. Jaiswal (1968)).

On the integral of the workload process of the single server queue

2003 ◽  
Vol 40 (1) ◽  
pp. 200-225 ◽  
Author(s):  
A. A. Borovkov ◽  
O. J. Boxma ◽  
Z. Palmowski
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Busy Period ◽  
Single Server ◽  
Service Time Distribution ◽  
Whittaker Functions ◽  
Single Server Queue ◽  
Stieltjes Transform ◽  
Server Queue ◽  
Sequential Approximation

This paper is devoted to a study of the integral of the workload process of the single server queue, in particular during one busy period. Firstly, we find asymptotics of the area 𝒜 swept under the workload process W(t) during the busy period when the service time distribution has a regularly varying tail. We also investigate the case of a light-tailed service time distribution. Secondly, we consider the problem of obtaining an explicit expression for the distribution of 𝒜. In the general GI/G/1 case, we use a sequential approximation to find the Laplace—Stieltjes transform of 𝒜. In the M/M/1 case, this transform is obtained explicitly in terms of Whittaker functions. Thirdly, we consider moments of 𝒜 in the GI/G/1 queue. Finally, we show asymptotic normality of .

Weak convergence theorems for priority queues: preemptive-resume discipline

1971 ◽  
Vol 8 (01) ◽  
pp. 74-94 ◽  
Author(s):  
Ward Whitt
Keyword(s):  
Weak Convergence ◽  
Service Time ◽  
Priority Queues ◽  
Single Server ◽  
Single Server Queue ◽  
Convergence Theorems ◽  
Lower Priority ◽  
Preemptive Resume ◽  
Server Queue ◽  
Customer Returns

We shall consider a single-server queue with r priority classes of customers and a preemptive-resume discipline. In this system customers are served in order of their priority while customers of the same priority are served in order of their arrival. Higher priority customers, immediately upon arrival, replace lower priority customers at the server, while customers displaced in this way return to the server before any other customers of the same priority receive service. When a displaced customer returns to the server, his remaining service time is the uncompleted portion of his original service time (cf. Jaiswal (1968)).

Sign in / Sign up

Export Citation Format

Share Document