On the estimation of the throughput for a class of stochastic resources sharing systems

Performance of resource sharing systems models can be estimated using graphical representation. This is proven in a study of a saturated type of resource sharing systems where the number of requests to be served by the system is consistently bounded by time. The system is represented as a connective graph with vertices which correspond to the number of requests. Likewise, the growth rate of the graph is presented as a function of its connected variables.