Packet switching networks lead mostly to M/GI/1 queue models. In this paper, computing methods are designed in order to get quickly approximate values for response time of these networks. Laplace transform is a powerful tool to study such queuing systems. But inversion of the Laplace transform on the real line is well known to be an ill-conditioned problem and usual numerical methods of inversion fail to give accurate error bounds.
A new method to address this old problem is afforded by the recently developed formal computing tools: exact computations can be done during the first steps of calculation, while usual floating point computations remain confined to the last steps. Applying that method to an M/GI/1 queue, a formal approach is designed, leading to proven bounds, and several numerical improvements are proposed. Accurate bounds are obtained.
[1]
R. Piessens.
Gaussian quadrature formulas for the numerical integration of Bromwich's integral and the inversion of the laplace transform
,
1971
.
[2]
William T. Weeks,et al.
Numerical Inversion of Laplace Transforms Using Laguerre Functions
,
1966,
JACM.
[3]
李幼升,et al.
Ph
,
1989
.
[4]
A. Cheng,et al.
Approximate Inversion of the Laplace Transform
,
1998
.
[5]
Harvey Dubner,et al.
Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
,
1968,
JACM.
[6]
D. Gaver.
Imbedded Markov Chain Analysis of a Waiting-Line Process in Continuous Time
,
1959
.