Inequalities for queues with dependent interarrival and service times

1975 ◽  
Vol 12 (03) ◽  
pp. 653-656 ◽  
Author(s):  
G. L. O'Brien
Keyword(s):  
Conditional Distribution ◽  
Waiting Times ◽  
Distribution Functions ◽  
Sample Paths ◽  
Service Times

Consider two queues with k servers. Inequalities between their sample paths and thence between the distribution functions of their waiting times and queue sizes are deduced from inequalities between the conditional distribution functions, given previous interarrival and service times, for the two queues.

Inequalities for queues with dependent interarrival and service times

1975 ◽  
Vol 12 (3) ◽  
pp. 653-656 ◽  
Author(s):  
G. L. O'Brien
Keyword(s):  
Conditional Distribution ◽  
Waiting Times ◽  
Distribution Functions ◽  
Sample Paths ◽  
Service Times

Consider two queues with k servers. Inequalities between their sample paths and thence between the distribution functions of their waiting times and queue sizes are deduced from inequalities between the conditional distribution functions, given previous interarrival and service times, for the two queues.

On a tandem queueing model with identical service times at both counters, I

1979 ◽  
Vol 11 (3) ◽  
pp. 616-643 ◽  
Author(s):  
O. J. Boxma
Keyword(s):  
Waiting Times ◽  
Sufficient Conditions ◽  
Complete Analysis ◽  
Single Server ◽  
Stationary Distributions ◽  
In Series ◽  
Queues In Series ◽  
Service Times ◽  
Necessary And Sufficient ◽  
Insight Into

This paper considers a queueing system consisting of two single-server queues in series, in which the service times of an arbitrary customer at both queues are identical. Customers arrive at the first queue according to a Poisson process.Of this model, which is of importance in modern network design, a rather complete analysis will be given. The results include necessary and sufficient conditions for stationarity of the tandem system, expressions for the joint stationary distributions of the actual waiting times at both queues and of the virtual waiting times at both queues, and explicit expressions (i.e., not in transform form) for the stationary distributions of the sojourn times and of the actual and virtual waiting times at the second queue.In Part II (pp. 644–659) these results will be used to obtain asymptotic and numerical results, which will provide more insight into the general phenomenon of tandem queueing with correlated service times at the consecutive queues.

scholarly journals Assessment of patients waiting and service times in the ophthalmology clinic of a public tertiary hospital in Nigeria

2020 ◽  
Vol 54 (4) ◽  
pp. 231-237
Author(s):  
Lateefat B. Olokoba ◽  
Kabir A. Durowade ◽  
Feyi G. Adepoju ◽  
Abdulfatai B. Olokoba
Keyword(s):  
Waiting Time ◽  
Waiting Times ◽  
Sampling Technique ◽  
Tertiary Hospital ◽  
Cross Sectional Study ◽  
Ethical Review ◽  
Cross Sectional ◽  
Arrival Times ◽  
The Mean ◽  
Service Times

Introduction: Long waiting time in the out-patient clinic is a major cause of dissatisfaction in Eye care services. This study aimed to assess patients’ waiting and service times in the out-patient Ophthalmology clinic of UITH. Methods: This was a descriptive cross-sectional study conducted in March and April 2019. A multi-staged sampling technique was used. A timing chart was used to record the time in and out of each service station. An experience based exit survey form was used to assess patients’ experience at the clinic. The frequency and mean of variables were generated. Student t-test and Pearson’s correlation were used to establish the association and relationship between the total clinic, service, waiting, and clinic arrival times. Ethical approval was granted by the Ethical Review Board of the UITH. Result: Two hundred and twenty-six patients were sampled. The mean total waiting time was 180.3± 84.3 minutes, while the mean total service time was 63.3±52.0 minutes. Patient’s average total clinic time was 243.7±93.6 minutes. Patients’ total clinic time was determined by the patients’ clinic status and clinic arrival time. Majority of the patients (46.5%) described the time spent in the clinic as long but more than half (53.0%) expressed satisfaction at the total time spent at the clinic. Conclusion: Patients’ clinic and waiting times were long, however, patients expressed satisfaction with the clinic times.

On the comparison of waiting times in tandem queues

1981 ◽  
Vol 18 (03) ◽  
pp. 707-714 ◽  
Author(s):  
Shun-Chen Niu
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Waiting Times ◽  
Distribution Functions ◽  
Partial Ordering ◽  
Tandem Queues ◽  
Order Relations ◽  
Service Distribution ◽  
In Series ◽  
Definition Of

Using a definition of partial ordering of distribution functions, it is proven that for a tandem queueing system with many stations in series, where each station can have either one server with an arbitrary service distribution or a number of constant servers in parallel, the expected total waiting time in system of every customer decreases as the interarrival and service distributions becomes smaller with respect to that ordering. Some stronger conclusions are also given under stronger order relations. Using these results, bounds for the expected total waiting time in system are then readily obtained for wide classes of tandem queues.

scholarly journals Multiperiod conditional distribution functions for conditionally normal GARCH(1, 1) models

2005 ◽  
Vol 42 (02) ◽  
pp. 426-445
Author(s):  
Raymond Brummelhuis ◽  
Dominique Guégan
Keyword(s):  
Conditional Probability ◽  
Conditional Distribution ◽  
Probability Distributions ◽  
Random Variables ◽  
Distribution Functions ◽  
Tail Behavior ◽  
Asymptotic Tail

We study the asymptotic tail behavior of the conditional probability distributions of r t+k and r t+1+⋯+r t+k when (r t ) t∈ℕ is a GARCH(1, 1) process. As an application, we examine the relation between the extreme lower quantiles of these random variables.

scholarly journals Cyclic queueing networks with subexponential service times

2004 ◽  
Vol 41 (03) ◽  
pp. 791-801
Author(s):  
H. Ayhan ◽  
Z. Palmowski ◽  
S. Schlegel
Keyword(s):  
Queueing Networks ◽  
Time Distribution ◽  
Waiting Times ◽  
Queueing Network ◽  
Service Time Distribution ◽  
Tail Behavior ◽  
Cycle Times ◽  
General Service Times ◽  
Service Times ◽  
General Service

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

scholarly journals Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing

2010 ◽  
Vol 42 (01) ◽  
pp. 246-267 ◽  
Author(s):  
Andreas Brandt ◽  
Manfred Brandt
Keyword(s):  
Waiting Times ◽  
The State ◽  
Single Server ◽  
Processor Sharing ◽  
Actual Number ◽  
Service Capacity ◽  
State Dependent ◽  
Poisson Arrivals ◽  
Service Times ◽  
The Given

We consider a system with Poisson arrivals and independent and identically distributed service times, where requests in the system are served according to the state-dependent (Cohen's generalized) processor-sharing discipline, where each request receives a service capacity that depends on the actual number of requests in the system. For this system, we derive expressions as well as tight insensitive upper bounds for the moments of the conditional sojourn time of a request with given required service time. The bounds generalize and extend corresponding results, recently given for the single-server processor-sharing system in Cheung et al. (2006) and for the state-dependent processor-sharing system with exponential service times by the authors (2008). Analogous results hold for the waiting times. Numerical examples for the M/M/m-PS and M/D/m-PS systems illustrate the given bounds.

scholarly journals On the rate of convergence of waiting times

1965 ◽  
Vol 5 (3) ◽  
pp. 365-373 ◽  
Author(s):  
C. K. Cheong ◽  
C. R. Heathcote
Keyword(s):  
Distribution Function ◽  
Rate Of Convergence ◽  
Waiting Times ◽  
Distribution Functions ◽  
Initial Condition ◽  
Hopf Equation ◽  
Unknown Distribution ◽  
Image Position

Let K(y) be a known distribution function on (−∞, ∞) and let {Fn(y), n = 0, 1,…} be a sequence of unknown distribution functions related by subject to the initial condition If the sequence {Fn(y)} converges to a distribution function F(y) then F(y) satisfies the Wiener-Hopf equation

scholarly journals Some performance measures for vacation models with a batch Markovian arrival process

1994 ◽  
Vol 7 (2) ◽  
pp. 111-124 ◽  
Author(s):  
Sadrac K. Matendo
Keyword(s):  
Performance Measures ◽  
Waiting Times ◽  
Distribution Functions ◽  
Markovian Arrival Process ◽  
Arrival Process ◽  
Service Discipline ◽  
Renewal Processes ◽  
Single Server ◽  
Batch Markovian Arrival Process ◽  
Interarrival Times

We consider a single server infinite capacity queueing system, where the arrival process is a batch Markovian arrival process (BMAP). Particular BMAPs are the batch Poisson arrival process, the Markovian arrival process (MAP), many batch arrival processes with correlated interarrival times and batch sizes, and superpositions of these processes. We note that the MAP includes phase-type (PH) renewal processes and non-renewal processes such as the Markov modulated Poisson process (MMPP).The server applies Kella's vacation scheme, i.e., a vacation policy where the decision of whether to take a new vacation or not, when the system is empty, depends on the number of vacations already taken in the current inactive phase. This exhaustive service discipline includes the single vacation T-policy, T(SV), and the multiple vacation T-policy, T(MV). The service times are i.i.d. random variables, independent of the interarrival times and the vacation durations. Some important performance measures such as the distribution functions and means of the virtual and the actual waiting times are given. Finally, a numerical example is presented.

Sign in / Sign up

Export Citation Format

Share Document