K. Rajashekar, Souradyuti Paul, S. Karmakar, Subhajit Sidhanta
{"title":"Topology Aware Cluster Configuration for Minimizing Communication Delay in Edge Computing","authors":"K. Rajashekar, Souradyuti Paul, S. Karmakar, Subhajit Sidhanta","doi":"10.1109/ICDCS54860.2022.00144","DOIUrl":null,"url":null,"abstract":"For real-time edge computing applications working under stringent deadlines, communication delay between IoT devices and edge devices needs to be minimized. Since the generalized assignment problem being NP-Hard, an optimal assignment of IoT devices to the edge cluster is hard. We propose the application RL based heuristics to obtain a near-optimal assignment of IoT devices to the edge cluster while ensuring that none of the edge devices are overloaded. We demonstrate that our algorithm outperforms the state-of-the-art.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS54860.2022.00144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
For real-time edge computing applications working under stringent deadlines, communication delay between IoT devices and edge devices needs to be minimized. Since the generalized assignment problem being NP-Hard, an optimal assignment of IoT devices to the edge cluster is hard. We propose the application RL based heuristics to obtain a near-optimal assignment of IoT devices to the edge cluster while ensuring that none of the edge devices are overloaded. We demonstrate that our algorithm outperforms the state-of-the-art.