Sourav Kanti Addya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sourav Kanti Addya has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Anurag Satpathy
Department of Computer Science, Missouri University of Science and Technology, Rolla, MO, USA
11 shared publications - Soumya Kanti Ghosh
Indian Institute of Technology Kharagpur
8 shared publications - Bibhudatta Sahoo
Department of Computer Science and Engineering, National Institute of Technology, Rourkela, India
6 shared publications - T. G. Keerthan Kumar
Department of Information Science and Engineering, Siddaganga Institute of Technology, Tumkur, India
6 shared publications Ashok Kumar Turuk
National Institute of Technology Rourkela, India
5 shared publications- Sandip Chakraborty
IIT Kharagpur, Kharagpur, West Bengal, India
4 shared publications
Latest Publications
- 8 September 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 181
MARViC: Multi-attribute driven resource allocation for virtual network embedding in Cloud networks
- 8 September 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 181
MARViC: Multi-attribute driven resource allocation for virtual network embedding in Cloud networks
- 6 July 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 193
Trajectory-aware predictive handover framework for task offloading in vehicular edge networks
- 6 July 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 193
Trajectory-aware predictive handover framework for task offloading in vehicular edge networks
- 27 April 2026
- Published by Elsevier in Computer Communications
- Vol. 254
LEaD: Latency and Energy-aware load balancing for Dependent and independent tasks in IoT-fog networks
- 27 April 2026
- Published by Elsevier in Computer Communications
- Vol. 254
LEaD: Latency and Energy-aware load balancing for Dependent and independent tasks in IoT-fog networks
- Open Access
- 5 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 158-162
PURE: A Predictive Path based UAV-IoT Network for Response oriented Energy-efficient Border Monitoring
- 5 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 158-162
Open AccessPURE: A Predictive Path based UAV-IoT Network for Response oriented Energy-efficient Border Monitoring
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 103508-103530
IDEAL: Impact-Aware Virtual Data Center Embedding With Incremental Analysis for SDN-Controlled Networks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 103508-103530
Open AccessIDEAL: Impact-Aware Virtual Data Center Embedding With Incremental Analysis for SDN-Controlled Networks
- Open Access
- 17 October 2025
- Published by Springer Nature in Research Square
InterFlux : An Inter-Region Serverless Orchestration Service to Extenuate Latency in Data Intensive Applications
Serverless computing emerges as a new standard to build cloud applications, where developers write compact functions that respond to events in the cloud infrastructure. Several cloud service industries started adopting serverless for running their applications. With increased popularity of serverless computing, the demand for an orchestration service has also become important. Popular serverless service providers have come up with various orchestration services such as Amazon's Step Functions and Azure's Logic App. But these orchestration services have their own limitations. One key limitation of serverless computing is that it disregards the significance of data. In the age of big data, when applications run around a huge volume, transferring data for processing across regions, leads to high communication latency. Again, popular serverless service providers such as Amanzon Web Services(AWS) and Microsoft etc do not provide any orchestration service where the service can access to resources from other regions. In this paper, we proposed an orchestration framework InterFlux. InterFlux completely eradicates the need of region wise deployment of serverless applications. Also, InterFlux allows orchestration services to access resources from cross regions with a highly restricted data transmission latency. We evaluated the performance of proposed InterFlux on AWS's orchestration services, AWS Step Functions. InterFlux performs 82.6% better compared to its data pulling implementation.
- 17 October 2025
- Published by Springer Nature in Research Square
Open AccessInterFlux : An Inter-Region Serverless Orchestration Service to Extenuate Latency in Data Intensive Applications
Serverless computing emerges as a new standard to build cloud applications, where developers write compact functions that respond to events in the cloud infrastructure. Several cloud service industries started adopting serverless for running their applications. With increased popularity of serverless computing, the demand for an orchestration service has also become important. Popular serverless service providers have come up with various orchestration services such as Amazon's Step Functions and Azure's Logic App. But these orchestration services have their own limitations. One key limitation of serverless computing is that it disregards the significance of data. In the age of big data, when applications run around a huge volume, transferring data for processing across regions, leads to high communication latency. Again, popular serverless service providers such as Amanzon Web Services(AWS) and Microsoft etc do not provide any orchestration service where the service can access to resources from other regions. In this paper, we proposed an orchestration framework InterFlux. InterFlux completely eradicates the need of region wise deployment of serverless applications. Also, InterFlux allows orchestration services to access resources from cross regions with a highly restricted data transmission latency. We evaluated the performance of proposed InterFlux on AWS's orchestration services, AWS Step Functions. InterFlux performs 82.6% better compared to its data pulling implementation.
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 8, 1-4
RUSH: Rule-Based Scheduling for Low-Latency Serverless Computing
Serverless computing abstracts server management, enabling developers to focus on application logic while benefiting from automatic scaling and pay-per-use pricing. However, dynamic workloads pose challenges in resource allocation and response time optimization. Response time is a critical performance metric in serverless environments, especially for latency-sensitive applications, where inefficient scheduling can degrade user experience and system efficiency. This paper proposes RUSH (Rule-based Scheduling for Low-Latency Serverless Computing), a lightweight and adaptive scheduling framework designed to reduce cold starts and execution delays. RUSH employs a set of predefined rules that consider system state, resource availability, and timeout thresholds to make proactive, latency-aware scheduling decisions. We implement and evaluate RUSH on a real-world serverless application that generates emoji meanings. Experimental results demonstrate that RUSH consistently outperforms First-Come-First-Served (FCFS), Random Scheduling, and Profaastinate, achieving ≈ 33% reduction in average execution time.
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- Vol. 8, 1-4
RUSH: Rule-Based Scheduling for Low-Latency Serverless Computing
Serverless computing abstracts server management, enabling developers to focus on application logic while benefiting from automatic scaling and pay-per-use pricing. However, dynamic workloads pose challenges in resource allocation and response time optimization. Response time is a critical performance metric in serverless environments, especially for latency-sensitive applications, where inefficient scheduling can degrade user experience and system efficiency. This paper proposes RUSH (Rule-based Scheduling for Low-Latency Serverless Computing), a lightweight and adaptive scheduling framework designed to reduce cold starts and execution delays. RUSH employs a set of predefined rules that consider system state, resource availability, and timeout thresholds to make proactive, latency-aware scheduling decisions. We implement and evaluate RUSH on a real-world serverless application that generates emoji meanings. Experimental results demonstrate that RUSH consistently outperforms First-Come-First-Served (FCFS), Random Scheduling, and Profaastinate, achieving ≈ 33% reduction in average execution time.