Maximization of Service Flows Rates as a Solution of Network Capacity Allocation Problem

The problem of network capacity allocation is a well-known problem in information and telecommunication area. Emerging set of new services such as cloud-based services, internet of things services, health care services, delivery support services are the key motivators of network capacity growth. In general, network capacity allocation is the static solution for general resources balancing dynamic problem. As far as user demands to change rapidly the network should be capable to support all traffic in accordance with service quality indicators. The solution of the formulated problem is the set of maximum rates of the corresponding service flows that compete with other service flows. This information is essential for the implementation of the service-oriented resource planning, as it enables to calculate the customers’ audience if the values of services popularity and subscriber’s distribution in the access network are predefined.