Sushila Sonare

Work place: Department of Computer Science and Engineering, Oriental Institute of Science and Technology, Bhopal, India

E-mail: sushilasonare@oriental.ac.in

Website: https://orcid.org/0000-0003-3730-5548

Research Interests: Machine Learning, Computer Networks, Data Mining, Big Data Analytics, Deep Learning, NLP

Biography

Dr. Sushila Sonare was born in India on August 22, 1982. She received the Engineering degree, B.E. in Computer Science and engineering from Govt. engineering college, Jabalpur (Madhya Pradesh) in 2006, post graduate degree M. Tech. in Computer Science and Engineering from NIT Calicut, Kerala in 2009 and the PhD Degree in Computer science and Engineering from LNCTU in 2022. She is currently an Associate Professor in the Department of Computer Science and Engineering (Cyber Security), at Oriental College of Technology, Madhya Pradesh, India. She has working experience as 15+ years including industrial and teaching. Her research interest fields are machine learning, deep learning, data mining, NLP, Data Analysis and computer network.

Author Articles
Online Confidence-Gated LSTM-DQN for Dynamic Cloud Resource Allocation

By Preeti Puranik Sushila Sonare

DOI: https://doi.org/10.5815/ijwmt.2026.04.25, Pub. Date: 8 Aug. 2026

Cloud schedulers that pair workload prediction with reinforcement learning (RL) rarely check whether a given prediction can actually be trusted, and earlier confidence-gated designs often mix current and future information inconsistently. We fix that inconsistency and build a causally consistent, confidence-gated LSTM-DQN scheduler: an LSTM forecasts next-step workload, a retrospective, error-based confidence score gates how much a Deep Q-Network (DQN) scheduler leans on that forecast, and only information available at decision time is ever used. We implement and pilot-test this architecture in a Python-based discrete-event simulation configured to match a CloudSim-style environment (10 hosts, 30 VMs), benchmarking it against FCFS, Round Robin, standard RL, two ablation variants, and two simplified state-of-the-art comparators across five random seeds. The results show the method works as intended: it trains stably and safely on every seed, holds response time and SLA violations in line with standard RL and simple heuristics, and clearly outperforms a metaheuristic-augmented Q-learning baseline, which suffered severe instability under the same conditions. Code, raw results, and statistical tests are released for independent verification, with scaled-up training identified as the natural next step to test whether larger performance gains emerge.

[...] Read more.
Other Articles