Abstract
Cycle-time distribution is shown to take the form of a linear combination of M Erlang-N density functions in a cyclic queueing network of M servers and N customers. For paths of m servers in tree-like networks, the components in the more complex linear combination are convolutions of Erlang-N with at most m − 1 negative exponentials.
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.
