APPROXIMATE ANALYSIS OF A NETWORK OF RESOURCE LOSS SYSTEMS

The paper considers a network of resource loss systems (ReLS) with random resource requirements. There are two types of nodes, and customers from the first type nodes are rerouted to the second type node for an exponentially distributed time and then return back to the original node. Customers require random volume of limited resources, so if there are not enough unoccupied resources in the system upon the arrival of a customer, then it is lost. Similarly, if an accepted customer is rerouted to another node and finds that there are not enough resources to meet its requirements, then it is also lost. In this paper, we provide an approach to analyze the stationary behavior of the considered system, as well as formulas for the new customer loss probability and the accepted customer loss probability.