Abstract
In the paper, we analyse a multiserver queuing system with discrete limited resources and random resource requirements under MAP arrivals, which can adequately model resource allocation schemes in the contemporary wireless networks. The equilibrium system of equations is derived in the vector form and is solved numerically. With stationary probability distribution, we provide formulas for the average and the variance of the occupied resources, as well as for the blocking probability. The results are illustrated by a numerical example.
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.
