DPS – Page 14 – ITEC Homepage

Announcement, DPS, Project, Publication, Research Areas

The paper “Monte-Carlo Approach to the Computational Capacities Analysis of the Computing Continuum” has been accepted to the main-track of the International Conference on Computational Science (ICCS’2021)

The full paper has been accepted to the main-track of the International Conference on Computational Science (ICCS’21). Conference will be organized in a virtual format on 16-18 June, 2021.

Title: Monte-Carlo Approach to the Computational Capacities Analysis of the Computing Continuum

Authors: Vladislav Kashansky, Gleb Radchenko, Radu Prodan

Abstract: This article proposes an approach to the problem of computational capacities analysis of the computing continuum via theoretical framework of equilibrium phase-transitions and numerical simulations. We introduce the concept of phase transitions in computing continuum and show how this phenomena can be explored in the context of workflow makespan, which we treat as an order parameter. We simulate the behavior of the computational network in the equilibrium regime within the framework of the XY-model defined over complex agent network with Barabasi-Albert topology. More specifically, we define Hamiltonian over complex network topology and sample the resulting spin-orientation distribution with the Metropolis-Hastings technique. The key aspect of the paper is derivation of the bandwidth matrix, as the emergent effect of the “low-level” collective spin interaction. This allows us to study the first order approximation to the makespan of the “high-level” system-wide workflow model in the presence of data-flow anisotropy and phase transitions of the bandwidth matrix controlled by the means of “noise regime” parameter. For this purpose, we have built a simulation engine in Python 3.6. Simulation results confirm existence of the phase transition, revealing complex transformations in the computational abilities of the agents. Notable feature is that bandwidth distribution undergoes a critical transition from single to multi-mode case. Our simulations generally open new perspectives for reproducible comparative performance analysis of the novel and classic scheduling algorithms.

Keywords: Complex Networks, Computing Continuum, Phase Transitions, Computational Model, MCMC, Metropolis-Hastings, XY-model, Equilibrium Model

Acknowledgement: This work has received funding from the EC-funded project H2020 FETHPC ASPIDE (Agreement #801091)

March 18, 2021

Announcement, DPS, Publication

Paper accepted at the 5th IEEE ICFEC 2021

The paper “Multilayer Resource-aware Partitioning for Fog Application Placement” has been accepted for publication at the 5th IEEE international conference on Fog and Edge computing 2021 (ICFEC 2021) , with an acceptance rate of 17% for regular papers.

Authors: Zahra Najafabadi Samani, Nishant Saurabh, Radu Prodan

Abstract: Fog computing emerged as a crucial platform for the deployment of IoT applications. The complexity of such applications requires methods that handle the resource diversity and network structure of Fog devices, while maximizing the service placement and reducing resource wastage. Prior studies in this domain primarily focused on optimizing application-specific requirements and fail to address the network topology combined with the different types of resources encountered in Fog devices. To overcome these problems, we propose a multilayer resource-aware partitioning method to minimize the resource wastage and maximize the service placement and deadline satisfaction rates in a Fog infrastructure with high multi-user application placement requests. Our method represents the heterogeneous Fog resources as a multilayered network graph and partitions them based on network topology and resource features. Afterward, it identifies the appropriate device partitions for placing an application according to its requirements, which need to overlap in the same network topology partition. Simulation results show that our multilayer resource-aware partitioning method is able to place twice as many services, satisfy deadlines for three times as many application requests, and reduce the resource wastage up to 15-32 times compared to two availability and resource-aware state-of-the-art methods.

March 1, 2021

Announcement, DPS, Publication, Research Areas

Paper accepted at the 21st IEEE/ACM international Symposium on Cluster, Cloud and Internet Computing (CCGrid 2021)

The paper “A Two-Sided Matching Model for Data Stream Processing in the Cloud–Fog Continuum” has been accepted for publication at the 21st IEEE/ACM international Symposium on Cluster, Cloud and Internet Computing (CCGrid 2021).

Authors: Narges Mehran, Dragi Kimovski , and Radu Prodan

Abstract: Latency-sensitive and bandwidth-intensive stream processing applications are dominant traffic generators over the Internet network. A stream consists of a continuous sequence of data elements, which require processing in nearly real-time. To improve communication latency and reduce the network congestion, Fog computing complements the Cloud services by moving the computation towards the edge of the network. Unfortunately, the heterogeneity of the new Cloud–Fog continuum raises important challenges related to deploying and executing data stream applications. We explore in this work a two-sided stable matching model called Cloud–Fog to data stream application matching (CODA) for deploying a distributed application represented as a workflow of stream processing microservices on heterogeneous Cloud–Fog computing resources. In CODA, the application microservices rank the continuum resources based on their microservice stream processing time, while resources rank the stream processing microservices based on their residual bandwidth. A stable many-to-one matching algorithm assigns microservices to resources based on their mutual preferences, aiming to optimize the complete stream processing time on the application side, and the total streaming traffic on the resource side.
We evaluate the CODA algorithm using simulated and real-world Cloud–Fog scenarios. We achieved 11 to 45 % lower stream processing time and 1.3 to 20 % lower streaming traffic compared to related state-of-the-art approaches.

February 12, 2021

Announcement, DPS, Project, Publication

DataCloud online kickoff meeting.

January 19, 2021

Announcement, DPS, Project, Publication, Research Areas

ITEC@AAU coordinates the project Kärntner Fog

The project “Kärntner Fog: A 5G-Enabled Fog Infrastructure for Automated Operation of Carinthia’s 5G Playground Application Use Cases” proposes a new infrastructure automation use case in the 5G Playground Carinthia (5GPG). Kärntner Fog plans to create and deploy a
distributed service middleware infrastructure over a diverse set of novel heterogeneous 5G edge devices, complemented by a high-performance Cloud data center accessible with low latency according to 5G standards. Such an infrastructure is currently missing in the 5GPG and will represent a horizontal backbone that interconnects and integrates the application use cases. Kärtner Fog will automate the development and operation of the applications use cases in the 5GPG in an integrated and more cost-effective fashion to enable more science and innovation within a limited budget.

Involved Organisations: BABEG, ITEC@AAU, ONDA TLC GmbH, FFG/KWF

Coordinator: Prof. Radu Prodan
Project Start: 01.01.2021
Project Duration: 48 months

January 11, 2021

Announcement, DPS, Project

Paper accepted in IEEE Internet Computing: “Cloud, Fog or Edge: Where to Compute?”

The manuscript “Cloud, Fog or Edge: Where to Compute?” has been accepted for publication in an upcoming issue of IEEE Internet Computing.

Authors: Dragi Kimovski, Roland Mathá, Josef Hammer, Narges Mehran, Hermann Hellwagner and Radu Prodan

Abstract: The computing continuum extends the high-performance cloud data centers with energy-efficient and low-latency devices close to the data sources located at the edge of the network.
However, the heterogeneity of the computing continuum raises multiple challenges related to application management. These include where to offload an application – from the cloud to the edge – to meet its computation and communication requirements.
To support these decisions, we provide in this article a detailed performance and carbon footprint analysis of a selection of use case applications with complementary resource requirements across the computing continuum over a real-life evaluation testbed.

January 7, 2021

Announcement, DPS, Publication, Research Areas

Paper accepted in IEEE UCC

IEEE/ACM 13th International Conference on Utility and Cloud Computing (UCC) accepted the paper “Dynamic Multi-objective Scheduling of Microservices in the Cloud”.

Authors: Hamid Mohammadi Fard, Radu Prodan, Felix Wolf

Abstract: For many applications, a microservices architecture promises better performance and flexibility compared to a conventional monolithic architecture. In spite of the advantages of a microservices architecture, deploying microservices poses various challenges for service developers and providers alike. One of these challenges is the efficient placement of microservices on the cluster nodes. Improper allocation of microservices can quickly waste resource capacities and cause low system throughput. In the last few years, new technologies in orchestration frameworks, such as the possibility of multiple schedulers for pods in Kubernetes, have improved scheduling solutions of microservices but using these technologies needs to involve both the service developer and the service provider in the behavior analysis of workloads. Using memory and CPU requests specified in the service manifest, we propose a general microservices scheduling mechanism that can operate efficiently in private clusters or enterprise clouds. We model the scheduling problem as a complex variant of the knapsack problem and solve it using a multi-objective optimization approach. Our experiments show that the proposed mechanism is highly scalable and simultaneously increases utilization of both memory and CPU, which in turn leads to better throughput when compared to the state-of-the-art.

January 6, 2021