M|D|$\mathrm{\infty }$ Queue Busy Period and Busy Cycle Distributions Computational Calculus

Given the busy period and busy cycle major importance in queuing systems, it is crucial the knowledge of the respective distribution functions that is what allows the calculation of the important probabilities. For the M|G|$\mathrm{\infty }$ queue system, there are no round form formulae for those distribution functions. But, for the M|D|$\mathrm{\infty }$ queue, due the fact that its busy period and busy cycle have both Laplace transform expression round forms, what does not happen for any other M|G|$\mathrm{\infty }$ queue system, with an algorithm created by Platzman, Ammons and Bartholdi III, that allows the tail probabilities computation since the correspondent Laplace transform in round form is known, those distribution functions calculations are possible. Here, we will implement the algorithm through a FORTRAN program.