Abstract
In this paper, we consider a two-stage tandem network. The customers waiting in these two stages share one finite buffer. By constructing a Markov process, we derive the stationary probability distribution of the system and the sojourn time distribution. Given some constraints on the minimum loss probability and the maximum waiting time, we also derive the optimal buffer size and the shared-buffer size by minimizing the total buffer costs. Numerical results show that, by adopting the buffer-sharing policy, the customer acceptance fraction and the delivery reliability are more sensitive to buffer size comparing with the buffer-allocation policy.
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.
