Optimizing Service Stipulation Uncertainty with Deep Reinforcement Learning for Internet Vehicle Systems

Creative Commons License

Nain Z., Shahana B., Chaudhry S. A., Viswanathan P., Mekala M., Kim S. W.

Computers, Materials and Continua, vol.74, no.3, pp.5705-5721, 2023 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 74 Issue: 3
  • Publication Date: 2023
  • Doi Number: 10.32604/cmc.2023.033194
  • Journal Name: Computers, Materials and Continua
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Communication Abstracts, Compendex, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Page Numbers: pp.5705-5721
  • Keywords: feasible node selection methods, Fog computing, measurement models, performance metrics, task allocation
  • Istanbul Gelisim University Affiliated: Yes


© 2023 Tech Science Press. All rights reserved.Fog computing brings computational services near the network edge to meet the latency constraints of cyber-physical System (CPS) applications. Edge devices enable limited computational capacity and energy availability that hamper end user performance. We designed a novel performance measurement index to gauge a device's resource capacity. This examination addresses the offloading mechanism issues, where the end user (EU) offloads a part of its workload to a nearby edge server (ES). Sometimes, the ES further offloads the workload to another ES or cloud server to achieve reliable performance because of limited resources (such as storage and computation). The manuscript aims to reduce the service offloading rate by selecting a potential device or server to accomplish a low average latency and service completion time to meet the deadline constraints of sub-divided services. In this regard, an adaptive online status predictive model design is significant for prognosticating the asset requirement of arrived services to make float decisions. Consequently, the development of a reinforcement learning-based flexible x-scheduling (RFXS) approach resolves the service offloading issues, where x = service/resource for producing the low latency and high performance of the network. Our approach to the theoretical bound and computational complexity is derived by formulating the system efficiency. A quadratic restraint mechanism is employed to formulate the service optimization issue according to a set ofmeasurements, as well as the behavioural association rate and adulation factor. Our system managed an average 0.89% of the service offloading rate,with 39 ms of delay over complex scenarios (using three servers with a 50% service arrival rate). The simulation outcomes confirm that the proposed scheme attained a low offloading uncertainty, and is suitable for simulating heterogeneous CPS frameworks.