System designs, optimizing resource allocation to organization units, is still being considered as a complicated problem especially when there are multiple inputs and outputs related to a unit. The algorithm presented here will divide the frontiers obtained with DEA. In this way, we investigate a new approach for resource allocation.

We will review recent developments in the design of distributed resource allocation algorithms for wireless networks. We will start with an optimization-based formulation of the resource allocation problem and present a solution which suggests a network architecture consisting of congestion control at the end-users and a back-pressure algorithm for joint MAC, power control and routing. We will ...

in this paper, the energy efficient resource allocation in noma-based heterogeneous cellular network(hcn) systems is investigated. since energy consumption and its limitations is one of the important challenges in fifth generation of cellular networks (5g), we propose a resource allocation problem which allocates power and subcarriers to multiple users to achieve the best system energy efficien...

This contribution gives an introduction to an integrated vehicle routing and resource allocation problem. We refer to it as the Swap Trailer Problem and formulate the mathematical model. After the analysis of dynamic decision problems and the development of a framework for this problem, we highlight the dynamic aspect of the problem. Two different solution strategies are supposed. Special prope...

Link reversal is an algorithmic method with various applications. Originally proposed by Gafni and Bertsekas in 1981 for routing in radio networks, it has been later applied also to solve concurrency related problems as mutual exclusion, resource allocation, and leader election. For resource allocation, conflicts can be represented by conflict graphs, and link reversal algorithms work on these ...

In this paper, we show the validity of a quite simple resource allocation law, which is not restricted to one time scale. Besides the fact that this law describes the basic behaviour of resource allocation for sources with variable bit rates, it offers savings of time and memory in practice when systems are to be dimensioned and routing has to be performed, and particularly in dynamic resource ...

Resource Allocation in Grid environments to date is generally carried out under the assumption that there is one primary scheduling system scheduling jobs. However, as environments tend towards larger open “utility” Grids it becomes increasingly likely that deployments will involve multiple independent schedulers allocating jobs over the same resources. In this paper we show that, if using curr...

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmi...

Factoring and warehouse distribution centers face numerous and interrelated challenges in their e orts to move products and materials through their facilities. New technologies in navigation and guidance allow true autonomy with more exibility and resource e ciency. In this paper we investigate a complete design approach to obtain deadlock-free minimal adaptive routing algorithms for these syst...