ABSTRACT Virtual Network Embedding (VNE) plays a crucial role in optimizing physical network (PN) resource utilization in network virtualization and delivering service benefits such as isolation, cost efficiency, flexibility, security, and Quality of Service (QoS) to end users. Despite its importance, VNE faces significant challenges, such as assigning resources to Virtual Network Requests (VNRs) to drive lower energy consumption, which can unfavorably affect network performance. VNE constitutes two corresponding subproblems: virtual machine embedding and virtual link embedding, and both problems are treated as hard. In this context, minimizing energy consumption remains vital for SPs by effectively utilizing PN resources, as it not only increases the revenue‐to‐cost ratio but also enhances the acceptance of VNRs. This work introduces a novel heuristic framework called the Multi‐Attributed Traffic Intensity Based Energy Aware Embedding for Online Virtual Network Requests (IViN) framework, designed to enhance the acceptance ratio while minimizing energy consumption. IViN considers a multi‐attribute approach from system and network features in its heuristic ranking mechanism to rank virtual machines and servers during virtual machine embedding, followed by a virtual link assignment using the shortest path approach. These attributes play a crucial role in effectively capturing the dependencies between network elements. This helps IViN achieve energy‐sensitive resource allocation and improves VNR acceptance and revenue‐to‐cost ratio. We validate the proposed approach by comparing it with existing methods through simulation experiments. The results show that IViN outperforms the baseline techniques by achieving improvements of 41%, 60%, and 34% in acceptance ratio, revenue‐to‐cost ratio, and energy consumption, respectively.

Fog computing plays a prominent role in offloading computational tasks in heterogeneous environments since it provides less service delay than traditional cloud computing. The Internet of Things (IoT) devices cannot handle complex tasks due to less battery power, storage and computational capability. Full offloading has issues in providing efficient computation delay due to more response time and transmission cost. A suitable solution to overcome this problem is to partition the tasks into splittable subtasks. Considering multi-criteria decision parameters like processing efficiency and deadline helps to achieve efficient resource allocation and task assignment. The matching theory is applied to map task nodes to heterogeneous fog nodes and VMs for stability. Compared to baseline algorithms, proposed algorithms like Resource Allocation based on Processing Efficiency (RABP) and Task Assignment Based on Completion Time (TAC) are efficient enough to provide reasonable service delay and discard the non-beneficial tasks, i.e., tasks that do not execute within the deadline.

Applications hosted in commercial clouds are typically multi-tier and comprise multiple tightly coupled virtual machines (VMs). Service providers (SPs) cater to the users using VM instances with different configurations and pricing depending on the location of the data center (DC) hosting the VMs. However, selecting VMs to host multi-tier applications is challenging due to the trade-off between cost and quality of service (QoS) depending on the placement of VMs. This paper proposes a multi-cloud broker model calledCoMCLOUDto select a sub-optimal VM coalition for multi-tier applications from an SP with minimum coalition pricing and maximum QoS. To strike a trade-off between the cost and QoS, we use an ant-colony-based optimization technique. The overall service selection game is modeled as a first-price sealed-bid auction aimed at maximizing the overall revenue of SPs. Further, as the hosted VMs often face demand spikes, we present a parallel migration strategy to migrate VMs with minimum disruption time. Detailed experiments show that our approach can improve the federation profit up to 23% at the expense of increased latency of approximately 15%, compared to the baselines.

Virtual machine (VM) migration enables cloud service providers (CSPs) to balance workload, perform zero-downtime maintenance, and reduce applications’ power consumption and response time. Migrating a VM consumes energy at the source, destination, and backbone networks, i.e., intermediate routers and switches, especially in a Geo-distributed setting. In this context, we propose a VM migration model called Low Energy Application Workload Migration (LEAWM) aimed at reducing the per-bit migration cost in migrating VMs over Geo-distributed clouds. With a Geo-distributed cloud connected through multiple Internet Service Providers (ISPs), we develop an approach to find out the migration path across ISPs leading to the most feasible destination. For this, we use the variation in the electricity price at the ISPs to decide the migration paths. However, reduced power consumption at the expense of higher migration time is intolerable for real-time applications. As finding an optimal relocation is$\mathcal {NP}$-Hard, we propose anAnt Colony Optimization(ACO) based bi-objective optimization technique to strike a balance between migration delay and migration power. A thorough simulation analysis of the proposed approach shows that the proposed model can reduce the migration time by 25%–30% and electricity cost by approximately 25% compared to the baseline.

With the increasing adoption of private blockchain platforms, consortia operating in various sectors such as trade, finance, logistics, etc., are becoming common. Despite having the benefits of a completely decentralized architecture which supports transparency and distributed control, existing private blockchains limit the data, assets, and processes within its closed boundary, which restricts secure and verifiable service provisioning to the end-consumers. Thus, platforms such as e-commerce with multiple sellers or cloud federation with a collection of cloud service providers cannot be decentralized with the existing blockchain platforms. This paper proposes a decentralized gateway architecture interfacing private blockchain with end-users by leveraging the unique combination of public and private blockchain platforms through interoperation. Through the use case of decentralized cloud federations, we have demonstrated the viability of the solution. Our testbed implementation with Ethereum and Hyperledger Fabric, with three service providers, shows that such consortium can operate within an acceptable response latency while scaling up to 64 parallel requests per second for cloud infrastructure provisioning. Further analysis over the Mininet emulation platform indicates that the platform can scale well with minimal impact over the latency as the number of participating service providers increases.

In the presence of latency sensitive geo-distributed applications, users require fast service for their queries. Cloud computing provides physical servers from its data center in order to process user requests. The cloud data center consumes a huge amount of energy due to lack of management of the data center servers as the container-based service consolidation is a nontrivial task. Since the containers require less resource footprint, consolidating it in servers might make resource availability sparse. In order to reduce the energy consumption of the cloud data center, we have proposed a green container-based consolidation of the services so that the maximum number of servers can be put into idle mode without affecting the application quality of experience. The service consolidation problem has been formulated as an optimization problem considering minimization of total energy consumption of the data center as the objective, and an algorithm named Energy Aware Service consolidation using baYesian optimization (EASY) has been proposed to solve the optimization. We have evaluated the EASY algorithm in simulation using python. The experimental results have shown that EASY improves the total energy consumption of the data centers. This improvement comes at the cost of a small increase of service response time as there exists a trade-off between energy consumption and service response time.

This paper proposes a virtual machine (VM) migration model to reduce the power consumption while migrating a set of VMs over geo-distributed clouds. We develop an approach to find out the migration path across different Internet Service Providers (ISPs) leading to the most feasible destination. For this, we make use of the variation in the electricity price at the ISPs for deciding the migration paths. However, reduced power consumption at the expense of higher migration time is intolerable for real-time applications. Hence, we propose an Ant Colony Optimization (ACO) based bi-objective optimization technique to strike a balance between the power consumption and the migration time to make the implementation realistic. Thorough simulation analysis of the proposed approach shows that it can achieve low power consumption cost with acceptable migration time.

In the presence of the Internet of Things (IoT) devices, the end-users require a response within a short amount of time which the cloud computing alone cannot provide. Fog computing plays an important role in the presence of IoT devices in order to meet such delay requirements. Though beneficial in these latency-sensitive scenarios, the fog has several implementation challenges. In order to solve the problem of micro-service placement in the fog devices, we propose a framework with the objective of achieving low response time. This problem has been formulated as an optimization problem to improve the response time by considering the time-varying resource availability of the fog devices as constraints. We propose an orchestration framework named Pick-Test-Choose (PTC) to solve the problem. PTC uses Bayesian Optimization based iterative reinforcement learning algorithm to find out a micro-service allocation based on the current workload of the fog devices. PTC employs containers for service isolation and migration of the micro-services. The proposed architecture is implemented over an in-house testbed as well as in iFogSim simulator. The experimental results show that the proposed framework performs better in terms of response time compared to various other baselines.