scholarly journals A Model-Driven Approach for Solving the Software Component Allocation Problem

Algorithms ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 354
Author(s):  
Issam Al-Azzoni ◽  
Julian Blank ◽  
Nenad Petrović

The underlying infrastructure paradigms behind the novel usage scenarios and services are becoming increasingly complex—from everyday life in smart cities to industrial environments. Both the number of devices involved and their heterogeneity make the allocation of software components quite challenging. Despite the enormous flexibility enabled by component-based software engineering, finding the optimal allocation of software artifacts to the pool of available devices and computation units could bring many benefits, such as improved quality of service (QoS), reduced energy consumption, reduction of costs, and many others. Therefore, in this paper, we introduce a model-based framework that aims to solve the software component allocation problem (CAP). We formulate it as an optimization problem with either single or multiple objective functions and cover both cases in the proposed framework. Additionally, our framework also provides visualization and comparison of the optimal solutions in the case of multi-objective component allocation. The main contributions introduced in this paper are: (1) a novel methodology for tackling CAP-alike problems based on the usage of model-driven engineering (MDE) for both problem definition and solution representation; (2) a set of Python tools that enable the workflow starting from the CAP model interpretation, after that the generation of optimal allocations and, finally, result visualization. The proposed framework is compared to other similar works using either linear optimization, genetic algorithm (GA), and ant colony optimization (ACO) algorithm within the experiments based on notable papers on this topic, covering various usage scenarios—from Cloud and Fog computing infrastructure management to embedded systems, robotics, and telecommunications. According to the achieved results, our framework performs much faster than GA and ACO-based solutions. Apart from various benefits of adopting a multi-objective approach in many cases, it also shows significant speedup compared to frameworks leveraging single-objective linear optimization, especially in the case of larger problem models.

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 153067-153076
Author(s):  
Issam Al-Azzoni ◽  
Saqib Iqbal

2020 ◽  
Vol 12 (6) ◽  
pp. 2318 ◽  
Author(s):  
Oren E. Nahum ◽  
Yuval Hadas

In recent years, due to environmental concerns, there has been an increasing desire to develop alternative solutions to traditional energy sources. Since transportation is a significant fossil-fuel consumer, the development of electric vehicles, especially buses, has the potential to reduce fossil-fuel use and thus provide a better living environment. The aim of the current work was to develop an optimal allocation model for designing a system-wide network of wireless bus charging stations. The main advantages of wireless charging are the need for a much smaller battery and the fact that the charging process may occur under both static and dynamic (in-motion) conditions. The suggested approach consisted of a multi-objective model that selected the locations for the charging stations while (a) minimizing the costs, (b) maximizing the environmental benefit, and (c) minimizing the number of charging stations. The problem was formulated as a multi-objective non-linear optimization model with both deterministic and stochastic variations. An efficient genetic algorithm was introduced to solve the problem. A test case was used to demonstrate the model; accordingly, the decision-maker was provided with a solution set from which the best fit solution could be selected.


Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 558
Author(s):  
Taj-Aldeen Naser Abdali ◽  
Rosilah Hassan ◽  
Azana Hafizah Mohd Aman ◽  
Quang Ngoc Nguyen ◽  
Ahmed Salih Al-Khaleefa

Fog computing is an emerging technology. It has the potential of enabling various wireless networks to offer computational services based on certain requirements given by the user. Typically, the users give their computing tasks to the network manager that has the responsibility of allocating needed fog nodes optimally for conducting the computation effectively. The optimal allocation of nodes with respect to various metrics is essential for fast execution and stable, energy-efficient, balanced, and cost-effective allocation. This article aims to optimize multiple objectives using fog computing by developing multi-objective optimization with high exploitive searching. The developed algorithm is an evolutionary genetic type designated as Hyper Angle Exploitative Searching (HAES). It uses hyper angle along with crowding distance for prioritizing solutions within the same rank and selecting the highest priority solutions. The approach was evaluated on multi-objective mathematical problems and its superiority was revealed by comparing its performance with benchmark approaches. A framework of multi-criteria optimization for fog computing was proposed, the Fog Computing Closed Loop Model (FCCL). Results have shown that HAES outperforms other relevant benchmarks in terms of non-domination and optimality metrics with over 70% confidence of the t-test for rejecting the null-hypothesis of non-superiority in terms of the domination metric set coverage.


Author(s):  
Subhranshu Sekhar Tripathy ◽  
Diptendu Sinha Roy ◽  
Rabindra K. Barik

Nowadays, cities are intended to change to a smart city. According to recent studies, the use of data from contributors and physical objects in many cities play a key element in the transformation towards a smart city. The ‘smart city’ standard is characterized by omnipresent computing resources for the observing and critical control of such city’s framework, healthcare management, environment, transportation, and utilities. Mist computing is considered a computing prototype that performs IoT applications at the edge of the network. To maintain the Quality of Service (QoS), it is impressive to employ context-aware computing as well as fog computing simultaneously. In this article, the author implements an optimization strategy applying a dynamic resource allocation method based upon genetic algorithm and reinforcement learning in combination with a load balancing procedure. The proposed model comprises four layers i.e. IoT layer, Mist layer, Fog layer, and Cloud layer. Authors have proposed a load balancing technique called M2F balancer which regulates the traffic in the network incessantly, accumulates the information about each server load, transfer the incoming query, and disseminate them among accessible servers equally using dynamic resources allocation method. To validate the efficacy of the proposed algorithm makespan, resource utilization, and the degree of imbalance (DOI) are considered as the scheduling parameter. The proposed method is being compared with the Least count, Round Robin, and Weighted Round Robin. In the end, the results demonstrate that the solutions enhance QoS in the mist assisted cloud environment concerning maximization resource utilization and minimizing the makespan. Therefore, M2FBalancer is an effective method to utilize the resources efficiently by ensuring uninterrupted service. Consequently, it improves performance even at peak times.


Author(s):  
Karan Bajaj ◽  
Bhisham Sharma ◽  
Raman Singh

AbstractThe Internet of Things (IoT) applications and services are increasingly becoming a part of daily life; from smart homes to smart cities, industry, agriculture, it is penetrating practically in every domain. Data collected over the IoT applications, mostly through the sensors connected over the devices, and with the increasing demand, it is not possible to process all the data on the devices itself. The data collected by the device sensors are in vast amount and require high-speed computation and processing, which demand advanced resources. Various applications and services that are crucial require meeting multiple performance parameters like time-sensitivity and energy efficiency, computation offloading framework comes into play to meet these performance parameters and extreme computation requirements. Computation or data offloading tasks to nearby devices or the fog or cloud structure can aid in achieving the resource requirements of IoT applications. In this paper, the role of context or situation to perform the offloading is studied and drawn to a conclusion, that to meet the performance requirements of IoT enabled services, context-based offloading can play a crucial role. Some of the existing frameworks EMCO, MobiCOP-IoT, Autonomic Management Framework, CSOS, Fog Computing Framework, based on their novelty and optimum performance are taken for implementation analysis and compared with the MAUI, AnyRun Computing (ARC), AutoScaler, Edge computing and Context-Sensitive Model for Offloading System (CoSMOS) frameworks. Based on the study of drawn results and limitations of the existing frameworks, future directions under offloading scenarios are discussed.


2021 ◽  
Vol 117 ◽  
pp. 498-509
Author(s):  
Chu-ge Wu ◽  
Wei Li ◽  
Ling Wang ◽  
Albert Y. Zomaya

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1796
Author(s):  
Nerijus Morkevicius ◽  
Algimantas Venčkauskas ◽  
Nerijus Šatkauskas ◽  
Jevgenijus Toldinas

Fog computing is meant to deal with the problems which cloud computing cannot solve alone. As the fog is closer to a user, it can improve some very important QoS characteristics, such as a latency and availability. One of the challenges in the fog architecture is heterogeneous constrained devices and the dynamic nature of the end devices, which requires a dynamic service orchestration to provide an efficient service placement inside the fog nodes. An optimization method is needed to ensure the required level of QoS while requiring minimal resources from fog and end devices, thus ensuring the longest lifecycle of the whole IoT system. A two-stage multi-objective optimization method to find the best placement of services among available fog nodes is presented in this paper. A Pareto set of non-dominated possible service distributions is found using the integer multi-objective particle swarm optimization method. Then, the analytical hierarchy process is used to choose the best service distribution according to the application-specific judgment matrix. An illustrative scenario with experimental results is presented to demonstrate characteristics of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document