6. Conclusion

In this paper, computing methods have been designed in order to evaluate response time of packet switching networks. Efficient algorithms have been proposed to study M/GI/1 queues. They use formal and thereafter numerical techniques. They decrease approximation errors for the set of values which are not small enough to use standard techniques and not large enough to use large deviation techniques. Examples were shown from M/D/1 queues, but the algorithms apply to the general case. A key point to conclude: the proposed method does not generate a Gibbs' phenomenon at discontinuity points (Fig. 2), unlike others algorithms based upon orthogonal functions, and the remaining error term is no longer an oscillating function.