Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
5 results
Search Results
Item CoMCLOUD: Virtual Machine Coalition for Multi-Tier Applications over Multi-Cloud Environments(Institute of Electrical and Electronics Engineers Inc., 2023) Addya, S.K.; Satpathy, A.; Ghosh, B.C.; Chakraborty, S.; Ghosh, S.K.; Das, S.K.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 called CoMCLOUD to 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. © 2013 IEEE.Item InDS: Intelligent DRL Strategy for Effective Virtual Network Embedding of an Online Virtual Network Requests(Institute of Electrical and Electronics Engineers Inc., 2024) Keerthan Kumar, T.G.K.; Addya, S.K.; Koolagudi, S.G.Network virtualization is a demanding feature in the evolution of future Internet architectures. It enables on-demand virtualized resource provision for heterogeneous Virtual Network Requests (VNRs) from diverse end users over the underlying substrate network. However, network virtualization provides various benefits such as service separation, improved Quality of Service, security, and more prominent resource usage. It also introduces significant research challenges. One of the major such issues is allocating substrate network resources to VNR components such as virtual machines and virtual links, also named as the virtual network embedding, and it is proven to be mathbb {N}mathbb {P} -hard. To address the virtual network embedding problem, most of the existing works are 1) Single-objective, 2) They failed to address dynamic and time-varying network states 3) They neglected network-specific features. All these limitations hinder the performance of existing approaches. This work introduces an embedding framework called Intelligent Deep Reinforcement Learning (DRL) Strategy for effective virtual network embedding of an online VNRs (InDS). The proposed InDS uses an actor-critic model based on DRL architecture and Graph Convolutional Networks (GCNs). The GCN effectively captures dependencies between the VNRs and substrate network environment nodes by extracting both network and system-specific features. In DRL, the asynchronous advantage actor-critic agents can learn policies from these features during the training to decide which virtual machines to embed on which servers over time. The actor-critic helps in efficiently learning optimal policies in complex environments. The suggested reward function considers multiple objectives and guides the learning process effectively. Evaluation of simulation results shows the effectiveness of InDS in achieving optimal resource allocation and addressing diverse objectives, including minimizing congestion, maximizing acceptance, and revenue-to-cost ratios. The performance of InDS exhibits superiority in achieving 28% of the acceptance ratio and 45% of the revenue-to-cost ratio by effectively managing the network congestion compared to other existing baseline works. © 2013 IEEE.Item Optimizing Completion Time of Requests in Serverless Computing(Springer, 2024) Sherawat, A.; Nath, S.B.; Addya, S.K.Serverless computing offers people with the liberty of not thinking about the backend side of the things in an application development. They are scalable and cost efficient as they provide pay-for-use service. Providing acceptable performance while having no knowledge about the kind of application is the main challenge the cloud providers have. Many applications may have the need to be completed before the deadline. In that case, the request has to be completed before the deadline or else it will lead to service level agreement violation. If the cloud provider completes the requests faster, there would be less SLA violations. This will also reduce cost for the user as the functions will be completed sooner. Therefore, improving the completion time of the requests will benefit the user as well as the provider. In this paper, we present a method to improve the completion time of requests using genetic algorithm for allocation of requests to virtual machines that could provide optimal completion time for them. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.Item DCRDA: deadline-constrained function scheduling in serverless-cloud platform(Springer, 2025) Birajdar, P.A.; Meena, D.; Satpathy, A.; Addya, S.K.The serverless computing model frees developers from operational and management tasks, allowing them to focus solely on business logic. This paper addresses the computationally challenging function-container-virtual machine (VM) scheduling problem, especially under stringent deadline constraints. We propose a two-stage holistic scheduling framework called DCRDA targeting deadline-constrained function scheduling. In the first stage, the function-to-container scheduling is modeled as a one-to-one matching game and solved using the classical Deferred Acceptance Algorithm (DAA). The second stage addresses the container-to-VM assignment, modeled as a many-to-one matching problem, and solved using a variant of the DAA, the Revised-Deferred Acceptance Algorithm (RDA), to account for heterogeneous resource demands. Since matching-based strategies require agent preferences, a Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) ranking mechanism is employed to prioritize alternatives based on execution time, deadlines, and resource demands. The primary goal of DCRDA is to maximize the success ratio (SR), defined as the ratio of functions executed within the deadline to the total functions. Extensive test-bed validations over commercial providers such as Amazon EC2 show that the proposed framework significantly improves the success ratio compared to baseline approaches. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.Item SEDViN: Secure embedding for dynamic virtual network requests using a multi-attribute matching game(Academic Press Inc., 2025) Kumar, T.G.K.; Kumar, R.; Achal, A.M.; Satpathy, A.; Addya, S.K.Network virtualization (NV) has gained significant attention as it allows service providers (SP) to share substrate network (SN) resources. It is achieved by partitioning them into isolated virtual network requests (VNRs) comprising interrelated virtual machines (VMs) and virtual links (VLs). Although NV provides various advantages, such as service separation, enhanced quality-of-service, reliability, and improved SN utilization, it also presents multiple scientific challenges. In this context, one pivotal challenge encountered by the researchers is secure virtual network embedding (SVNE). The SVNE encompasses assigning SN resources to components of VNR, i.e., VMs and VLs, adhering to the security demands, which is a computationally intractable problem, as it is proven to be NP-Hard. In this context, maximizing the acceptance and revenue-to-cost ratios remains of utmost priority for SPs as it not only increases the revenue but also effectively utilizes the large pool of SN resources. Though VNE is a well-researched problem, the existing literature has the following flaws: (i.) security features of VMs and VLs are ignored, (ii.) limited consideration of topological attributes, and (iii.) restricted to static VNRs. However, SPs need to develop an embedding framework that overcomes the abovementioned pitfalls. Therefore, this work proposes a framework Secure Embedding for Dynamic Virtual Network requests using a multi-attribute matching game (SEDViN). In SedViN, the deferred acceptance algorithm (DAA) based matching game is used for effective embedding. SEDViN operates primarily in two steps to obtain a secure embedding of dynamic VNRs. Firstly, it generates a unified ranking for VMs and servers using a combination of entropy and a technique for order of preference by similarity to the ideal solution (TOPSIS), considering network, security, and system attributes. Taking these as inputs, in the second step, VNR embedding is conducted using the deferred acceptance approach based on a one-to-many matching strategy for VM embedding and VL embedding using the shortest path algorithm. The performance of SEDViN is evaluated through simulations and compared against different baseline approaches. The simulation outcomes exhibit that SEDViN surpasses the baselines with a gain of 56% in the acceptance and 44% in the revenue-to-cost ratios. © 2025 Elsevier Inc.