Finding Expected Revenue of Open HM-Network with Limited Waiting Time and Unreliable Queueing Systems

2020 ◽  
Vol 1 (5) ◽  
Author(s):  
D. Kopats
Keyword(s):  
Waiting Time ◽  
Queueing Systems ◽  
Expected Revenue

Some analyses on the control of queues using level crossings of regenerative processes

1980 ◽  
Vol 17 (3) ◽  
pp. 814-821 ◽  
Author(s):  
J. G. Shanthikumar
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Queueing Systems ◽  
Density Functions ◽  
Waiting Time Distribution ◽  
Regenerative Processes ◽  
Stieltjes Transform ◽  
Expected Number ◽  
Control Of Queues ◽  
Special Case

Some properties of the number of up- and downcrossings over level u, in a special case of regenerative processes are discussed. Two basic relations between the density functions and the expected number of upcrossings of this process are derived. Using these reults, two examples of controlled M/G/1 queueing systems are solved. Simple relations are derived for the waiting time distribution conditioned on the phase of control encountered by an arriving customer. The Laplace-Stieltjes transform of the distribution function of the waiting time of an arbitrary customer is also derived for each of these two examples.

Relations Among Moments of Waiting Time and Queue Size Distribution in Bulk Queueing Systems

1987 ◽  
Vol 36 (1-2) ◽  
pp. 63-68
Author(s):  
A. Ghosal ◽  
S. Madan ◽  
M.L. Chaudhry
Keyword(s):  
Size Distribution ◽  
Waiting Time ◽  
Queueing Systems ◽  
Queueing Models ◽  
Queue Size ◽  
Different Types

This paper brings out relations among the moments of various orders of the waiting time and the queue size in different types of bulk queueing models.

Methods for Shortening Waiting Time in Walking-Distance Introduced Queueing Systems

2010 ◽  
pp. 372-379 ◽  
Author(s):  
Daichi Yanagisawa ◽  
Yushi Suma ◽  
Akiyasu Tomoeda ◽  
Ayako Kimura ◽  
Kazumichi Ohtsuka ◽  
...  
Keyword(s):  
Waiting Time ◽  
Queueing Systems ◽  
Walking Distance

On a stochastic process occurring in queueing systems

1965 ◽  
Vol 2 (2) ◽  
pp. 467-469 ◽  
Author(s):  
U. N. Bhat
Keyword(s):  
Stochastic Process ◽  
Poisson Distribution ◽  
Waiting Time ◽  
Queueing Systems ◽  
Distribution Functions ◽  
Compound Poisson Distribution ◽  
Compound Poisson ◽  
Transition Distribution

SummaryTransition distribution functions (d.f.) of the stochastic process u + t − X(t), where X(t) has a compound Poisson distribution, are used to derive explicit results for the transition d.f.s of the waiting time processes in the queueing systems M/G/1 and GI/M/1.

On a property of a refusals stream

1997 ◽  
Vol 34 (03) ◽  
pp. 800-805 ◽  
Author(s):  
Vyacheslav M. Abramov
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Busy Period ◽  
Elementary Proof ◽  
Queueing System ◽  
Queueing Systems ◽  
Single Server ◽  
Wide Family

This paper consists of two parts. The first part provides a more elementary proof of the asymptotic theorem of the refusals stream for an M/GI/1/n queueing system discussed in Abramov (1991a). The central property of the refusals stream discussed in the second part of this paper is that, if the expectations of interarrival and service time of an M/GI/1/n queueing system are equal to each other, then the expectation of the number of refusals during a busy period is equal to 1. This property is extended for a wide family of single-server queueing systems with refusals including, for example, queueing systems with bounded waiting time.

Some analyses on the control of queues using level crossings of regenerative processes

1980 ◽  
Vol 17 (03) ◽  
pp. 814-821 ◽  
Author(s):  
J. G. Shanthikumar
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Queueing Systems ◽  
Density Functions ◽  
Waiting Time Distribution ◽  
Regenerative Processes ◽  
Stieltjes Transform ◽  
Expected Number ◽  
Control Of Queues ◽  
Special Case

Some properties of the number of up- and downcrossings over level u, in a special case of regenerative processes are discussed. Two basic relations between the density functions and the expected number of upcrossings of this process are derived. Using these reults, two examples of controlled M/G/1 queueing systems are solved. Simple relations are derived for the waiting time distribution conditioned on the phase of control encountered by an arriving customer. The Laplace-Stieltjes transform of the distribution function of the waiting time of an arbitrary customer is also derived for each of these two examples.

On the waiting-time process in a single-line queue with repeated calls

1986 ◽  
Vol 23 (1) ◽  
pp. 185-192 ◽  
Author(s):  
G. I. Falin
Keyword(s):  
Waiting Time ◽  
Limit Theorems ◽  
Queueing System ◽  
Queueing Systems ◽  
Retrial Queue ◽  
Time Process ◽  
Light Traffic ◽  
Repeated Calls ◽  
Waiting Time Process ◽  
Mean Variance

Waiting time in a queueing system is usually measured by a period from the epoch when a subscriber enters the system until the service starting epoch. For repeated orders queueing systems it is natural to measure the waiting time by the number of repeated attempts, R, which have to be made by a blocked primary call customer before the call enters service. We study this problem for the M/M/1/1 retrial queue and derive expressions for mean, variance and generating function of R. Limit theorems are stated for heavy- and light-traffic cases.

A note on the waiting time in M[X]/G/1 queueing systems with a removable server

2004 ◽  
Vol 41 (1) ◽  
pp. 287-291
Author(s):  
Jacqueline Loris-Teghem
Keyword(s):  
Distribution Function ◽  
Steady State ◽  
Waiting Time ◽  
Queueing Systems ◽  
Stieltjes Transform ◽  
Steady State Distribution ◽  
State Distribution ◽  
Removable Server ◽  
Inactive Phase ◽  
Bulk Arrival

For the M[X]/G/1 queueing model with a general exhaustive-service vacation policy, it has been proved that the Laplace-Stieltjes transform (LST) of the steady-state distribution function of the waiting time of a customer arriving while the server is active is the product of the corresponding LST in the bulk arrival model with unremovable server and another LST. The expression given for the latter, however, is valid only under the assumption that the number of groups arriving in an inactive phase is independent of the sizes of the groups. We here give an expression which holds in the general case. For the N-policy case, we also give an expression for the LST of the steady-state distribution function of the waiting time of a customer arriving while the server is inactive.

On measuring fairness in queues

2004 ◽  
Vol 36 (03) ◽  
pp. 919-936 ◽  
Author(s):  
Benjamin Avi-Itzhak ◽  
Hanoch Levy
Keyword(s):  
Waiting Time ◽  
Wide Class ◽  
Practical Implication ◽  
Computer Systems ◽  
Queueing Systems ◽  
Axiomatic Approach ◽  
Service Disciplines ◽  
Service Fairness ◽  
Measures Of Performance ◽  
Performance Comparisons

The issue of ‘fairness’ is raised frequently in the context of evaluating queueing policies, notably in relation to telecommunications and computer systems where it may be of no lesser importance than the conventional measures of performance. Comparisons of the fairness of various systems and policies are often awkward due to lack of generally accepted definitions and measures for this important property. The purpose of this work is to propose possible fairness measures enabling us to quantitatively measure and compare the level of fairness associated with G/G/R queueing systems. We define and discuss order (of service) fairness and use an axiomatic approach for developing a measure for it in the G/D/1 case. The measure obtained for the G/D/1 system is then generalized and applied to the G/G/R class of systems. A practical implication of this work is that, for a wide class of service disciplines, the variance of the waiting time can be used as a yardstick for comparing fairness levels.

Sign in / Sign up

Export Citation Format

Share Document