Working Papers
Infinite Servers Queue Systems Busy Period Time Length Distribution and Parameters Study through Computational Simulation
Manuel Ferreira (Ferreira, M. A. M.);
Document Title
arXiv:2110.09526
Year (definitive publication)
2021
Language
English
Country
United States of America
More Information
Web of Science®

This publication is not indexed in Web of Science®

Scopus

This publication is not indexed in Scopus

Google Scholar

Times Cited: 0

(Last checked: 2024-10-31 16:44)

View record in Google Scholar

Abstract
A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there are not theoretical results or, existing, they are mathematically intractable what makes their utility doubtful. In this case a possible issue is to use simulation methods in order to get more useful results. Indeed, using simulation, some experiences may be performed and the respective results used to conjecture about certain queue systems interesting quantities. In this paper this procedure is followed to learn something more about quantities of interest for those infinite servers queue systems, in particular about busy period parameters and probability distributions.
Acknowledgements
--
Keywords
Infinite servers,queue,Poisson arrivals,simulation,busy period
  • Computer and Information Sciences - Natural Sciences

With the objective to increase the research activity directed towards the achievement of the United Nations 2030 Sustainable Development Goals, the possibility of associating scientific publications with the Sustainable Development Goals is now available in Ciência-IUL. These are the Sustainable Development Goals identified by the author(s) for this publication. For more detailed information on the Sustainable Development Goals, click here.