Abstract
We consider a stationary waiting time in a Poisson driven single-server m-node tandem queue with either constant or non-overlapping service times. Each node except for the first one has a finite buffer, and is operated under production blocking. By using (max,+ )-algebra, we explicitly express the stationary waiting time at each node as a function of finite buffer capacities. We also address that the explicit expression is separable and monotone decreasing with respect to the buffer sizes. These properties are applied to a buffer allocation problem with probabilistic constraints on stationary waiting times.
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.
