Abstract
Obtaining analytic expressions for characteristics in probabilistic systems with finite buffer capacities such as (higher) moments and tail probabilities of stationary waiting times, and blocking probabilities is by no means trivial. This is also true even for a system with deterministic processing times. By using the max–plus algebraic approach in this study, we introduce closed-form formulae for characteristics of stationary waiting time in a complete buffer-sharing m-node tandem system with constant processing times. Numerical examples are also provided.
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.
