Determination of all possible resources allocations in a packet communication network

A wireless communication network providing data services is considered. Depending on the number of available resources, their layout on several carriers, the constraints of resources allocation introduced by wireless systems (like multislot capabilities for the mobile stations in GPRS), the number of active users in the network etc., the resources administrator of such a network has to choose, among a large number of solutions, an optimal allocation of resources for the users. This paper enumerates all the possible resources allocations at each decision time, in the case of a single or multi-carrier-system. As the result obviously shows that the total number of possible allocations is too large to lead to a real-time decision of an estimated optimal allocation, the generation of an optimised subset of possible solutions to be scanned at each decision time is proposed, that significantly restricts the computation complexity while guaranteeing the same optimal decision of resources allocation. Finally, an example illustrates the search of the estimated optimal solution of allocation in the subset of possibilities.