.png){kind=icon}
.png){kind=icon}
Return
Efficient Generalized Engset Blocking Calculation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2344045.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Engset's model of resource blocking with a finite population has recently been generalized to allow blocked users to have a recovery time before they re-enter contention for the resources. We propose an algorithm to find the stationary distribution of the resulting level-dependent quasi-birth-and-death (LDQBD) process, and hence the blocking probability. Its running time is linear in the number of resources and the population size.
Keywords:
Blocking probability
generalized Engset formula
level-dependent quasi-birth-and-death (LDQBD) process
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.