Sourav Kanti Addya

Dr. Sourav Kanti Addya

Department of Computer Science and Engineering, National Institute of Technology Karnataka, Mangalore 575025, India
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2018 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
ASAnurag Satpathy
Anurag Satpathy
SASourav Kanti Addya
Sourav Kanti Addya
ATAshok Turuk
Ashok Turuk
BMBanshidhar Majhi
Banshidhar Majhi
GSGadadhar Sahoo
Gadadhar Sahoo

26 October 2021 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
SASourav Kanti Addya
Sourav Kanti Addya
ASAnurag Satpathy
Anurag Satpathy
BGBishakh Chandra Ghosh
Bishakh Chandra Ghosh
SCSandip Chakraborty
Sandip Chakraborty
SGSoumya K. Ghosh
Soumya K. Ghosh
SSajal K. Das
Sajal K. Das
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.

6 June 2022
Verified
Conference Paper
Open access
AJAkash Puliyadi Jegannathan
Akash Puliyadi Jegannathan
RSRounak Saha
Rounak Saha
SASourav Kanti Addya
Sourav Kanti Addya
Serverless computing is a buzzword that is being used commonly in the world of technology and among developers and businesses. Using the Function-as-a-Service (FaaS) model of serverless, one can easily deploy their applications to the cloud and go live in a matter of days, it facilitates the developers to focus on their core business logic and the backend process such as managing the infrastructure, scaling of the application, updation of software and other dependencies is handled by the Cloud Service Provider. One of the features of serverless computing is ability to scale the containers to zero, which results in a problem called cold start. The challenging part is to reduce the cold start latency without the consumption of extra resources. In this paper, we use SARIMA (Seasonal Auto Regressive Integrated Moving Average), one of the classical time series forecasting models to predict the time at which the incoming request comes, and accordingly increase or decrease the amount of required containers to minimize the resource wastage, thus reducing the function launching time. Finally, we implement PBA (Prediction Based Autoscaler) and compare it with the default HPA (Horizontal Pod Autoscaler), which comes inbuilt with kubernetes. The results showed that PBA performs fairly better than the default HPA, while reducing the wastage of resources.

9 October 2018 in IEEE Systems Journal
Verified
Journal Article
Closed access
SASourav Kanti Addya
Sourav Kanti Addya
ATAshok Turuk
Ashok Turuk
ASAnurag Satpathy
Anurag Satpathy
Bibhudatta SahooBibhudatta Sahoo
Bibhudatta Sahoo
Mahasweta SarkarMahasweta Sarkar
Mahasweta Sarkar
Migration of virtual machines (VMs) from one data center to another is essential to deal with scenarios such as load balancing, maintenance, power management, VM failures, etc. Application of VM migration is not only limited to a single cloud service provider, but also to inter-cloud architectures such as cloud federation. Migration in a federation is a complex operation as it encompasses many autonomous service providers with different standards, rules, and protocols. Migration can be carried out in two ways, first, live and, second, non-live. In case of live migration, a VM continues to execute at the source in contrast to non-live where its execution is suspended. In this paper, a framework for secure live migration of VMs in a cloud federation is proposed. Costs associated with it is analyzed for serial, parallel, and improved serial strategies. The proposed framework is simulated using a CloudSim simulator. Metrics considered for evaluation are communication overhead, migration time, and downtime. Further, power consumption for all strategies is calculated and compared. It is observed that downtime is least for parallel, whereas migration time is least for improved serial. The power consumption is highest for parallel and least for improved serial.

4 January 2023
Verified
Conference Paper
Open access
BSBiswajeet Sethi
Biswajeet Sethi
SASourav Kanti Addya
Sourav Kanti Addya
SGSoumya K. Ghosh
Soumya K. Ghosh
Serverless computing offers "Function-as-a-Service"(FaaS), which promotes an application in the form of independent granular components called functions. FaaS goes well as a widespread standard that facilitates the development of applications in cloud-based environments. Clients can solely focus on developing applications in a serverless ecosystem, passing the overburden of resource governance to the service providers. However, FaaS platforms have to bear the degradation in performance originating from the cold starts of executables i.e. serverless functions. The cold start reflects the delay in provisioning a runtime container that processes the functions. Each serverless platform is handling the problem of cold start with its own solution. In recent times, approaches to deal with cold starts have received the attention of many researchers. This paper comes up with an extensive solution to handle the cold start problem. We propose a scheduling approach to reduce the cold start occurrences by keeping the containers alive for a longer period of time using the Least Recently Used warm Container Selection (LCS ) approach on Affinity-based scheduling. Further, we carried out an evaluation and compared the obtained results with the MRU container selection approach. The proposed LCS approach outperforms by approximately 48% compared to the MRU approach.

1 December 2019
Verified
Conference Paper
Closed access
SNShubha Brata Nath
Shubha Brata Nath
SCSubhrendu Chattopadhyay
Subhrendu Chattopadhyay
RKRaja Karmakar
Raja Karmakar
SASourav Kanti Addya
Sourav Kanti Addya
SCSandip Chakraborty
Sandip Chakraborty
SGSoumya K. Ghosh
Soumya K. Ghosh
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.