scholarly journals Response Time Distribution in a Tandem Pair of Queues with Batch Processing

2021 ◽  
Vol 68 (4) ◽  
pp. 1-41
Author(s):  
P. G. Harrison ◽  
J. Bor
Keyword(s):  
Response Time ◽  
Laplace Transform ◽  
Recurrence Formula ◽  
Response Time Distribution ◽  
Product Form ◽  
Batch Arrivals ◽  
The Laplace Transform ◽  
Batch Sizes ◽  
First Four Moments ◽  
Time Density

Response time density is obtained in a tandem pair of Markovian queues with both batch arrivals and batch departures. The method uses conditional forward and reversed node sojourn times and derives the Laplace transform of the response time probability density function in the case that batch sizes are finite. The result is derived by a generating function method that takes into account that the path is not overtake-free in the sense that the tagged task being tracked is affected by later arrivals at the second queue. A novel aspect of the method is that a vector of generating functions is solved for, rather than a single scalar-valued function, which requires investigation of the singularities of a certain matrix. A recurrence formula is derived to obtain arbitrary moments of response time by differentiation of the Laplace transform at the origin, and these can be computed rapidly by iteration. Numerical results for the first four moments of response time are displayed for some sample networks that have product-form solutions for their equilibrium queue length probabilities, along with the densities themselves by numerical inversion of the Laplace transform. Corresponding approximations are also obtained for (non-product-form) pairs of “raw” batch-queues—with no special arrivals—and validated against regenerative simulation, which indicates good accuracy. The methods are appropriate for modeling bursty internet and cloud traffic and a possible role in energy-saving is considered.

Sojourn times in single-server queues by negative customers

1993 ◽  
Vol 30 (4) ◽  
pp. 943-963 ◽  
Author(s):  
P. G. Harrison ◽  
E. Pitel
Keyword(s):  
Laplace Transform ◽  
Single Server ◽  
Processor Sharing ◽  
Single Server Queue ◽  
Negative Customers ◽  
Mean Values ◽  
Poisson Arrival ◽  
Server Queue ◽  
The Laplace Transform ◽  
Time Density

We derive expressions for the Laplace transform of the sojourn time density in a single-server queue with exponential service times and independent Poisson arrival streams of both ordinary, positive customers and negative customers which eliminate a positive customer if present. We compare first-come first-served and last-come first-served queueing disciplines for the positive customers, combined with elimination of the last customer in the queue or the customer in service by a negative customer. We also derive the corresponding result for processor-sharing discipline with random elimination. The results show differences not only in the Laplace transforms but also in the means of the distributions, in contrast to the case where there are no negative customers. The various combinations of queueing discipline and elimination strategy are ranked with respect to these mean values.

Sojourn times in single-server queues by negative customers

1993 ◽  
Vol 30 (04) ◽  
pp. 943-963
Author(s):  
P. G. Harrison ◽  
E. Pitel
Keyword(s):  
Laplace Transform ◽  
Single Server ◽  
Processor Sharing ◽  
Single Server Queue ◽  
Negative Customers ◽  
Mean Values ◽  
Poisson Arrival ◽  
Server Queue ◽  
The Laplace Transform ◽  
Time Density

We derive expressions for the Laplace transform of the sojourn time density in a single-server queue with exponential service times and independent Poisson arrival streams of both ordinary, positive customers and negative customers which eliminate a positive customer if present. We compare first-come first-served and last-come first-served queueing disciplines for the positive customers, combined with elimination of the last customer in the queue or the customer in service by a negative customer. We also derive the corresponding result for processor-sharing discipline with random elimination. The results show differences not only in the Laplace transforms but also in the means of the distributions, in contrast to the case where there are no negative customers. The various combinations of queueing discipline and elimination strategy are ranked with respect to these mean values.

The extinction time of a general birth and death process with catastrophes

1986 ◽  
Vol 23 (04) ◽  
pp. 851-858 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Laplace Transform ◽  
Size Distribution ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Death Process ◽  
Extinction Time ◽  
Birth And Death Process ◽  
Different Types ◽  
The Laplace Transform ◽  
Necessary And Sufficient

The Laplace transform of the extinction time is determined for a general birth and death process with arbitrary catastrophe rate and catastrophe size distribution. It is assumed only that the birth rates satisfyλ0= 0,λj> 0 for eachj> 0, and. Necessary and sufficient conditions for certain extinction of the population are derived. The results are applied to the linear birth and death process (λj=jλ, µj=jμ) with catastrophes of several different types.

The Resolvent Operator

2017 ◽  
Author(s):  
Charles L. Epstein ◽  
Rafe Mazzeo
Keyword(s):  
Cauchy Problem ◽  
Heat Equation ◽  
Laplace Transform ◽  
Heat Kernel ◽  
Resolvent Operator ◽  
Contour Integration ◽  
Resolvent Kernel ◽  
The Laplace Transform ◽  
Elliptic Estimates ◽  
The Resolvent Operator

This chapter describes the construction of a resolvent operator using the Laplace transform of a parametrix for the heat kernel and a perturbative argument. In the equation (μ‎-L) R(μ‎) f = f, R(μ‎) is a right inverse for (μ‎-L). In Hölder spaces, these are the natural elliptic estimates for generalized Kimura diffusions. The chapter first constructs the resolvent kernel using an induction over the maximal codimension of bP, and proves various estimates on it, along with corresponding estimates for the solution operator for the homogeneous Cauchy problem. It then considers holomorphic semi-groups and uses contour integration to construct the solution to the heat equation, concluding with a discussion of Kimura diffusions where all coefficients have the same leading homogeneity.

scholarly journals Algebraic inversion of the Laplace transform

2005 ◽  
Vol 50 (1-2) ◽  
pp. 179-185 ◽  
Author(s):  
P.G. Massouros ◽  
G.M. Genin
Keyword(s):  
Laplace Transform ◽  
The Laplace Transform

scholarly journals Approximation of linear one dimensional partial differential equations including fractional derivative with non-singular kernel

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Raheel Kamal ◽  
Kamran ◽  
Gul Rahmat ◽  
Ali Ahmadian ◽  
Noreen Izza Arshad ◽  
...  
Keyword(s):  
Partial Differential Equations ◽  
Differential Equations ◽  
Laplace Transform ◽  
Fractional Derivative ◽  
Meshless Method ◽  
Inverse Laplace Transform ◽  
Contour Integral ◽  
Partial Differential ◽  
One Dimensional ◽  
The Laplace Transform

AbstractIn this article we propose a hybrid method based on a local meshless method and the Laplace transform for approximating the solution of linear one dimensional partial differential equations in the sense of the Caputo–Fabrizio fractional derivative. In our numerical scheme the Laplace transform is used to avoid the time stepping procedure, and the local meshless method is used to produce sparse differentiation matrices and avoid the ill conditioning issues resulting in global meshless methods. Our numerical method comprises three steps. In the first step we transform the given equation to an equivalent time independent equation. Secondly the reduced equation is solved via a local meshless method. Finally, the solution of the original equation is obtained via the inverse Laplace transform by representing it as a contour integral in the complex left half plane. The contour integral is then approximated using the trapezoidal rule. The stability and convergence of the method are discussed. The efficiency, efficacy, and accuracy of the proposed method are assessed using four different problems. Numerical approximations of these problems are obtained and validated against exact solutions. The obtained results show that the proposed method can solve such types of problems efficiently.

Sign in / Sign up

Export Citation Format

Share Document