Krysha: Cost-Efficient Resource Orchestration for Geo-Distributed Serverless Microservices

Resource Allocation and Container Scaling for Microservices in Multi-Cluster Edge Computing System

With the advent of the 6G era and the evolution of distributed systems, edge computing has become a pivotal architecture for deploying latency-sensitive, resource-efficient applications. In particular, the microservice architecture, characterized by modular and loosely coupled components, has gained significant traction for building scalable and maintainable applications at the network edge. However, deploying microservice-based applications in heterogeneous and geographically distributed Multi-Cluster Edge Computing (MCEC) environments presents critical challenges, especially in achieving efficient and scalable resource management. Although existing research has explored resource allocation and container scaling for microservice-based systems, most prior works consider container efficiency in isolation or within single-cluster or cloud-centric environments, without jointly addressing container-level efficiency, inter-cluster task offloading, and resource allocation in MCEC scenarios. To address this gap, we propose RACCOON, a request-offloading cascaded resource allocation algorithm tailored for microservice-oriented deployments in MCEC settings. RACCOON aims to minimize user-perceived service latency while optimizing overall resource utilization. Complementing this, we introduce RASCAL, a reinforcement learning (RL)-based container scaling mechanism that dynamically adjusts resource provisioning at the container level to further enhance system performance. Experimental evaluation shows that our approach consistently outperforms methods that address only resource allocation, only task offloading, or only container scaling, by jointly optimizing these dimensions to reduce end-to-end user-perceived latency and computational overhead.

CoSIPR: Shared Service Orchestration with Dynamic Interest Coalitions in Edge Computing

Resource-intensive mobile edge computing (MEC) services are often provisioned on a per-request basis, resulting in repeated activation of equivalent service instances and redundant transmission of the same category-level state over overlapping inter-station links. Existing approaches rarely integrate demand aggregation, shared-instance provisioning, and reusable multi-target state distribution into a unified orchestration workflow. This paper proposes Coalition-based Shared Instance Provisioning and Routing (CoSIPR), a shared-service orchestration framework built around dynamic interest coalitions. CoSIPR predicts user requests and mobility, projects predicted locations onto the road network, filters unreliable or infeasible requests, and groups nearby users requesting the same service category. For each coalition, a marginal-gain-based candidate-reduction method and variable neighborhood search determine the serving stations, user assignments, and shared-instance counts. The selected stations then form the target set for a load-aware routing procedure that selects an existing state source and uses path-fusion reinforcement learning (PF-RL) to construct routes that reuse path segments across multiple targets. Experiments using real-world mobility and road-network data show that CoSIPR improves service-category matching, request satisfaction, and the average number of accepted requests per instance. It also reduces aggregate state-transfer cost and limits hotspot exposure while maintaining a controlled trade-off between end-to-end delay and state-transfer cost. These results demonstrate that dynamic interest coalitions and reusable multi-target paths can improve the efficiency of shared-service orchestration in MEC.

Multi-objective formulation of efficient microservice deployment in Kubernetes with dynamic resource allocation using hybrid nature-inspired algorithm

The primary innovation of this research is the development of an adaptive switching framework that integrates Clouded Leopard Optimization for robust global exploration with Cock-hen-chicken Optimization for hierarchical local refinement.

CERLA-SFC: hierarchical orchestration of cost-efficient, reliable and low-latency SFCs in multi-access edge computing

A Service-Defined Approach for Orchestration of Heterogeneous Applications in Cloud/Edge Platforms

A Service-Defined approach for orchestrating cloud/edge services in a distributed fashion, where each application can define its own orchestration strategy by means of declarative statements, which are parsed into a Service-Defined Orchestrator (SDO).

SLA-DE-RALBA: Cost-efficient dynamic enhanced resource-aware load balancing algorithm for cloud computing

Cloud computing has become a dominant paradigm for delivering scalable and flexible on-demand resources; however, efficiently executing high performance computing (HPC) workloads remains challenging, particularly in heterogeneous environments. Conventional static scheduling methods often lead to poor resource utilization and increased makespan, while dynamic approaches improve load distribution but introduce significant overhead due to continuous monitoring and real-time decision-making. To address these challenges, this paper proposes an SLA-aware Dynamic Enhanced Resource-Aware Load Balancing Algorithm (SLADE- RALBA). The algorithm minimizes load imbalance by considering the computational capacities of virtual machines and ensures Service Level Agreement (SLA) compliance through a three-tier priority-based workflow. The proposed approach is evaluated using CloudSim Plus on two benchmark datasets: Heterogeneous Computing Scheduling Problem (HCSP) instances and the Google Cloud Jobs dataset. Results demonstrate that SLA-DE-RALBA consistently outperforms baseline algorithms, including RALBA, DRALBA, DE-RALBA, SLA-RALBA, Dynamic Max- Min, PSSLB, and PSSELB, across key metrics such as makespan, resource utilization, job rejection, throughput, execution time, and cost. Notably, it achieves zero job rejection, reduces energy consumption by up to 85%, improves resource utilization by 11.9%, lowers makespan by 41-45%, and decreases execution time by up to 57%, making it a robust and efficient solution for HPC workload scheduling in cloud environments.