Statistical Testing of the Hypothesis that the Number of Customers in the G I / G / ∞ Queueing System Has an Asymptotically Normal Distribution in Heavy Traffic

2017 ◽  
Vol 53 (3) ◽  
pp. 450-455
Author(s):  
I. N. Kuznetsov
Keyword(s):  
Normal Distribution ◽  
Queueing System ◽  
Heavy Traffic ◽  
Statistical Testing ◽  
Asymptotically Normal ◽  
Number Of Customers

On berry–esseen rate for queue length of the GI/G/K system in heavy traffic

1988 ◽  
Vol 25 (03) ◽  
pp. 596-611
Author(s):  
Xing Jin
Keyword(s):  
Limit Theorem ◽  
Waiting Time ◽  
Queue Length ◽  
Queueing System ◽  
Heavy Traffic ◽  
Traffic Intensity ◽  
Main Method ◽  
Number Of Customers

This paper provides Berry–Esseen rate of limit theorem concerning the number of customers in a GI/G/K queueing system observed at arrival epochs for traffic intensity ρ > 1. The main method employed involves establishing several equalities about waiting time and queue length.

On berry–esseen rate for queue length of the GI/G/K system in heavy traffic

1988 ◽  
Vol 25 (3) ◽  
pp. 596-611 ◽  
Author(s):  
Xing Jin
Keyword(s):  
Limit Theorem ◽  
Waiting Time ◽  
Queue Length ◽  
Queueing System ◽  
Heavy Traffic ◽  
Traffic Intensity ◽  
Main Method ◽  
Number Of Customers

This paper provides Berry–Esseen rate of limit theorem concerning the number of customers in a GI/G/K queueing system observed at arrival epochs for traffic intensity ρ > 1. The main method employed involves establishing several equalities about waiting time and queue length.

On a Markovian queue with weakly correlated interarrival times

1981 ◽  
Vol 18 (01) ◽  
pp. 190-203 ◽  
Author(s):  
Guy Latouche
Keyword(s):  
Time Distribution ◽  
Queueing System ◽  
Interarrival Time ◽  
Probability Vector ◽  
Common Value ◽  
Markovian Queue ◽  
The Stability ◽  
Number Of Customers ◽  
Stationary Probabilities ◽  
Stationary Probability Vector

A queueing system with exponential service and correlated arrivals is analysed. Each interarrival time is exponentially distributed. The parameter of the interarrival time distribution depends on the parameter for the preceding arrival, according to a Markov chain. The parameters of the interarrival time distributions are chosen to be equal to a common value plus a factor ofε, where ε is a small number. Successive arrivals are then weakly correlated. The stability condition is found and it is shown that the system has a stationary probability vector of matrix-geometric form. Furthermore, it is shown that the stationary probabilities for the number of customers in the system, are analytic functions ofε, for sufficiently smallε, and depend more on the variability in the interarrival time distribution, than on the correlations.

scholarly journals Sojourn Times in A Queueing System with Breakdowns and General Retrial Times

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2882
Author(s):  
Ivan Atencia ◽  
José Luis Galán-García
Keyword(s):  
Steady State ◽  
Discrete Time ◽  
Queueing System ◽  
Retrial Queue ◽  
Stochastic Decomposition ◽  
Discrete Time System ◽  
Main Research ◽  
Extensive Analysis ◽  
Complete Study ◽  
Number Of Customers

This paper centers on a discrete-time retrial queue where the server experiences breakdowns and repairs when arriving customers may opt to follow a discipline of a last-come, first-served (LCFS)-type or to join the orbit. We focused on the extensive analysis of the system, and we obtained the stationary distributions of the number of customers in the orbit and in the system by applying the generation function (GF). We provide the stochastic decomposition law and the application bounds for the proximity between the steady-state distributions for the queueing system under consideration and its corresponding standard system. We developed recursive formulae aimed at the calculation of the steady-state of the orbit and the system. We proved that our discrete-time system approximates M/G/1 with breakdowns and repairs. We analyzed the busy period of an auxiliary system, the objective of which was to study the customer’s delay. The stationary distribution of a customer’s sojourn in the orbit and in the system was the object of a thorough and complete study. Finally, we provide numerical examples that outline the effect of the parameters on several performance characteristics and a conclusions section resuming the main research contributions of the paper.

scholarly journals Better Coverage Intervals for Estimators from a Complex Sample Survey

2020 ◽  
Author(s):  
Phillip S. Kott
Keyword(s):  
Normal Distribution ◽  
Parameter Estimate ◽  
Regression Coefficients ◽  
Sample Survey ◽  
Complex Survey ◽  
Asymptotically Normal ◽  
Complex Survey Data ◽  
Complex Sample ◽  
Chi Squared ◽  
Coverage Interval

Coverage intervals for a parameter estimate computed using complex survey data are often constructed by assuming the parameter estimate has an asymptotically normal distribution and the measure of the estimator’s variance is roughly chi-squared. The size of the sample and the nature of the parameter being estimated render this conventional “Wald” methodology dubious in many applications. I developed a revised method of coverage-interval construction that “speeds up the asymptotics” by incorporating an estimated measure of skewness. I discuss how skewness-adjusted intervals can be computed for ratios, differences between domain means, and regression coefficients.

Optimal Thresholds of an Infinite Buffer Discrete-Time Two-Server System with Triadic Policy

2011 ◽  
Vol 2 (4) ◽  
pp. 75-88
Author(s):  
Veena Goswami ◽  
G. B. Mund
Keyword(s):  
Discrete Time ◽  
Queueing System ◽  
Minimum Cost ◽  
Service Rate ◽  
Closed Form Solutions ◽  
Optimal Thresholds ◽  
Optimal Service ◽  
Number Of Customers ◽  
System Operating ◽  
Server System

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost function is developed to obtain the optimal operating (0, Q N, M) policy and the optimal service rate at minimum cost using direct search method. Some performance measures and sensitivity analysis have been presented.

scholarly journals Analysis and Comparison of Queue with N-Policy and Unreliable Server

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Qing Ma ◽  
Xuelu Zhang
Keyword(s):  
Social Welfare ◽  
Poisson Process ◽  
Queueing System ◽  
Management Decision ◽  
Dormant State ◽  
Unreliable Server ◽  
The Social ◽  
Number Of Customers ◽  
Potential Customers ◽  
Strong Ability

This work considers a queueing system with N-policy and unreliable server, where potential customers arrive at the system according to Poisson process. If there is no customer waiting in the system, instead of shutting down, the server turns into dormant state and does not afford service until the number of customers is accumulated to a certain threshold. And in the working state, the server is apt to breakdown and affords service again only after it is repaired. According to whether the server state is observable or not, the numerical optimal arrival rates are computed to maximize the social welfare and throughput of the system. The results illustrate their tendency in two cases so that the manager has a strong ability to decide which is more crucial in making management decision.

A multiclass feedback queue in heavy traffic

1988 ◽  
Vol 20 (01) ◽  
pp. 179-207 ◽  
Author(s):  
Martin I. Reiman
Keyword(s):  
Random Number ◽  
Queueing System ◽  
Heavy Traffic ◽  
Arrival Process ◽  
Service Discipline ◽  
Reflected Brownian Motion ◽  
One Dimensional ◽  
Heavy Traffic Limit ◽  
Single Station ◽  
Feedback Queue

We consider a single station queueing system with several customer classes. Each customer class has its own arrival process. The total service requirement of each customer is divided into a (possibly) random number of service quanta, where the distribution of each quantum may depend on the customer's class and the other quanta of that customer. The service discipline is round-robin, with random quanta. We prove a heavy traffic limit theorem for the above system which states that as the traffic intensity approaches unity, properly normalized sequences of queue length and sojourn time processes converge weakly to one-dimensional reflected Brownian motion.

Sign in / Sign up

Export Citation Format

Share Document