Dynamic Resource Allocation Model Research Articles

Resource Scheduling Method for Equipment Maintenance Based on Dynamic Pricing Model in Cloud Manufacturing

Cloud manufacturing, as a novel service mode in the manufacturing field with the features of flexible resource assignment, timely service, and quantity-based pricing, has attracted extensive attention in recent years. The cloud manufacturing industry uses a significant amount of smart equipment. In this context, equipment maintenance resource scheduling (EMRS) is an important subject that needs to be studied. Cloud manufacturing platforms must provide effective services for equipment maintenance in a timely manner. In order to improve the efficiency of cloud manufacturing platforms and meet the needs of users, an effective EMRS scheme is required. In this paper, we propose a dynamic resource allocation model for cloud manufacturing to meet the needs of users and maximize the benefit of a cloud manufacturing platform. The model takes into account the needs of users and the benefits of a cloud production platform. The contributions of this paper are divided into the following three aspects. First, the E-CARGO model using role-based collaboration theory is introduced to formally model EMRS activities, forming a solvable optimization model. Second, a dynamic pricing model with a center symmetric curve is designed to realize the flexible conversion between time, cost, and price. Third, the concept of satisfaction in fuzzy mathematics is introduced, in order to meet the different needs of users and platforms, in terms of time, price, and cost, while ensuring service quality and the platform’s benefits. Finally, an improved genetic algorithm is used to solve the cloud manufacturing resource scheduling problem, and good experimental results are obtained. These results demonstrate that the proposed dynamic pricing model is reasonable, and the allocation scheme obtained through a genetic algorithm is feasible and effective.

A truthful dynamic combinatorial double auction model for cloud resource allocation

Dynamic auction-based resource allocation models require little global price information, are decentralized and suitable for the distributed systems like cloud computing. For the cloud computing market, we proposed a Truthful Dynamic Combinatorial Double Auction (TDCDA) model to improve the social welfare and resource utilization. In our model, multiple cloud service providers and cloud users bid for various resources in a dynamic environment. We adopted a payment scheme to ensure truthfulness for all participants, which motivates bidders to reveal their true preferences. Since the combinatorial auction allocation with goal of economic efficiency is NP-hard, we developed a greedy mechanism to achieve the approximately efficient solution. Considering both parties’ interests and the resource scarcity, this model also ensures fairness and balances resource allocation. The proposed model is proven to be approximately efficient, incentive compatible, individually rational and budget-balanced. Simulation results show that the model not only achieves economic efficiency, but also improves resource allocation and meets resource needs for more cloud users.

Resilience-Mechanism-Based Dynamic Resource Allocation in Dispersed Computing Network

When degradation occurs in a dispersed computing network, mitigating the persistent effects of failures and improving the disposal efficiency is an open problem. However, the occurrence of failed nodes in a dispersed computing network is a random and low-probability incident. Further, the resilient resources for emergency allocation are from devices with complex spatial locations in practice. These factors pose challenges to the resource allocation problem using resilience mechanisms. In this article, we explore and analyze a resilience mechanism for dispersed computing networks as an optimization model. We investigate a resilience-aware dynamic resource allocation model to cope with a degraded dispersed computing network and obtain better emergency response at a lower cost. The uncertainties of node failures are uniquely explored to capture failure nodes more precisely and initiate the resilience mechanism for such nodes. In addition, we propose a novel approach to deal with the dynamic and complex coupling characteristics of decision variables in the model. This approach incorporates the induced artificial fish swarm algorithm with dynamic system simulation to generate and improve the scheme for the allocation of resilient resources. Finally, numerical simulation results verify the improved performance of our model and the effectiveness of the algorithm.

An Intelligence-Defined Networking Architecture With Importance-Based Network Resource Control

As network complexity increases because of the diversification of applications and services based on Internet of Autonomous Things (IoAT), it is difficult for humans to design the optimal control rule for software-defined networking (SDN) controllers. Intelligence-defined networking, called IDN, is proposed to overcome this limitation through machine learning (ML) algorithms. Since the existing IDN approaches are mostly designed to optimize only the network Quality of Services (QoS), including throughput, jitter, and latency, the controllers do not consider the importance of data in the applications and the services. This causes the controller to allocate insufficient resources to the crucial data flow, which leads critical problems, such as self-driving car accidents. To prevent this problem, we propose an importance-based IDN architecture that enables network controllers to manage network traffic with an importance levels (ILs) of data flows. First, we devise an importance estimation scheme to set the IL for the flows. Second, a dynamic resource allocation model of the controllers is developed by means of deep learning algorithms in order to make the optimal network resource. Additionally, an online learning mechanism based on weighted auto-labeling is adopted to continue enhancing the adaptability of the resource allocation model on runtime as the network conditions change. The evaluation results of the proposed architecture under various autonomous things scenarios show that the loss rate for data flows of higher importance is reduced by one-quarter compared to the case of a network controller without IL and that the bandwidth waste ratio is reduced by 10% compared to the rule-based model.

A Design and Application of Municipal Service Platform Based on Cloud-Edge Collaboration for Smart Cities.

Information and Communication Technology (ICT) makes cities "smart", capable of providing advanced municipal services to citizens more efficiently. In the literature, many applications of municipal service platform based on cloud computing and edge computing have been proposed, but the reference model and application instance based on cloud-edge collaboration specially for municipal service platform is rarely studied. In this context, this paper first develops a reference model, including resource collaboration, application collaboration, service collaboration, and security collaboration, and discusses the main contents and challenges of each part. Then, aiming at the problem of computing and communication resources allocation in the cloud-edge collaboration, a game-theory-based dynamic resource allocation model is introduced. Finally, an e-government self-service system based on the cloud-edge collaboration is designed and implemented. The cloud side is a cloud computing server, and the edge side are the self-service terminals integrating various edge computing devices with Artificial Intelligence (AI) embedded. The experimental results show that the designed system combines the advantages of cloud computing and edge computing, and provides a better user experience with lower processing latency, larger bandwidth, and more concurrent tasks. Meanwhile, the findings show that the evolutionary equilibrium and the Nash equilibrium are the optimal solutions, respectively.

A Dynamic Resource Allocation Model Based on SMDP and DRL Algorithm for Truck Platoon in Vehicle Network

The rapid development of self-driving cars and breakthroughs in key technologies have made the truck platoon possible. In addition to reducing truck fuel consumption and air pollution by reducing air resistance, effective platoon strategies can also maximize highway throughput while improving driving safety. However, the truck platoon strategy’s current resource allocation model is still in the preliminary research stage. Therefore, inspired by the successful experience of deep reinforcement learning (DRL) in solving resource allocation problems, this article proposes a dynamic resource allocation model for the truck platoon based on the semi-Markov decision process (SMDP) and DRL, which is used to maximize system revenue when considering the resource cost and income balance of the transportation system. Precisely, the proposed method first models the process of controlling the dynamic in and out of the truck platoon as SMDP. The action value in a specific state obtained by the planning algorithm is used as a DRL sample for model training. Finally, the SMDP is optimized through the trained model to obtain a truck platoon resource that approximates the optimal strategy distribution plan. The experimental results show that compared with the traditional greedy algorithm, value iteration, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${Q}$ </tex-math></inline-formula> -learning scheme concerning solving the dynamic resource allocation model of the truck platoon, the Deep <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${Q}$ </tex-math></inline-formula> -Network (DQN) used in this article can reduce the probability of request processing delay while causing the system to obtain higher rewards.

Research on Dynamic Resource Allocation and Decision-making Model of Equipment Independent Maintenance

This paper defines the relevant concepts and research objects of equipment independent maintenance, and defines the basic framework of resource allocation and decision-making model of independent maintenance. The solution method and key technology of resource allocation and decision model of equipment independent maintenance under dynamic demand condition are studied. Finally, the model is solved and the results are compared and analyzed with an example, which provides a meta-heuristic intelligent optimization algorithm that does not depend on the problem itself, and provides a thought and reference for the independent maintenance of equipment.

Optimal Model and Algorithm of Cross-layer Dynamic Resource Allocation based on Multi-Period and Utility

An optimal model and algorithm for dynamic resource allocation in satellite communication systems is proposed to further promote the system throughput and fairness based on user satisfaction. It takes the parameters of application layer, data link layer and physical layer into consideration and constructs a new kind of utility function by using the cross-layer design strategy and converts the resource allocation problem into a utility maximization model. The optimal solution of the model is solved by the combination of the Lagrange multiplier method and the Greedy algorithm, which maximizes the utility and ensures the optimal resources allocation of the satellite communication system in the multiple periods. The simulation results show that the proposed optimal model and algorithm effectively promote the throughput and fairness based on user satisfaction on the premise of ensuring service quality, therefore it can meet the requirements of the variety and the dynamic change of the service in the satellite communication system.

Dynamic Resource Pricing and Allocation in Multilayer Satellite Network

The goal of delivering high-quality service has spurred research of 6G satellite communication networks. The limited resource-allocation problem has been addressed by next-generation satellite communication networks, especially multilayer networks with multiple low-Earth-orbit (LEO) and non-low-Earth-orbit (NLEO) satellites. In this study, the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved. The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users. The resource allocation and dynamic pricing problems are combined, and a dynamic game-based resource pricing and allocation model is proposed to maximize the market advantage of LEO satellites and reduce interference between LEO and NLEO satellites. In the proposed model, the resource price is formulated as the dynamic state of the LEO satellites, using the resource allocation strategy as the control variable. Based on the proposed dynamic game model, an open-loop Nash equilibrium is analyzed, and an algorithm is proposed for the resource pricing and allocation problem. Numerical simulations validate the model and algorithm.

Dynamic Resource Allocation with Cost Externality

The inter-temporal resource allocation efficiency of a property rights-based common-pool resource system is challenged by a cost externality when one user’s extraction raises the extraction cost for others. This paper builds a dynamic resource allocation model to illustrate the efficiency loss from a standard property rights market. We then create a novel inter-temporal allocation mechanism that preserves dynamic efficiency. Our dynamic resource allocation mechanism includes an optimal planning stage where the agents collectively determine a binding extraction target for each period and a market stage where agents can exchange their extraction rights assigned within each period. The theoretical model demonstrates that our mechanism can achieve the socially optimal allocation in two specific environments. A numerical simulation of our mechanism for a general environment consistently tracks the social optimum and significantly outperforms the traditional property rights market.

Interference resilient stochastic prediction based dynamic resource allocation model for cognitive MANETs

Background/Objectives: Being dynamic in nature, Mobile Ad-hoc Network (MANET) requires robust resource allocation strategy that can ensure both optimal transmission reliability and resource efficiency to meet Quality of Service (QoS) demands. The objective of this research is to address interference resilience requirement in MANETs which is must due to greedy nature of nodes especially when accessing resource or bandwidth and develop a highly robust stochastic prediction based resource allocation strategy. Methods: The proposed Interference Resilient Stochastic Prediction based Dynamic Resource Allocation model for Cognitive MANET (ISP-DRACM) intends to enable optimal resource allocation under interweave and underlay network setup with instantaneous as well as average interference conditions. It employs a joint power management and resource allocation strategy where it intends to maximize the weighted sum-rate of the secondary users under certain defined conditions like average power and stochastic interference level. Findings/Novelty: Inculcating resource allocation problem as controlled Markov Decision Process using Hidden Markov Model (HMM) and Lagrange relaxation, our proposed model achieves better resource allocation under limited noise or interference condition and hence achieves both costeffectiveness as well as QoS provision. This method has exhibited satisfactory performance towards spectrum allocation to the secondary users without imposing any significant interference for both interweave as well as underlay Cognitive Radio setup. Keywords: Cognitive mobile ad-hoc network; stochastic prediction; interference resilience; channel state information; dynamic resource allocation; underlay and overlay cognitive MANET

Dynamic Resource Allocation Method Based on Symbiotic Organism Search Algorithm in Cloud Computing

Cloud computing is a popular and powerful paradigm for leasing IT services over the Internet. It allows sharing the resources among a large number of consumers. This requires allocating and releasing resources dynamically over time. Since resources are paid as are used, ensuring a better level of service is a challenge for cloud providers. They must provide enough resources to meet user needs with maintaining the quality of service. Therefore, QoS is a serious problem that arises during the dynamic management of heterogeneous resources. This type of problem can be resolved by minimizing execution time and resource reservation prices. It is necessary to integrate a new method well enough to improve the performance of the cloud, in this area. This article presents a dynamic resource allocation model for the cloud computing environment. In addition, we propose a meta-heuristic approach named Multi-Objectives Symbiotic Organism Search algorithm (MOSOS) for resource allocation. We specifically designed MOSOS to minimize both the makespan and cost. Simulation results revealed that MOSOS gave a better result compared to other methods. It shown significant adaptation with the dynamic change of the cloud, as well as minimizing the execution time. Hence, improving the QoS given to cloud users.

Dynamic testing resource allocation modeling for multi-release software using optimal control theory and genetic algorithm

PurposeThe use of software is overpowering our modern society. Advancement in technology is directly proportional to an increase in user demand which further leads to an increase in the burden on software firms to develop high-quality and reliable software. To meet the demands, software firms need to upgrade existing versions. The upgrade process of software may lead to additional faults in successive versions of the software. The faults that remain undetected in the previous version are passed on to the new release. As this process is complicated and time-consuming, it is important for firms to allocate resources optimally during the testing phase of software development life cycle (SDLC). Resource allocation task becomes more challenging when the testing is carried out in a dynamic nature.Design/methodology/approachThe model presented in this paper explains the methodology to estimate the testing efforts in a dynamic environment with the assumption that debugging cost corresponding to each release follows learning curve phenomenon. We have used optimal control theoretic approach to find the optimal policies and genetic algorithm to estimate the testing effort. Further, numerical illustration has been given to validate the applicability of the proposed model using a real-life software failure data set.FindingsThe paper yields several substantive insights for software managers. The study shows that estimated testing efforts as well as the faults detected for both the releases are closer to the real data set.Originality /valueWe have proposed a dynamic resource allocation model for multirelease of software with the objective to minimize the total testing cost using the flexible software reliability growth model (SRGM).

Efficient dynamic resource allocation method for cloud computing environment

The dynamic resource allocation is a good feature of the cloud computing environment. However, it faces serious problems in terms of service quality, fault tolerance, and energy consumption. It was necessary, then, to find an effective method that can effectively address these important issues and increase cloud performance. This paper presents a dynamic resource allocation model that can meet customer demand for resources with improved and faster responsiveness. It also proposes a multi-objective search algorithm called Spacing Multi-Objective Antlion algorithm (S-MOAL) to minimize both the makespan and the cost of using virtual machines. In addition, its impact on fault tolerance and energy consumption was studied. The simulation revealed that our method performed better than the PBACO, DCLCA, DSOS and MOGA algorithms, especially in terms of makespan.

Emergency Resource Allocation for Multi-Period Post-Disaster Using Multi-Objective Cellular Genetic Algorithm

As an important part of emergency response, the post-disaster emergency resource allocation is essential for mitigating disaster losses. To realize the effective allocation of relief materials and the reasonable selection of transportation routes, a multi-objective resource allocation model is proposed, considering the characteristics of uncertainty and persistence during rescue process. Furthermore, the multi-objective cellular genetic algorithm (MOCGA) is developed to solve the model by introducing the auxiliary population and neighborhood structure in the cellular automata. Finally, the comparison experiment proves that the overall performance of MOCGA is satisfactory compared with non-dominated multi-objective whale optimization algorithm (NSMOWOA), non-dominated multi-objective grey wolf optimizer (NSMOGWO) and non-dominated sorting genetic algorithm (NSGA-II) in the pareto front (PF), the hypervolume, the average value of objective function, and the PF ratio. Results show that MOCGA can solve the multi-objective dynamic emergency resource allocation model well, and can provide decision-makers with more excellent and diverse candidate rescue schemes than other algorithms. Besides, by analyzing the rescue schemes, this paper also provides a theoretical rescue scheme for decision-makers' scientific decisions.

Dynamic Bandwidth Scheduling of Software Defined Networked Collaborative Control System

From the perspective of collaborative design of control and scheduling, a software-defined networked collaborative control system (SD-NCCS) is established. On this basis, the system performance of SD-NCCS is analyzed and the average sensitivities of reference are used in utility function to evaluate the effects of network-induced delays. Moreover, the network pricing mechanism and game theory are introduced and a dynamic bandwidth resource allocation model of the overall control system for optimal performance is obtained. Thus, the problem of the network resource allocation of the SD-NCCS has been converted to be the problem of solving the Nash equilibrium point under the non-cooperative game model. Furthermore, the Nash equilibrium solution under this frame is obtained using the estimation distributed algorithm (EDA). Finally, a simple example is included to illustrate the performance of our scheme.

Smart Dynamic Resource Allocation Model for Patient-Driven Mobile Medical Information System Using C4.5 Algorithm

A mobile medical information system (MMIS) is an integrated application (app) of traditional hospital information systems (HIS) which comprise a picture archiving and communications system (PACS), laboratory information system (LIS), pharmaceutical management information system (PMIS), radiology information system (RIS), and nursing information system (NIS). A dynamic resource allocation table is critical for optimizing the performance to the mobile system, including the doctors, nurses, or other relevant health workers. We have designed a smart dynamic resource allocation model by using the C4.5 algorithm and cumulative distribution for optimizing the weight of resource allocated for the five major attributes in a cooperation communications system. Weka is used in this study. The class of concept is the performance of the app, optimal or suboptimal. Three generations of optimization of the weight in accordance with the optimizing rate are shown.

Dymamic MAC Frame Configuration and PSO-Based Optimal Resource Allocation in Multi-channel Cognitive Radio Ad-Hoc Networks

In cluster-based cognitive radio networks, secondary system uses available channels that are not used temporally by primary systems. In multi-channel operational environments, each available channel may have different wireless channel gain and primary activity so that achievable data rate to secondary users (SUs) and required sensing parameter value are channel dependent. SUs also have different energy saving requirements and data traffic demands. Therefore, based on measured channel conditions and user constraints, cluster head needs to decide which channel should be allocated to which SUs and to configure the optimum MAC frame structure for satisfying each SU’s service demands. Furthermore, optimization to provide proportional fairness among the cognitive secondary users in resource allocation in terms of energy consumption and data rate is very important. In this paper, a dynamic MAC frame configuration and optimal resource allocation scheme for multi-channel ad-hoc cognitive radio network is proposed. We formulate our dynamic resource allocation model as a constrained optimization problem with multi-objective functions using particle swarm optimization (PSO) algorithm. The proposed PSO scheme guarantees that the allocation captures the individual traffic and energy saving demands and maximizes the objectives functions simultaneously. Simulation results show the proposed scheme can successfully maximize the intended utility function and provide proportional fairness between SUs.

Improved differential search algorithm based dynamic resource allocation approach for cloud application

The performance of a service-based system (SBS) in a cloud environment may not satisfy service-level agreement (SLA) constraints when the system load changes. To improve the profits of resource providers and satisfy the global SLA, it is necessary to dynamically allocate proper resource for SBS based on the forecasted system load. By analyzing the complex workflow of the SBS, this paper proposes improved differential search algorithm-based dynamic resource allocation approach which adopts an active mechanism to respond to the change of system load so as to ensure the timely response to change. The dynamic resource allocation model based on costs optimization and SLA constraint is then proposed. The improved differential search algorithm is designed to solve the dynamic resource allocation model. This paper proposes a load forecasting approach based on deep belief networks (DBNs) in order to accurately forecast the load to support dynamic resource allocation. Experimental results show that the approach performs well in terms of the quality of the solution compared with other related approaches.

A Protocol for Generating and Exchanging (Genome-Scale) Metabolic Resource Allocation Models.

In this article, we present a protocol for generating a complete (genome-scale) metabolic resource allocation model, as well as a proposal for how to represent such models in the systems biology markup language (SBML). Such models are used to investigate enzyme levels and achievable growth rates in large-scale metabolic networks. Although the idea of metabolic resource allocation studies has been present in the field of systems biology for some years, no guidelines for generating such a model have been published up to now. This paper presents step-by-step instructions for building a (dynamic) resource allocation model, starting with prerequisites such as a genome-scale metabolic reconstruction, through building protein and noncatalytic biomass synthesis reactions and assigning turnover rates for each reaction. In addition, we explain how one can use SBML level 3 in combination with the flux balance constraints and our resource allocation modeling annotation to represent such models.