Abstract
AbstractThe receiving behavior of a window mechanism, an important function of flow control in packet switching computer networks, is modeled by a 2‐stage tandem queueing system with total capacity limitation. In queueing analysis, it is difficult to obtain analytical solutions for such a limited queueing system because the local balancing equations do not hold. This paper proposes two approximate analytical methods utilizing the state transition rate diagram structure: simple analysis method and heuristic approximation method. the former gives the upper and lower bounds of the steady‐state probabilities of the given system, the latter obtains the approximate analytical solutions directly. the properties of the two methods, applicability and the relation between the two methods, are clarified from numerical and simulated results and it is shown that the two analysis methods are effective approximation methods. Throughput, average system size and average waiting time are calculated and it is shown that the two approximation methods are very useful for evaluating the performance measures of the window mechanism.
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 callMore From: Electronics and Communications in Japan (Part I: Communications)
Disclaimer: 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.
