This paper proposes a QoS-aware resource allocation scheme, called as cooperative resource allocation scheme (CoRA), for relay-based OFDMA systems with both QoS and Best-effort (BE) users. Using CoRA, cooperative transmission between the Base-station (BS) and the Relay-station (RS) is employed to fulfill the requirements of QoS users. Moreover, resource scheduling is allowed not only at the BS ...

Distributed algorithms for multi-agent resource allocation can provide privacy and scalability over centralized in many cyber-physical systems. However, the distributed nature of these render systems vulnerable to man-in-the-middle attacks that lead non-convergence infeasibility schemes. In this paper, we propose attack-resilient based on primal-dual optimization when Byzantine attackers are pr...

n this paper, we consider a two-level problem of resource allocation in a telecommunication network divided into zones. At the upper level the network manager distributes homogeneous resource shares among zones in order to maximize the total network profit, which takes into account the inner zonal payments from users and the implementation costs. This means that each zonal income calculation at...

This document looks into coordinated radio resource allocation algorithms in deployments of huge number of femto-access points (FAP) by exploiting the message exchange at control-plane level through the wired ISP backhaul link. The algorithms present in this document are based on decentralized cooperative strategies supported by Game Theory. Decentralized resource allocation algorithms based on...

The European air traffic flow management problem poses particular challenges on optimization technology as it requires detailed modelling and rapid online optimization capabilities. Constraint programming proved successful in addressing these challenges for departure time slot allocation by offering fine-grained modelling of resource constraints and fast allocation through heuristic-repair stra...

We consider the multiobjective optimization problem for resource allocation of multiagent network, where each agent contains multiple conflicting local objective functions. The goal is to find compromise solutions minimizing all functions subject constraints as much possible, i.e., Pareto optimums. To this end, we first reformulate into one single-objective distributed by using weighted Lp pref...

This paper presents a model that is useful for developing resource allocation algorithms for distributed real-time systems that operate in dynamic environments. Interesting aspects of the model include dynamic environments, utility and service levels, which provide a means for graceful degradation in resourceconstrained situations and support optimization of the allocation of resources. The pap...