Approximation of the Delay Distribution in Batch Arrival M/g/1 Priority Queues
نویسندگان
چکیده
Abstract: We propose new approximate formulas for the distribution functions of the delay in batch arrival M/G/1 nonpreemptive and preemptive resume priority queues. It is assumed that the delay consists of the waiting time and the service time of a whole batch. Our formulas are of the exponential distribution type with the coefficients being matched with the exact mean and second moment of the delay. By numerical examples, they are shown to be useful for evaluating the delay percentile, which may be used as a measure of the quality of service required by the user.
منابع مشابه
An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals
Shanthikumar [10] studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non-preemptive priority and that under the preemptive-resume priority is independent of the vacation policy. We extend this interesting property i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar, ...
متن کاملSome Inequalities for Single Server Queues
The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...
متن کاملOn the Queueing Analysis of Dispersed Periodic Messages
Constant Bit Rate (CBR) traffic is expected to be an important source of traffic in high-speed networks. Such sources may have stringent delay and loss requirements and in many cases, they should be delivered exactly as they were generated. A simple delay priority scheme will bound the cell delay and jitter for CBR flows, so that in the network switches, CBR traffic will only compete with other...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملNumerical Methods for Analyzing Queues with Heavy-Tailed Distributions
In many Internet-type queues, arrival and service distributions are heavy-tailed. A difficulty with analyzing these queues is that heavy-tailed distributions do not generally have closed-form Laplace transforms. A recently proposed method, the Transform Approximation Method (TAM), overcomes this by numerically approximating the transform. This paper investigates numerical issues of implementing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011