scholarly journals An Optimization-Based Orchestrator for Resource Access and Operation Management in Sliced 5G Core Networks

Sensors ◽  
2021 ◽  
Vol 22 (1) ◽  
pp. 100
Author(s):  
Chiu-Han Hsiao ◽  
Yean-Fu Wen ◽  
Frank Yeong-Sung Lin ◽  
Yu-Fang Chen ◽  
Yennun Huang ◽  
...  

Network slicing is a promising technology that network operators can deploy the services by slices with heterogeneous quality of service (QoS) requirements. However, an orchestrator for network operation with efficient slice resource provisioning algorithms is essential. This work stands on Internet service provider (ISP) to design an orchestrator analyzing the critical influencing factors, namely access control, scheduling, and resource migration, to systematically evolve a sustainable network. The scalability and flexibility of resources are jointly considered. The resource management problem is formulated as a mixed-integer programming (MIP) problem. A solution approach based on Lagrangian relaxation (LR) is proposed for the orchestrator to make decisions to satisfy the high QoS applications. It can investigate the resources required for access control within a cost-efficient resource pool and consider allocating or migrating resources efficiently in each network slice. For high system utilization, the proposed mechanisms are modeled in a pay-as-you-go manner. Furthermore, the experiment results show that the proposed strategies perform the near-optimal system revenue to meet the QoS requirement by making decisions.

Author(s):  
András Éles ◽  
István Heckl ◽  
Heriberto Cabezas

AbstractA mathematical model is introduced to solve a mobile workforce management problem. In such a problem there are a number of tasks to be executed at different locations by various teams. For example, when an electricity utility company has to deal with planned system upgrades and damages caused by storms. The aim is to determine the schedule of the teams in such a way that the overall cost is minimal. The mobile workforce management problem involves scheduling. The following questions should be answered: when to perform a task, how to route vehicles—the vehicle routing problem—and the order the sites should be visited and by which teams. These problems are already complex in themselves. This paper proposes an integrated mathematical programming model formulation, which, by the assignment of its binary variables, can be easily included in heuristic algorithmic frameworks. In the problem specification, a wide range of parameters can be set. This includes absolute and expected time windows for tasks, packing and unpacking in case of team movement, resource utilization, relations between tasks such as precedence, mutual exclusion or parallel execution, and team-dependent travelling and execution times and costs. To make the model able to solve larger problems, an algorithmic framework is also implemented which can be used to find heuristic solutions in acceptable time. This latter solution method can be used as an alternative. Computational performance is examined through a series of test cases in which the most important factors are scaled.


2021 ◽  
Vol 15 (3) ◽  
pp. 1-27
Author(s):  
Mikael Sabuhi ◽  
Nima Mahmoudi ◽  
Hamzeh Khazaei

Control theory has proven to be a practical approach for the design and implementation of controllers, which does not inherit the problems of non-control theoretic controllers due to its strong mathematical background. State-of-the-art auto-scaling controllers suffer from one or more of the following limitations: (1) lack of a reliable performance model, (2) using a performance model with low scalability, tractability, or fidelity, (3) being application- or architecture-specific leading to low extendability, and (4) no guarantee on their efficiency. Consequently, in this article, we strive to mitigate these problems by leveraging an adaptive controller, which is composed of a neural network as the performance model and a Proportional-Integral-Derivative (PID) controller as the scaling engine. More specifically, we design, implement, and analyze different flavours of these adaptive and non-adaptive controllers, and we compare and contrast them against each other to find the most suitable one for managing containerized cloud software systems at runtime. The controller’s objective is to maintain the response time of the controlled software system in a pre-defined range, and meeting the Service-level Agreements, while leading to efficient resource provisioning.


Algorithms ◽  
2018 ◽  
Vol 11 (12) ◽  
pp. 190
Author(s):  
Peter Nghiem

Considering the recent exponential growth in the amount of information processed in Big Data, the high energy consumed by data processing engines in datacenters has become a major issue, underlining the need for efficient resource allocation for more energy-efficient computing. We previously proposed the Best Trade-off Point (BToP) method, which provides a general approach and techniques based on an algorithm with mathematical formulas to find the best trade-off point on an elbow curve of performance vs. resources for efficient resource provisioning in Hadoop MapReduce. The BToP method is expected to work for any application or system which relies on a trade-off elbow curve, non-inverted or inverted, for making good decisions. In this paper, we apply the BToP method to the emerging cluster computing framework, Apache Spark, and show that its performance and energy consumption are better than Spark with its built-in dynamic resource allocation enabled. Our Spark-Bench tests confirm the effectiveness of using the BToP method with Spark to determine the optimal number of executors for any workload in production environments where job profiling for behavioral replication will lead to the most efficient resource provisioning.


2021 ◽  
Author(s):  
Norah Mohammed Z. Al-Dossari ◽  
Mohamed Haouari ◽  
Mohamed Kharbeche

Multiple resource planning is a very crucial undertaking for most organizations. Apart from reducing operational complexity, multiple resource planning facilitates efficient allocation of resources, which reduces costs by minimizing the cost of tardiness and the cost for additional capacity. The current research investigates multiple resource loading problems (MRLP). MRLPs are very prevalent in today’s organizational environments and are particularly critical for organizations that handle concurrent, time-intensive, and multiple-resource projects. Using data obtained from the Ministry of Administrative Development, Labor and Social Affairs (ADLSA), a MRLP is proposed. The problem utilizes data regarding staff, time, equipment, and finance to ensure efficient resource allocation among competing projects. In particular, the research proposes a novel model and solution approach for the MRLP. Computational experiments are then performed on the model. The results show that the model performs well, even for higher instances. The positive results attest to the effectiveness of the proposed MRLP problem.


2019 ◽  
Vol 15 (4) ◽  
pp. 13-29
Author(s):  
Harvinder Chahal ◽  
Anshu Bhasin ◽  
Parag Ravikant Kaveri

The Cloud environment is a large pool of virtually available resources that perform thousands of computational operations in real time for resource provisioning. Allocation and scheduling are two major pillars of said provisioning with quality of service (QoS). This involves complex modules such as: identification of task requirement, availability of resource, allocation decision, and scheduling operation. In the present scenario, it is intricate to manage cloud resources, as Service provider aims to provide resources to users on productive cost and time. In proposed research article, an optimized technique for efficient resource allocation and scheduling is presented. The proposed policy used heuristic based, ant colony optimization (ACO) for well-ordered allocation. The suggested algorithm implementation done using simulation, shows better results in terms of cost, time and utilization as compared to other algorithms.


Author(s):  
Mohammed Amine Togou ◽  
Ting Bi ◽  
Kapal Dev ◽  
Kevin McDonnell ◽  
Aleksandar Milenovic ◽  
...  

2020 ◽  
Vol 12 (2) ◽  
pp. 581 ◽  
Author(s):  
Yiyong Xiao ◽  
Pei Yang ◽  
Siyue Zhang ◽  
Shenghan Zhou ◽  
Wenbing Chang ◽  
...  

This paper studies the cyclic dynamic gaming case of the r-interdiction median problem with fortification (CDGC-RIMF), which is important for strengthening a facility’s reliability and invulnerability under various possible attacks. We formulated the CDGC-RIMF as a bi-objective mixed-integer linear programming (MILP) model with two opposing goals to minimize/maximize the loss from both the designer (leader) and attacker (follower) sides. The first goal was to identify the most cost-effective plan to build and fortify the facility considering minimum loss, whereas the attacker followed the designer to seek the most destructive way of attacking to cause maximum loss. We found that the two sides could not reach a static equilibrium with a single pair of confrontational plans in an ordinary case, but were able to reach a dynamically cyclic equilibrium when the plan involved multiple pairs. The proposed bi-objective model aimed to discover the optimal cyclic plans for both sides to reach a dynamic equilibrium. To solve this problem, we first started from the designer’s side with a design and fortification plan, and then the attacker was able to generate their worst attack plan based on that design. After that, the designer changed their plan again based on the attacker’s plan in order to minimize loss, and the attacker correspondingly modified their plan to achieve maximum loss. This game looped until, finally, a cyclic equilibrium was reached. This equilibrium was deemed to be optimal for both sides because there was always more loss for either side if they left the equilibrium first. This game falls into the subgame of a perfect Nash equilibrium—a kind of complete game. The proposed bi-objective model was directly solved by the CPLEX solver to achieve optimal solutions for small-sized problems and near-optimal feasible solutions for larger-sized problems. Furthermore, for large-scale problems, we developed a heuristic algorithm that implemented dynamic iterative partial optimization alongside MILP (DIPO-MILP), which showed better performance compared with the CPLEX solver when solving large-scale problems.


Sign in / Sign up

Export Citation Format

Share Document