Abstract
In performance investigations of token passing local area networks, communication subsystems in switching systems with distributed control, etc., the class of polling models, i.e., multiqueue systems with cyclic service, is often employed. This paper presents an approximate analysis method for this class of models, whereby realistic modelling assumptions like the finiteness of queue capacities and nonsymmetrical load conditions are taken into account. The method of imbedded Markov chain is used for the analysis, whereby the special case of exponential as well as the case of general service time are successively considered. The latter case is analyzed in conjunction with a moment matching approach for the cycle time. The validation of the approximation is done by means of computer simulations. Numerical results are shown in order to illustrate the accuracy of the calculation method and its dependency on system parameters.
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.
