Shivank Thapa, S. Sahoo, Moumita Patra, Arobinda Gupta
{"title":"A Novel Cost-Aware Load Balancing Algorithm for Road Side Units in Internet of Vehicles","authors":"Shivank Thapa, S. Sahoo, Moumita Patra, Arobinda Gupta","doi":"10.23919/CNSM55787.2022.9964580","DOIUrl":null,"url":null,"abstract":"Vehicular ad-hoc networks formed in an Internet of Vehicles scenario can enable many useful applications and services. Many of these applications may generate a large amount of data, which needs to be processed within some deadline to be useful. Limited resources present in vehicles may not be sufficient for processing such data. The resources present in Road Side Units (RSUs) can be used for this purpose by running Virtual Machines (VMs) there on behalf of the vehicles. However, RSUs can also become overloaded in a dense vehicular scenario if all vehicles use the services of their nearby RSUs only. Also, use of RSUs may incur a cost. Hence the combined total resources of the RSUs need to be carefully managed to ensure that a large number of VMs complete within their deadline while incurring a lower cost. In this paper, we propose an algorithm called Cost Aware Load Balancing (CALB) algorithm that assigns and executes VMs in different RSUs in the total RSU pool. The proposed algorithm aims to maximize the number of VMs that complete execution within their deadline and also attempts to minimize the overall cost incurred by VMs for using RSUs’ resources. Performance of CALB is compared with several existing algorithms to show that it works better than the existing algorithms with respect to several performance metrics.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 18th International Conference on Network and Service Management (CNSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/CNSM55787.2022.9964580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Vehicular ad-hoc networks formed in an Internet of Vehicles scenario can enable many useful applications and services. Many of these applications may generate a large amount of data, which needs to be processed within some deadline to be useful. Limited resources present in vehicles may not be sufficient for processing such data. The resources present in Road Side Units (RSUs) can be used for this purpose by running Virtual Machines (VMs) there on behalf of the vehicles. However, RSUs can also become overloaded in a dense vehicular scenario if all vehicles use the services of their nearby RSUs only. Also, use of RSUs may incur a cost. Hence the combined total resources of the RSUs need to be carefully managed to ensure that a large number of VMs complete within their deadline while incurring a lower cost. In this paper, we propose an algorithm called Cost Aware Load Balancing (CALB) algorithm that assigns and executes VMs in different RSUs in the total RSU pool. The proposed algorithm aims to maximize the number of VMs that complete execution within their deadline and also attempts to minimize the overall cost incurred by VMs for using RSUs’ resources. Performance of CALB is compared with several existing algorithms to show that it works better than the existing algorithms with respect to several performance metrics.