Scheduling Service Updates: A Multi-arm Bandit Approach


  • V S Ch Lakshmi Narayana Modem Systems Engineer, Qualcomm India Pvt Ltd, Bengaluru, 560066, India
  • Sucheta Ravikanti Fixed Income Division Associate, Morgan Stanley, Mumbai, 400098, India
  • Harsh Deshpande University of California San Diego, San Diego, CA 92093, USA
  • Sharayu Moharir Department of Electrical Engineering, Indian Institute of Technology, Bombay, 400076, India


edge computing, multi-arm bandits, scheduling


Software as a Service (SaaS) instances often use edge resources to serve their customers. The version of the service hosted at the edge needs to be periodically updated to maximize the utility derived by the customers. We focus on scheduling updates in the setting where the utility derived from a version is an unknown decreasing function of the time elapsed since the version was created. We map the scheduling problem to a multi-arm bandit and propose an update policy. We characterize its performance and compare it with the fundamental limit on the performance of any online policy.




How to Cite

Narayana, V. S. C. L., Ravikanti, S., Deshpande, H. ., & Moharir, S. (2022). Scheduling Service Updates: A Multi-arm Bandit Approach. Computer Networks and Communications, 1(1), 18–30. Retrieved from