Abstract
The tool FiFiQueues analyses a general class of open queueing networks, consisting of queueing stations with limited or unlimited buffer capacity and with arbitrary connections between them. The external arrival processes and the service processes are not limited to Poisson processes but are defined by the first and the second moments of the underlying general phase-type distributions [5]. In fact, the class of queueing networks that can be analysed with FiFiQueues supersedes the model class supported by Whitt’s Queueing Network Analyser [7] with one server per node. The first extension of Whitt’s QNA that supported queueing stations with limited buffer capacity was “QNAUT” [4] which was developed at the University of Twente. FiFiQueues replaces some of the approximations made in “QNAUT” and employs new and faster algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
