scholarly journals NAAM-MOEA/D-Based Multitarget Firepower Resource Allocation Optimization in Edge Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Liyuan Deng ◽  
Ping Yang ◽  
Weidong Liu ◽  
Lina Wang ◽  
Sifeng Wang ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Damage Effect ◽  
Test Functions ◽  
Adjustment Mechanism ◽  
Population Evolution ◽  
Decision Mechanism ◽  
Calculation Process ◽  
Adaptive Adjustment ◽  
Simulation Results ◽  
Subproblem Optimization

In the edge environment, the multiobjective evolutionary algorithm based on decomposition (MOEA/D) has been widely used in the research of multitarget firepower resource allocation. However, as the MOEA/D algorithm uses a fixed neighborhood update mechanism, it is impossible to rationally allocate computing resources based on the difficulty of each subproblem optimization, which results in some problems such as reduced population evolution efficiency and poor evolution quality during the calculation process. In order to solve these problems, a decision mechanism for subproblems and population evolution stages is designed, and on this basis, a MOEA/D algorithm based on the neighborhood adaptive adjustment mechanism is proposed to adapt to the edge environment. The optimization model of multiobjective firepower resource allocation based on the maximization of damage effect and the minimization of strike cost is constructed and solved. Using the ZDT series of test functions for comparative experiments, the simulation results show that the proposed algorithm can balance the distribution and convergence of population evolution and obtain satisfactory optimization results.

scholarly journals Optimization of Network Coding Resources Based on Improved Quantum Genetic Algorithm

Photonics ◽  
2021 ◽  
Vol 8 (11) ◽  
pp. 502
Author(s):  
Tianyang Liu ◽  
Qiang Sun ◽  
Huachun Zhou ◽  
Qi Wei
Keyword(s):  
Genetic Algorithm ◽  
Network Coding ◽  
Topological Structure ◽  
Rotation Angle ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Resource Optimization ◽  
Quantum Genetic Algorithm ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment

The problem of network coding resource optimization with a known topological structure is NP-hard. Traditional quantum genetic algorithms have the disadvantages of slow convergence and difficulty in finding the optimal solution when dealing with this problem. To overcome these disadvantages, this paper proposes an adaptive quantum genetic algorithm based on the cooperative mutation of gene number and fitness (GNF-QGA). This GNF-QGA adopts the rotation angle adaptive adjustment mechanism. To avoid excessive illegal individuals, an illegal solution adjustment mechanism is added to the GNF-QGA. A solid demonstration was provided that the proposed algorithm has a fast convergence speed and good optimization capability when solving network coding resource optimization problems.

Bottleneck-Aware Resource Allocation for Service Processes

2021 ◽  
Vol 18 (3) ◽  
pp. 1-21
Author(s):  
Shoulu Hou ◽  
Wei Ni ◽  
Ming Wang ◽  
Xiulei Liu ◽  
Qiang Tong ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Service Rate ◽  
Service Models ◽  
Service Rates ◽  
Simulation Results ◽  
5G Systems ◽  
Generic Service ◽  
The Impact ◽  
Process Simulator ◽  
Allocation Approach

In 5G systems and beyond, traditional generic service models are no longer appropriate for highly customized and intelligent services. The process of reinventing service models involves allocating available resources, where the performance of service processes is determined by the activity node with the lowest service rate. This paper proposes a new bottleneck-aware resource allocation approach by formulating the resource allocation as a max-min problem. The approach can allocate resources proportional to the workload of each activity, which can guarantee that the service rates of activities within a process are equal or close-to-equal. Based on the business process simulator (i.e., BIMP) simulation results show that the approach is able to reduce the average cycle time and improve resource utilization, as compared to existing alternatives. The results also show that the approach can effectively mitigate the impact of bottleneck activity on the performance of service processes.

Game Theory-Based Radio Resource Optimization in Heterogeneous Small Cell Networks (HSCNs)

2015 ◽  
pp. 137-183
Author(s):  
Mugen Peng ◽  
Yaohua Sun ◽  
Chengdan Sun ◽  
Manzoor Ahmed
Keyword(s):  
Game Theory ◽  
Resource Allocation ◽  
Small Cell ◽  
Base Stations ◽  
Radio Resource Allocation ◽  
Radio Resource ◽  
Small Cell Networks ◽  
The Game Theory ◽  
Simulation Results ◽  
Cell Networks

To optimize radio resource allocation, the game theory is utilized as a powerful tool because its characteristic can be adaptive to the distribution characteristics of in heterogeneous small cell networks (HSCNs). This chapter summarizes the recent achievements for the game theory based radio resource allocation in HSCNs, where macro base stations (MBSs) and dense small cell base stations (SBSs) share the same frequency spectrum and interfere with each other. Two kinds of game models are introduced to optimize the radio resource allocation, namely the non-cooperative Stackelberg and the cooperative coalition. System models, optimization problem formulation, problem solution, and simulation results for these two kinds of game models are presented. Particularly, the Stackelberg models for HSCNs are presented with the Stackelberg equilibrium and the closed-form expressions. The coalition formations for traditional HCSNs, cloud small cell networks, and heterogeneous cloud small cell networks are introduced. Simulation results are shown to demonstrate the proposed game theory based radio resource optimization strategies converged and efficient.

ENPP: Extended Non-preemptive PP-aware Scheduling for Real-time Cloud Services

2016 ◽  
Vol 6 (5) ◽  
pp. 2291
Author(s):  
Fereshteh Hoseini ◽  
Mostafa Ghobaei Arani ◽  
Alireza Taghizadeh
Keyword(s):  
Resource Allocation ◽  
Real Time ◽  
Processing Time ◽  
Resource Constraints ◽  
Cloud Services ◽  
Scheduling Problems ◽  
Hard Problems ◽  
Real Time Applications ◽  
Simulation Results ◽  
Np Hard Problems

<p class="Abstract">By increasing the use of cloud services and the number of requests to processing tasks with minimum time and costs, the resource allocation and scheduling, especially in real-time applications become more challenging. The problem of resource scheduling, is one of the most important scheduling problems in the area of NP-hard problems. In this paper, we propose an efficient algorithm is proposed to schedule real-time cloud services by considering the resource constraints. The simulation results show that the proposed algorithm shorten the processing time of tasks and decrease the number of canceled tasks.</p>

The Optimal Resource Self-configuration Method of Cognitive Network for Survivability Enhancement

2020 ◽  
Author(s):  
Jian Wang ◽  
Guosheng Zhao ◽  
Zhongnan Zhao ◽  
Zhixin Li
Keyword(s):  
Resource Allocation ◽  
Transmission Rate ◽  
Network Resource ◽  
Problem Model ◽  
Resource Configuration ◽  
Optimal Resource ◽  
Adaptive Adjustment ◽  
Varying Environments ◽  
Resource Allocation Scheme ◽  
Configuration Scheme

In view of that general lack of intelligence and flexibility of the existing network resource allocation methods in the case of time-varying environments and diversified requirements, an efficient self-configuration method is put forward to optimize the allocation of resources and improve the survivability of system. First of all, the utility function of consumption domain is introduced as an indicator to pre-arrange the priority of user’s QoS, as a result, the utility maximization of the system under resource constraint is obtained. Then, based on this definition, a multidimensional dynamic programming framework is proposed to define and describe the self-configuration process, and the problem model is constructed under certain constraints. Furthermore, the adaptive adjustment and configuration of resources are implemented by determining the priority sequence of user services, finding the optimal resource configuration scheme, and optimizing the time configuration window. Finally, The simulation results show that the proposed method is superior to the traditional resource allocation scheme in terms of system reliability, connectivity, broadband utilization, average response time and transmission rate, which improves the system’s ability to adapt to the environment intelligently and survivability effectively.

scholarly journals On the stabilization of internally coupled map lattice systems

2004 ◽  
Vol 2004 (2) ◽  
pp. 345-356 ◽  
Author(s):  
Weihong Huang
Keyword(s):  
Steady State ◽  
Periodic Orbit ◽  
Local Stability ◽  
Sufficient Conditions ◽  
Coupled Map Lattice ◽  
Coupling Constants ◽  
Lattice Systems ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment ◽  
Effectiveness And Efficiency

The adaptive adjustment mechanism is applied to the stabilization of an internally coupled map lattice system defined byxi,t+1=G((1−αi−βi)xi,t+αixi+1,t+βixi−1,t), wheref:ℝ→ℝis a nonlinear map, andαandβare nonnegative coupling constants that satisfy the constraintαi+βi<1, for allx∈ℝ,i=1,2,…,n. Sufficient conditions and ranges of adjustment parameters that guarantee the local stability of a generic steady state have been provided. Numerical simulations have demonstrated the effectiveness and efficiency for this mechanism to stabilize the system to a generic unstable steady state or a periodic orbit.

scholarly journals Spectrum Availability Aware Routing and Resource Allocation for Point-to-Multipoint Services in Mixed-Grid Optical Networks

2021 ◽  
Author(s):  
Feng Wang ◽  
Qingcheng Zhu ◽  
Xiaolong Li ◽  
Jiaming Gu ◽  
Zhenhua Yan ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Quality Of Service ◽  
Optical Networks ◽  
Evaluation Method ◽  
Blocking Probability ◽  
Channel Spacing ◽  
Bandwidth Request ◽  
Fixed Grid ◽  
Simulation Results

Mixed-grid optical networks are in a migration state where fixed-grid and flex-grid optical networks coexist. To carry point-to-multipoint (P2MP) services in mixed-grid optical networks, routing and resource allocation (RRA) problems need to be solved. Once the RRA fails, services will be blocked and then influence quality of service. The minimized spectrum for satisfying the bandwidth request of services is called as a frequency block (FB). For a service, the total number of available FBs embodies the spectrum availability on a link. Because the fixed-grid and flex-grid links have different channel spacing, spectrum availability on fixed-grid and flex-grid links needs different evaluation method. We propose a RRA algorithm in mixed-grid optical networks for P2MP services by being aware of spectrum availability. The spectrum availability is evaluated according to fixed-grid and flex-grid constraints. Our proposed algorithm achieves the lower blocking probability (BP) than that of benchmark RRA algorithms according to simulation results.

scholarly journals A Study of QoS Resource Allocation Schemes for Mobile Health

2017 ◽  
Vol 1 (1) ◽  
pp. 60-66
Author(s):  
Tara I. Yahiya ◽  
Idris Q. Karim
Keyword(s):  
Health Care ◽  
Resource Allocation ◽  
Communication Technology ◽  
Mobile Health ◽  
Network Simulation ◽  
Scheduling Algorithms ◽  
Mobile Health Care ◽  
Simulation Results ◽  
Resource Allocation Schemes

In the perspective of healthcare, mHealthcare or mobile health care is very important since it has the ability and the feasibility to take care of people’s health easier than before. mHealth is a combination of the application on a smartphone that monitors the patient’s health and the communication technology that transmits the data of the application to the predefined destination which is the hospital or the doctors. To investigate resource allocation among users in the context of mHealth, different kind of scheduling algorithms have been used to study and analyze the behavior of results taking into consideration diverse scenarios, types of applications and load of the network. Simulation results and a deep analysis were done throughout the article, and they demonstrated interesting conclusions about the combination of all parameters that were studied in this article.

An Adaptive Adjustment Mechanism for Carriage in ATTN Network

2016 ◽  
Vol 1 (1) ◽  
pp. 207
Author(s):  
Yongju Xian ◽  
Huailiang Yi ◽  
Qili Zhang
Keyword(s):  
Energy Consumption ◽  
Resource Utilization ◽  
Security Management ◽  
Utilization Rate ◽  
Simulation Platform ◽  
Font Size ◽  
Data Retention ◽  
Low Resource ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment

<span style="font-family: 'Arial','Arial'; font-size: 9pt;">Internet based on TCP/IP is now faced with the problem of scalability, security, management and energy consumption, while the patch to Internet doesn’t solve the drawback of IP n</span><span style="font-family: 'Arial','Arial'; font-size: 9pt;">etwork essentially, which further intensifies the complexity of the network. In this paper, based on the research of ATTN network, an adaptive adjustment mechanism is proposed aiming at the problem of data retention and low resource utilization rate in the automatic configuration of the carriages. In which by the forecast of data retention and resource utilization, the carrier routes are dynamically adjusted. Finally, the scheme is further optimized, and tested on ATTN simulation platform, which shows the performance of ATTN network is improved.</span>

Sign in / Sign up

Export Citation Format

Share Document