The GI/G/1 queue with uniformly limited virtual waiting times; the finite dam

1980 ◽  
Vol 12 (2) ◽  
pp. 501-516 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Water Supply ◽  
Analytical Method ◽  
Busy Period ◽  
Queueing System ◽  
Waiting Times ◽  
Fixed Interval ◽  
Finite Capacity ◽  
Queueing Process ◽  
Finite Dam

This paper studies the GI/G/1 queueing system in which no customer can stay longer than a fixed interval D. This is also a model for the dam with finite capacity, instantaneous water supply and constant release rule. Using analytical method together with the property that the queueing process ‘starts anew’ probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary results for the system.

The GI/G/1 queue with uniformly limited virtual waiting times; the finite dam

1980 ◽  
Vol 12 (02) ◽  
pp. 501-516 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Water Supply ◽  
Analytical Method ◽  
Busy Period ◽  
Queueing System ◽  
Waiting Times ◽  
Fixed Interval ◽  
Finite Capacity ◽  
Queueing Process ◽  
Finite Dam

This paper studies the GI/G/1 queueing system in which no customer can stay longer than a fixed interval D. This is also a model for the dam with finite capacity, instantaneous water supply and constant release rule. Using analytical method together with the property that the queueing process ‘starts anew’ probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary results for the system.

scholarly journals M/G/1 vacation model with limited service discipline and hybrid switching-on policy

1997 ◽  
Vol 3 (3) ◽  
pp. 243-253
Author(s):  
Alexander V. Babitsky
Keyword(s):  
Generating Function ◽  
Busy Period ◽  
Optimization Problem ◽  
Queueing System ◽  
Service Discipline ◽  
Multiple Vacations ◽  
Queueing Process ◽  
Vacation Model ◽  
Hybrid Switching ◽  
Limited Service

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty orKcustomers were served during a busy period. The server idles until it finds at leastNwaiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.

A solvable model for a finite-capacity queueing system

1985 ◽  
Vol 22 (4) ◽  
pp. 903-911 ◽  
Author(s):  
V. Giorno ◽  
C. Negri ◽  
A. G. Nobile
Keyword(s):  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Solvable Model ◽  
Probability Density Functions ◽  
Single Server ◽  
Finite Capacity ◽  
System Service ◽  
Transient Probabilities ◽  
Number Of Customers

Single–server–single-queue–FIFO-discipline queueing systems are considered in which at most a finite number of customers N can be present in the system. Service and arrival rates are taken to be dependent upon that state of the system. Interarrival intervals, service intervals, waiting times and busy periods are studied, and the results obtained are used to investigate the features of a special queueing model characterized by parameters (λ (Ν –n), μn). This model retains the qualitative features of the C-model proposed by Conolly [2] and Chan and Conolly [1]. However, quite unlike the latter, it also leads to closed-form expressions for the transient probabilities, the interarrival and service probability density functions and their moments, as well as the effective interarrival and service densities and their moments. Finally, some computational results are given to compare the model discussed in this paper with the C-model.

A solvable model for a finite-capacity queueing system

1985 ◽  
Vol 22 (04) ◽  
pp. 903-911 ◽  
Author(s):  
V. Giorno ◽  
C. Negri ◽  
A. G. Nobile
Keyword(s):  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Solvable Model ◽  
Probability Density Functions ◽  
Single Server ◽  
Finite Capacity ◽  
System Service ◽  
Transient Probabilities ◽  
Number Of Customers

Single–server–single-queue–FIFO-discipline queueing systems are considered in which at most a finite number of customers N can be present in the system. Service and arrival rates are taken to be dependent upon that state of the system. Interarrival intervals, service intervals, waiting times and busy periods are studied, and the results obtained are used to investigate the features of a special queueing model characterized by parameters (λ (Ν –n), μn). This model retains the qualitative features of the C-model proposed by Conolly [2] and Chan and Conolly [1]. However, quite unlike the latter, it also leads to closed-form expressions for the transient probabilities, the interarrival and service probability density functions and their moments, as well as the effective interarrival and service densities and their moments. Finally, some computational results are given to compare the model discussed in this paper with the C-model.

A queueing process with the possibility of customers becoming servers

1991 ◽  
Vol 23 (4) ◽  
pp. 957-971
Author(s):  
Wen-Jang Huang ◽  
Prem S. Puri
Keyword(s):  
Asymptotic Behavior ◽  
Joint Distribution ◽  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Queue Size ◽  
Queueing Process

A new queueing system called G/G/{p} is introduced and studied. In this queue, unlike standard queues, the customers after being served are allowed to become servers themselves. More precisely, at the completion of his service each customer is assumed to become a server with probability p or leave the system with probability 1 – p, independent of everything else. We make some comparisons about the waiting times and queue sizes among different queueing systems. We also study the joint distribution of the queue size, the number of servers and the number of departures at time t for exact and asymptotic behavior for large t.

The total waiting time in a busy period of a stable single-server queue, I.

1969 ◽  
Vol 6 (03) ◽  
pp. 550-564 ◽  
Author(s):  
D. J. Daley
Keyword(s):  
Waiting Time ◽  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Road Traffic ◽  
Waiting Times ◽  
Random Variable ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue

A quantity of particular interest in the study of (road) traffic jams is the total waiting time X of all vehicles involved in a given hold-up (Gaver (1969): see note following (2.3) below and the first paragraph of Section 5). With certain assumptions on the process this random variable X is the same as the sum of waiting times of customers in a busy period of a GI/G/1 queueing system, and it is the object of this paper and its sequel to study the random variable in the queueing theory context.

A queueing process with the possibility of customers becoming servers

1991 ◽  
Vol 23 (04) ◽  
pp. 957-971
Author(s):  
Wen-Jang Huang ◽  
Prem S. Puri
Keyword(s):  
Asymptotic Behavior ◽  
Joint Distribution ◽  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Queue Size ◽  
Queueing Process

A new queueing system called G/G/{p} is introduced and studied. In this queue, unlike standard queues, the customers after being served are allowed to become servers themselves. More precisely, at the completion of his service each customer is assumed to become a server with probability p or leave the system with probability 1 – p, independent of everything else. We make some comparisons about the waiting times and queue sizes among different queueing systems. We also study the joint distribution of the queue size, the number of servers and the number of departures at time t for exact and asymptotic behavior for large t.

The total waiting time in a busy period of a stable single-server queue, I.

1969 ◽  
Vol 6 (3) ◽  
pp. 550-564 ◽  
Author(s):  
D. J. Daley
Keyword(s):  
Waiting Time ◽  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Road Traffic ◽  
Waiting Times ◽  
Random Variable ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue

A quantity of particular interest in the study of (road) traffic jams is the total waiting time X of all vehicles involved in a given hold-up (Gaver (1969): see note following (2.3) below and the first paragraph of Section 5). With certain assumptions on the process this random variable X is the same as the sum of waiting times of customers in a busy period of a GI/G/1 queueing system, and it is the object of this paper and its sequel to study the random variable in the queueing theory context.

scholarly journals Single server queues with modified service mechanisms

1962 ◽  
Vol 2 (4) ◽  
pp. 499-507 ◽  
Author(s):  
G. F. Yeo
Keyword(s):  
Time Distribution ◽  
Busy Period ◽  
Queueing System ◽  
Probability Generating Function ◽  
Single Server ◽  
Waiting Time Distribution ◽  
Period Distribution ◽  
Time Dependent Problem ◽  
Stationary Waiting Time ◽  
Special Case

SummaryThis paper considers a generalisation of the queueing system M/G/I, where customers arriving at empty and non-empty queues have different service time distributions. The characteristic function (c.f.) of the stationary waiting time distribution and the probability generating function (p.g.f.) of the queue size are obtained. The busy period distribution is found; the results are generalised to an Erlangian inter-arrival distribution; the time-dependent problem is considered, and finally a special case of server absenteeism is discussed.

Sign in / Sign up

Export Citation Format

Share Document