Multi-objective Resource Allocation Research Articles

Multi-Criteria Decision under Uncertainty as Applied to Resource Allocation and Its Computing Implementation

This research addresses the problem of multi-objective resource allocation or resource deficits, offering robust answers to planning decisions that involve the elementary question: “How is it done?”. The solution to the problem is realized using the general scheme of multi-criteria decision-making in uncertain conditions. The bases of the proposed scheme are associated with the possibilistic approach, which involves the generalization of fuzzy sets from the classical approach to process the uncertainty of information to produce robust (non-dominated) solutions in multi-criteria analysis. Applying this general scheme makes it possible to reduce regions of decision uncertainty through the maximum use of available quantitative information. In the case where quantitative information analysis is insufficient to obtain a unique solution, the proposed approach presupposes the appropriation of qualitative data extracted from experts, who express their opinions considering their knowledge, experience, and intuition. The information on the qualitative character can be represented in diverse preference formats processed by transformation functions to provide homogeneous information for decision procedures used at the final decision stage. The presented results have been implemented within the system of multi-criteria decision-making under uncertain conditions described in the paper. Its functioning is illustrated by solving the typical problem in investment planning activities.

Distributed Event-Triggered Algorithms for Multi-Objective Resource Allocation Problem

This paper considers a multi-objective resource allocation problem for a multi-agent network where each agent has multiple local objective functions. The goal is to obtain the Pareto optimum by exchanging information between agents. To this end, first, we introduce the weighted [Formula: see text] preference index to reformulate this problem into a single-objective resource allocation problem, in which the weighting factor of each objective depends on its relative importance. Moreover, in order to reduce the communication burden, we propose distributed event-triggered algorithms to solve the reformulated problem. When local objective functions are strongly convex and have Lipschitz gradients, we prove that the proposed algorithms are free of Zeno behavior and achieve exponential convergence. Finally, we demonstrate the effectiveness of the proposed algorithms by a microgrid network example.

MAHTD-DDPG-Based Multi-Objective Resource Allocation for UAV-Assisted Wireless Network

MAHTD-DDPG-Based Multi-Objective Resource Allocation for UAV-Assisted Wireless Network

Deep Reinforcement Learning for Multi-Objective Resource Allocation in Multi-Platoon Cooperative Vehicular Networks

Grouping vehicles into platoons is a promising cooperative driving scenario to enhance the traffic safety and capacity of future vehicular networks. However, fast changing channel conditions in multi-platoon vehicular networks cause tremendous uncertainty for resource allocation. In addition, the unprecedented proliferation of various emerging vehicle-to-infrastructure (V2I) applications may result in some service demands with conflicting quality of experience. In this paper, we formulate a multi-objective resource allocation problem, which maximizes the transmission success rate of intra-platoon communications and the mean opinion score (MOS) of V2I communication links. To efficiently solve this multi-objective optimization problem, we resort to a deep reinforcement learning (DRL) framework. Specifically, we divide it into a set of scalar optimization subproblems based on the weighted sum approach and model each one as a partially observable stochastic game (P-OSG), where each platoon acts as an agent and the actions taken by all platoons correspond to the resource allocation solution. We further propose a Contribution-based Dual-Clip Proximal Policy Optimization (CD-PPO) algorithm to deal with each subproblem, which is a DRL algorithm based on the actor-critic framework. The network parameters of all subproblems are then optimized collaboratively by using the proposed training algorithm and the neighborhood parameter transfer strategy. The desired Pareto front is obtained when all the subproblems are solved. Simulation results reveal that proposed algorithm can outperform the other algorithms in terms of the MOS and transmission success rate.

Enhanced resource allocation in distributed cloud using fuzzy meta-heuristics optimization

Cloud computing is a modern technology that has become popular today. A large number of requests has made it essential to propose a resources allocation framework for arriving requests. The network can be made more efficient and less costly this way. The cloud–edge paradigm has been considered a growing research area in the computing industry in recent years. The increase in the number of customers and requests for cloud data centers (CDCs) has created the need for robust servers and low power consumption mechanisms. Ways to reduce energy in the CDC having appropriate algorithms for resource allocation. The purpose of this study was to develop an intelligent method for dynamic resource allocation using Takagi–Sugeno–Kang (TSK) neural-fuzzy systems and ant colony optimization (ACO) techniques to reduce energy consumption by optimizing resource allocation in cloud networks. It predicts future loads using a drop-down window to track CPU usage. By optimizing virtual machine migration, ACO can reduce energy consumption. Simulations are provided by examining the implementation and a variety of parameters such as the number of requests made wasted resources, and requests rejected. In this paper, we propose the use of virtual machine migration to accomplish two main goals: evacuating additional and non-optimal virtual machines (scaling and shutting down additional active physical machines) and solving the resource granulation problem. We evaluated and compared our results with literature for rejection rates of virtual and physical machine applications. The performances of our algorithms are compared to different criteria such as performance in request rejection, dynamic CPU resource allocation with reinforcement learning, multi-objective resource allocation, NSGAIII, Whale optimization and Forecast Particle Swarm allocation. A comparison of some evaluation criteria showed that the proposed method is more efficient than other methods.

Resource Management in UAV Enabled MEC Networks

Mobile edge cloud networks can be used to offload computationally intensive tasks from Internet of Things (IoT) devices to nearby mobile edge servers, thereby lowering energy consumption and response time for ground mobile users or IoT devices. Integration of Unmanned Aerial Vehicles (UAVs) and the mobile edge computing (MEC) server will significantly benefit small, battery-powered, and energy-constrained devices in 5G and future wireless networks. We address the problem of maximising computation efficiency in U-MEC networks by optimising the user association and offloading indicator (OI), the computational capacity (CC), the power consumption, the time duration, and the optimal location planning simultaneously. It is possible to assign some heavy tasks to the UAV for faster processing and small ones to the mobile users (MUs) locally. This paper utilizes the k-means clustering algorithm, the interior point method, and the conjugate gradient method to iteratively solve the non-convex multi-objective resource allocation problem. According to simulation results, both local and offloading schemes give optimal solution.

Multi-Objective Energy Efficient Resource Allocation in Massive Multiple Input Multiple Output-Aided Heterogeneous Cloud Radio Access Networks

In this work, a novel energy efficient multi-objective resource allocation algorithm for heterogeneous cloud radio access networks (H-CRANs) is proposed where the trade-off between increasing throughput and decreasing operation cost is considered. H-CRANs serve groups of users through femto-cell access points (FAPs) and remote radio heads (RRHs) equipped with massive multiple input multiple output (MIMO) connected to the base-band unit (BBU) pool via front-haul links with limited capacity. We formulate an energy-efficient multi-objective optimization (MOO) problem with a novel utility function. Our proposed utility function simultaneously improves two conflicting goals as total system throughput and operation cost. With this MOO, we jointly assign the sub-carrier, transmit power, access point (AP)(RRH/FAP), RRH, front-haul link, and BBU. To address the conflicting objectives, we convert the MOO problem into a single-object optimization problem using an elastic-constraint scalarization method. With this approach, we flexibly adjust trade-off parameters to choose between two objective functions. To propose an efficient algorithm, we deploy successive convex approximation (SCA) and complementary geometric programming (CGP) approaches. Finally, via simulation results we discuss how to select the values of trade-off parameters, and we study their effects on conflicting objective functions (i.e., throughput and operation cost in MOO problem). Simulation results also show that our proposed approach can offload traffic from C-RANs to FAPs with low transmit power and thereby reduce operation costs by switching off the under-utilized RRHs and BBUs. It can be observed from the simulation results that the proposed approach outperforms the traditional approach in which each user is associated to the AP (RRHs/FAPs) with the largest average value of signal strength. The proposed approach reduces operation costs by 30% and increases throughput index by 25% which in turn leads to greater energy efficiency (EE).

Multiobjective Resource Allocation for mmWave MEC Offloading Under Competition of Communication and Computing Tasks

Towards 6G networks, such as virtual reality (VR) applications, Industry 4.0 and automated driving, demand mobile edge computing (MEC) techniques to offload computing tasks to nearby servers, which however causes fierce competition with traditional communication services. On the other hand, by introducing millimeter wave (mmWave) communication, it can significantly improve the offloading capability of MEC, so that enabling low latency and high throughput. For this sake, this paper investigates the resource management for the offload transmission of mmWave MEC system, when considering the data transmission demands from both communication-oriented users (CM-UEs) and computing-oriented users (CP-UEs). In particular, the joint consideration of user pairing, beamwidth allocation and power allocation is formulated as a multi-objective problem (MOP), which includes minimizing the offloading delay of CP-UEs and maximizing the transmission rate of CM-UEs. By using -constraint approach, the MOP is converted into a single-objective optimization problem (SOP) without losing Pareto optimality, and then the three-stage iterative resource allocation algorithm is proposed. Our simulation results show that, the gap between Pareto front generated by three-stage iterative resource allocation algorithm and the real Pareto front less than 0.16%. Futher, the proposed algorithm with much lower complexity can achieve the performance similar to the benchmark scheme of NSGA-2, while significantly outperforms the other traditional schemes.

Multi-objective optimal water resources allocation in the middle and upper reaches of the Huaihe River Basin (China) based on equilibrium theory

In the river basin water resources allocation (WRA) problem, an unbalanced WRA poses challenges to water resources management departments. Many studies focus on achieving a lower water shortage rate while ignoring the equilibrium relationship among the socio-economic system, water resources system and eco-environmental system, as well as the equilibrium relationship among different regions. In this study, a water resources allocation model(WRAM) based on equilibrium theory is constructed to achieve the balance between different systems and different spaces in a basin. First, the relationship among the water resources system, socio-economic system and eco-environmental system is described. Then, the regional equilibrium index and system equilibrium index are constructed. Finally, the first model based on equilibrium theory is constructed. The results show that: (1) the Pareto Front reflects the contradictory relationship between economic development and environmental sustainability; (2) with the restructuring of industry and cropping, both economic efficiency and water shortage rates improve; (3) the equilibrium of the basin could also be further improved if water resources utilisation is further improved. Therefore, this study improves the existing WRAM, which can be applied to guide the water resources management of river basin.

Adaptive scheduling for multi-objective resource allocation through multi-criteria decision-making and deep Q-network in wireless body area networks

Adaptive scheduling for multi-objective resource allocation through multi-criteria decision-making and deep Q-network in wireless body area networks

Virtual Machine Resource Allocation Optimization in Cloud Computing Based on Multiobjective Genetic Algorithm.

Cloud computing is an important milestone in the development of distributed computing as a commercial implementation, and it has good prospects. Infrastructure as a service (IaaS) is an important service mode in cloud computing. It combines massive resources scattered in different spaces into a unified resource pool by means of virtualization technology, facilitating the unified management and use of resources. In IaaS mode, all resources are provided in the form of virtual machines (VM). To achieve efficient resource utilization, reduce users' costs, and save users' computing time, VM allocation must be optimized. This paper proposes a new multiobjective optimization method of dynamic resource allocation for multivirtual machine distribution stability. Combining the current state and future predicted data of each application load, the cost of virtual machine relocation and the stability of new virtual machine placement state are considered comprehensively. A multiobjective optimization genetic algorithm (MOGANS) was designed to solve the problem. The simulation results show that compared with the genetic algorithm (GA-NN) for energy saving and multivirtual machine redistribution overhead, the virtual machine distribution method obtained by MOGANS has a longer stability time. Aiming at this shortage, this paper proposes a multiobjective optimization dynamic resource allocation method (MOGA-C) based on MOEA/D for virtual machine distribution. It is illustrated by experimental simulation that moGA-D can converge faster and obtain similar multiobjective optimization results at the same calculation scale.

Resource Allocation for Secure SWIPT-Enabled D2D Communications With $\alpha$ Fairness

Device-to-device (D2D) communication is an emerging paradigm that can improve system capacity and spectral efficiency by using cooperative communication coexisting with cellular networks. In spite of these advantages, D2D communication suffers from unfair resource usage, security risks posed by eavesdroppers, and limited energy storage. To deal with these issues, in this paper, we propose a resource allocation algorithm to maximize the security-aware energy efficiency (EE) for D2D users (DUs) in a simultaneous wireless information and power transfer (SWIPT)-enabled D2D communication system with <inline-formula><tex-math notation="LaTeX">$\alpha$</tex-math></inline-formula> fairness, where multiple random eavesdroppers are present. In particular, we formulate a multi-objective resource allocation problem by jointly optimizing the transmit power, power-splitting (PS) factors of DUs, and the sub-channel allocation factor under multiple constraints, including the maximum interference power for each cellular user, the maximum transmit power of each DU, the PS factor, and the integer sub-channel assignment. To solve the non-convex problem, an iterative algorithm is developed to obtain the sub-optimal solution. Simulation results verify that the proposed algorithm outperforms benchmark algorithms in terms of balancing secrecy EE and fairness.

Application of water resource multi-objective allocation service based on digital water network

Abstract The rational allocation of water resources plays an important role in alleviating disparities between supply and demand in areas with water shortages. With the continuous development of modern information technology, the pace of digitization is accelerating. Digital water networks provide a means of technical support, and their application is becoming more extensive. Based on the traditional study of water resource allocation combined with the development of modern information technology, this paper proposes a new operational application model of multi-objective water resource allocation based on a digital water network and applies this model to allocate water resources in the Heihe River basin in Xi'an, Shaanxi Province. First, a topological digital water network is constructed based on the connectivity criterion of water systems, and a cooperative configuration model with social, economic and ecological objectives is established. Second, the model and its solution method are componentized, and the water resource allocation business system is constructed based on the comprehensive integration platform to integrate the digital water network and the water resource multi-objective allocation business. Finally, to verify the scientificity and feasibility of the new model, the new model was applied to allocate water resources in the Heihe River basin of Xi'an city, Shaanxi Province.

Hybrid optimization algorithm based optimal resource allocation for cooperative cognitive radio network

Resource allocation plays a key role in cooperative cognitive radio networks (CCRNs), which is influenced by channel capacity, user density, transmission capacity, and user mobility. Many researchers worked on problem-solving in CCRN but did not solve navigation issues. User traffic affects the availability of the spectrum and creates complexity for the entire network. Next, keep in mind that the Multiple Matrix incorporates the dynamics of the multi-dolphin echolocation algorithm (MDEA), it calculates the best processing request among several requests from secondary users, and also takes cognitive radio users (CRUs). Thus, navigation has mobility enhanced gravitational search algorithm (MGSA) to expand navigation, thus increasing resource allocation productivity. The results of the modeling show that users have the necessary resources to ensure energy efficiency, productivity, and longevity under the proposed multi-objective resource allocation (MORA) scheme on mobility issues.

Reinforcement Learning for Joint Optimization of Communication and Computation in Vehicular Networks

Ultra reliability and low latency communications (URLLC) are considered as one of the most important use cases for computation tasks in the Internet of Vehicles (IoV) edge computing networks. To meet the task requirements in IoV networks, communication and computing resources are allocated in an effective and efficient way. Thus, this paper proposes a multi-objective reinforcement learning strategy, called intelligent communication and computation resource allocation (ICCRA), which combines communication and computing resource allocation to reduce the total system cost consisting of latency and reliability. Specifically, this strategy can be decomposed into three algorithms. The algorithm called joint computation offloading and collaboration is a general framework of the strategy, it first uses the K-nearest neighbor method to select offloading layers for computation tasks, such as cloud computing layer, mobile edge computing layer, and local computing layer. Then, when selecting the local computing layer to perform the task, the algorithm called collaborative vehicle selection is used to find the target vehicle to execute collaborative computing. The allocation of communication and computing resources is defined as two independent objectives, the algorithm called multi-objective resource allocation uses the reinforcement learning to achieve the optimal solution, at the mobile edge computing layer. Simulation results show that compared with local computing, edge computing, and random computing strategies, the proposed strategy reduces the total system cost effectively. For instance, compared with edge computing strategy, the total system cost of the proposed strategy can be reduced about 50% on average with the different number of vehicle tasks.

Energy and Quality Aware Multi-Objective Resource Allocation Algorithm in Cloud

Cloud gaming has become the new service provisioning prototype that hosts the video games in the cloud and broadcasts the interactive game streaming to the players through the Internet. Here, the cloud must use massive resources for video representation and its streaming when several simultaneous players reach a particular point. Alternatively, various players may have separate necessities on Quality-of Experience, like low delay, high-video quality, etc. The challenging task is providing better service by the fixed cloud resource. Hence, there is a necessity for an energy-aware multi-resource allocation in the cloud. This paper devises a Fractional Rider-Harmony search algorithm (Fractional Rider-HSA) for resource allocation in the cloud. The Fractional Rider-HSA combines fractional calculus, Rider Optimization algorithm (ROA), and HSA. Moreover, the fitness function, like mean opinion score (MOS), gaming experience loss, fairness, energy consumption, and network parameters, is considered to determine the optimal resource allocation. The proposed model produces the maximal MOS of 0.8961, maximal gaming experience loss (QE) of 0.998, maximal fairness of 0.9991, the minimum energy consumption of 0.3109, and minimal delay 0.2266, respectively.

Energy-Spectrum Efficient Content Distribution in Fog-RAN Using Rate-Splitting, Common Message Decoding, and 3D-Resource Matching

Multi-objective resource allocation is studied for edge-caching enabled fog-radio access network. Notably, joint maximization of the energy-efficiency (EE) and spectrum-efficiency (SE) and interference management are investigated for distributing contents from the cache-enabled fog access points (F-APs) and cloud base station (CBS) to the user devices (UDs). In our envisioned system, the UDs are grouped into multiple non-overlapping device-clusters based on their locations. A rate-splitting with common message decoding based transmission strategy is applied to enable UDs of each device-cluster to receive data from a suitably selected F-AP and CBS over the same radio resource blocks. To maximize system EE and SE jointly, a multi-objective optimization problem (MOOP) is formulated and it is solved in three stages. At first, by employing the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -constraint method, the MOOP is converted to an EE-SE trade-off optimization problem. Then, by leveraging iterative function evaluation based power control and generalized 3D-resource matching, the EE-SE trade-off optimization problem is solved and a novel resource allocation algorithm is proposed to obtain near-optimal Pareto-front for the proposed MOOP. To reduce the complexity of obtaining near-optimal Pareto-front, a sub-optimal resource allocation algorithm is proposed as well. Finally, a low-complexity algorithm is devised to select a suitable operating EE-SE pair from the obtained Pareto-front. The conducted simulations demonstrate that the proposed resource allocation schemes achieve substantial improvement of system EE and SE over the benchmark schemes.

QoS and QoE aware multi objective resource allocation algorithm for cloud gaming

Cloud gaming is an innovative model that congregates video games. The user may have different Quality-of-Experience (QoE), which is a term used to measure a user’s level of satisfaction and enjoyment for a particular service. To guarantee general satisfaction for all users with limited cloud resources, it becomes a major issue in the cloud. This paper leverages a game theory in the cloud gaming model with resource optimization to discover optimal solutions to resolve resource allocation. The Rider-based harmony search algorithm (Rider-based HSA), which is the combination of Rider optimization algorithm (ROA) and Harmony search algorithm (HSA), is proposed for resource allocation to improve the cloud computing system’s efficiency. The fitness function is newly devised considering certain QoE parameters, which involves fairness index, Quantified experience of players (QE), and Mean Opinion Score (MOS). The proposed Rider-based HSA showed better performance compared to Potential game-based optimization algorithm, Proactive resource allocation algorithm, QoE-aware resource allocation algorithm, Distributed algorithm, and Yusen Li et al., with maximal fairness of 0.999, maximal MOS of 0.873, and maximal QE of 1.

Solving Multi-Objective Resource Allocation Problem Using Multi-Objective Binary Artificial Bee Colony Algorithm

Resource allocation is the optimal distribution in a limited number of resources available for certain activities. The allocation of the resources for a large number of activities requires exponentially multiplying a computation cost. Therefore, the resource allocation problem is known as NP-Hard problem in the literature. In this study, a multi-objective binary artificial bee colony algorithm has been proposed for solving the multi-objective resource allocation problems. The proposed algorithm has benefited from the robust structure and easy implementation properties of the artificial bee colony algorithm. The contribution is to introduce the multi-objective version of the artificial bee colony algorithm with advanced local search and binary format using transfer functions. The multi-objective binary artificial bee colony algorithm has been improved as two versions using sigmoid and hyperbolic tangent transfer functions to be able to search in the binary search space. With the proposed algorithms, the multi-objective resource allocation problems in the literature are solved, and the algorithms are compared with other algorithms that develop for the same problems. The results obtained show that the proposed algorithms give effective results on the problem. Especially, in large-scale problems, higher accuracy values are reached with a smaller number of evaluations.

Dynamic Multiobjective Approach for Power and Spectrum Allocation in Cognitive Radio Networks

Cognitive radio (CR) is a promising technology for addressing resource scarcity in wireless networks. However, in the current CR-based framework, when resource availability changes, existing resource allocation algorithms restart the optimization process without using historical information. In addition, most previous studies have focused on one or two objectives and some have only addressed pure power control or spectrum allocation, limiting the potential of CR. Thus, this article proposes a dynamic multiobjective approach for power and spectrum allocation in a CR-based environment in which the available spectrum channels vary over time and multiple objectives are involved. This article presents a dynamic multiobjective optimization problem (MOP) with the objectives of energy efficiency, fairness, and spectrum utilization and an approach of Pareto optimality. A dynamic resource allocation algorithm comprising a hybrid initialization method and feasible point generation mechanisms is proposed to solve the dynamic MOP. To dynamically adjust resource allocation, historical approximate Pareto optimal solutions, represented by a center and a manifold, are used to predict the new optima. The proposed approach can yield a better convergence level and convergence rate than those attained by comparable multiobjective resource allocation algorithms. Compared with conventional single-objective approaches, it achieves an excellent balance between the objectives.