Analysis of the fluid weighted fair queueing system

2003 ◽  
Vol 40 (1) ◽  
pp. 180-199 ◽  
Author(s):  
Fabrice Guillemin ◽  
Ravi Mazumdar ◽  
Alain Dupuis ◽  
Jacqueline Boyer
Keyword(s):  
Laplace Transform ◽  
Performance Measures ◽  
Joint Distribution ◽  
Queueing System ◽  
Laplace Transforms ◽  
Fair Queueing ◽  
Mean Waiting Time ◽  
The Laplace Transform ◽  
The Mean

We analyse in this paper the fluid weighted fair queueing system with two classes of customers, who arrive according to Poisson processes and require arbitrarily distributed service times. In a first step, we express the Laplace transform of the joint distribution of the workloads in the two virtual queues of the system by means of unknown Laplace transforms. Such an unknown Laplace transform is related to the distribution of the workload in one queue provided that the other queue is empty. We explicitly compute the unknown Laplace transforms by means of a Wiener—Hopf technique. The determination of the unknown Laplace transforms can be used to compute some performance measures characterizing the system (e.g. the mean waiting time for each class) which we compute in the exponential service case.

Analysis of the fluid weighted fair queueing system

2003 ◽  
Vol 40 (01) ◽  
pp. 180-199
Author(s):  
Fabrice Guillemin ◽  
Ravi Mazumdar ◽  
Alain Dupuis ◽  
Jacqueline Boyer
Keyword(s):  
Laplace Transform ◽  
Performance Measures ◽  
Joint Distribution ◽  
Queueing System ◽  
Laplace Transforms ◽  
Fair Queueing ◽  
Mean Waiting Time ◽  
The Laplace Transform ◽  
The Mean

We analyse in this paper the fluid weighted fair queueing system with two classes of customers, who arrive according to Poisson processes and require arbitrarily distributed service times. In a first step, we express the Laplace transform of the joint distribution of the workloads in the two virtual queues of the system by means of unknown Laplace transforms. Such an unknown Laplace transform is related to the distribution of the workload in one queue provided that the other queue is empty. We explicitly compute the unknown Laplace transforms by means of a Wiener—Hopf technique. The determination of the unknown Laplace transforms can be used to compute some performance measures characterizing the system (e.g. the mean waiting time for each class) which we compute in the exponential service case.

scholarly journals A queueing model for error control of partial buffer sharing in ATM

1999 ◽  
Vol 5 (4) ◽  
pp. 329-348
Author(s):  
Boo Yong Ahn ◽  
Ho Woo Lee
Keyword(s):  
Error Control ◽  
Approximation Scheme ◽  
Queueing System ◽  
Recursive Method ◽  
Loss Probabilities ◽  
Mean Waiting Time ◽  
System Equations ◽  
The Mean ◽  
Buffer Sharing

We model the error control of the partial buffer sharing of ATM by a queueing systemM1,M2/G/1/K+1with threshold and instantaneous Bernoulli feedback. We first derive the system equations and develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time of each class of cells. An algorithm is developed for finding the optimal threshold and queue capacity for a given quality of service.

The solution of theoretical seismic problems by best rational function approximations for Laplace transform inversion

1975 ◽  
Vol 65 (4) ◽  
pp. 927-935
Author(s):  
I. M. Longman ◽  
T. Beer
Keyword(s):  
Laplace Transform ◽  
Rational Function ◽  
High Accuracy ◽  
Time Variable ◽  
Inversion Method ◽  
The Laplace Transform ◽  
Previously Treated ◽  
The Mean ◽  
Function Approximations ◽  
Laplace Transform Inversion

Abstract In a recent paper, the first author has developed a method of computation of “best” rational function approximations ḡn(p) to a given function f̄(p) of the Laplace transform operator p. These approximations are best in the sense that analytic inversion of ḡn(p) gives a function gn(t) of the time variable t, which approximates the (generally unknown) inverse f(t) of f̄(p in a minimum least-squares manner. Only f̄(p) but not f(t) is required to be known in order to carry out this process. n is the “order” of the approximation, and it can be shown that as n tends to infinity gn(t) tends to f(t) in the mean. Under suitable conditions on f(t) the convergence is extremely rapid, and quite low values of n (four or five, say) are sufficient to give high accuracy for all t ≧ 0. For seismological applications, we use geometrical optics to subtract out of f(t) its discontinuities, and bring it to a form in which the above inversion method is very rapidly convergent. This modification is of course carried out (suitably transformed) on f̄(p), and the discontinuities are restored to f(t) after the inversion. An application is given to an example previously treated by the first author by a different method, and it is a certain vindication of the present method that an error in the previously given solution is brought to light. The paper also presents a new analytical method for handling the Bessel function integrals that occur in theoretical seismic problems related to layered media.

CERTAIN ISOMETRIES RELATED TO THE BILATERAL LAPLACE TRANSFORM

2006 ◽  
Vol 11 (3) ◽  
pp. 331-346 ◽  
Author(s):  
S. B. Yakubovich
Keyword(s):  
Hilbert Space ◽  
Entire Function ◽  
Laplace Transform ◽  
Hilbert Spaces ◽  
Reproducing Kernel ◽  
Reproducing Kernel Hilbert Space ◽  
Inversion Formulas ◽  
Mean Convergence ◽  
The Laplace Transform ◽  
The Mean

We study certain isometries between Hilbert spaces, which are generated by the bilateral Laplace transform In particular, we construct an analog of the Bargmann‐Fock type reproducing kernel Hilbert space related to this transformation. It is shown that under some integra‐bility conditions on $ the Laplace transform FF(z), z = x + iy is an entire function belonging to this space. The corresponding isometrical identities, representations of norms, analogs of the Paley‐Wiener and Plancherel's theorems are established. As an application this approach drives us to a different type of real inversion formulas for the bilateral Laplace transform in the mean convergence sense.

A result on the Laplace transform associated with the sticky Brownian motion on an interval

2020 ◽  
pp. 2150031
Author(s):  
Shiyu Song
Keyword(s):  
Brownian Motion ◽  
Boundary Conditions ◽  
Laplace Transform ◽  
Laplace Transforms ◽  
Perturbation Approach ◽  
Integrated Process ◽  
Modified Bessel Function ◽  
Airy Functions ◽  
Occupation Times ◽  
The Laplace Transform

In this paper, we study the joint Laplace transform of the sticky Brownian motion on an interval, its occupation time at zero and its integrated process. The perturbation approach of Li and Zhou [The joint Laplace transforms for diffusion occupation times, Adv. Appl. Probab. 45 (2013) 1049–1067] is adopted to convert the problem into the computation of three Laplace transforms, which is essentially equivalent to solving the associated differential equations with boundary conditions. We obtain the explicit expression for the joint Laplace transform in terms of the modified Bessel function and Airy functions.

M/M/∞ transience revisited

1997 ◽  
Vol 34 (04) ◽  
pp. 1061-1067 ◽  
Author(s):  
J. Preater
Keyword(s):  
Laplace Transform ◽  
Joint Distribution ◽  
Busy Period ◽  
Complex Analysis ◽  
Transient Characteristics ◽  
The Laplace Transform ◽  
Swept Area ◽  
The Way

We take a fresh look at some transient characteristics of an M/M/∞ queue, studied previously by Guillemin and Simonian using delicate complex analysis. Along the way we obtain the Laplace transform of the joint distribution of the duration, number of arrivals and swept area associated with a busy period of an M/M/1 queue.

The general N server finite queue

1971 ◽  
Vol 8 (04) ◽  
pp. 828-834 ◽  
Author(s):  
Asha Seth Kapadia
Keyword(s):  
Waiting Time ◽  
Busy Period ◽  
Queueing System ◽  
List Type ◽  
Type Number ◽  
Stochastic Nature ◽  
Mean Waiting Time ◽  
Queue Discipline ◽  
Mean And Variance ◽  
The Mean

Kingman (1962) studied the effect of queue discipline on the mean and variance of the waiting time. He made no assumptions regarding the stochastic nature of the input and the service distributions, except that the input and service processes are independent of each other. When the following two conditions hold: (a) no server sits idle while there are customers waiting to be served; (b) the busy period is finite with probability one (i.e., the queue empties infinitely often with probability one); he has shown that the mean waiting time is independent of the queue discipline and the variance of the waiting time is a minimum when the customers are served in order of their arrival. Conditions (a) and (b) will henceforward be called Kingman conditions and a queueing system satisfying Kingman conditions will be referred to in the text as a Kingman queue.

On a property of the variance of the waiting time of a queue

1968 ◽  
Vol 5 (3) ◽  
pp. 702-703 ◽  
Author(s):  
D. G. Tambouratzis
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Mean Waiting Time ◽  
Queue Discipline ◽  
The Mean ◽  
Number Of Customers

In this note, we consider a queueing system under any discipline which does not affect the distribution of the number of customers in the queue at any time. We shall show that the variance of the waiting time is a maximum when the queue discipline is “last come, first served”. This result complements that of Kingman [1] who showed that, under the same assumptions, the mean waiting time is independent of the queue discipline and the variance of the waiting time is a minimum when the customers are served in the order of their arrival.

scholarly journals The ruin probability in a special case

1971 ◽  
Vol 6 (1) ◽  
pp. 66-68 ◽  
Author(s):  
H. Bohman
Keyword(s):  
Numerical Analysis ◽  
Laplace Transform ◽  
Ruin Probability ◽  
Claim Amount ◽  
The Laplace Transform ◽  
Desk Calculator ◽  
Numerical Tools ◽  
The Mean ◽  
Image Position ◽  
Special Case

It is fantastic how the computer has changed our attitude to numerical problems. In the old days when our numerical tools were paper, pencil, desk calculator and logarithm tables we had to stay away from formulas and methods which led to too lengthy calculations. A consequence is that we have a tendency to think of numerical analysis in terms of the classical tools. If we go back to the results of earlier writers it seems, however, very likely that many results and formulas developed by them which had earlier a theoretical interest only could nowadays be applied successfully in numerical analysis.As an example I take the ruin probability ψ(x). The Laplace transform of ψ(x) is given by the following expressionwhere c > 1. In fact (c — 1) is equal to the “security loading”. The function p(y) is equal to the Laplace transform of the claim distribution. We assume that the mean claim amount is equal to one, i.e. p′(0) = — 1.In his book from 1955 [1] Cramer points out that this formula will be more easy to handle if the claim distribution is an exponential polynomial. In this case we havewhereCramér's results are given on pages 81-83 in his book. We reproduce them here with a slight change of notations only.

Sign in / Sign up

Export Citation Format

Share Document