Kazumi Igarashi, Akira Nagata, Yohei Okamoto, M. Shibata, Kenichi Kourai, M. Tsuru
{"title":"Efficient VM Migration for Multiple Destination Sites Across a Japan-US OpenFlow Testbed","authors":"Kazumi Igarashi, Akira Nagata, Yohei Okamoto, M. Shibata, Kenichi Kourai, M. Tsuru","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226149","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226149","url":null,"abstract":"A globally integrated testbed for various experiments of distributed applications based on the edge cloud computing was constructed and operated as part of an international joint research program, Japan-US Network Opportunity 2 (JUNO2). The testbed consists of many virtual machines (VMs) at Kyushu Institute of Technology (Kyutech), The City College of The City University of New York (CCNY), StarBED (a large-scale PC cluster testbed), and RISE (a wide-area OpenFlow testbed) over multiple Layer-2 virtual networks (VLANs) through collaboration with international research and educational networks. Those VLANs are used as the data and the control planes with a single OpenFlow controller and twelve OpenFlow switches. As an example, this paper introduces an experiment of VM migration among CCNY, Kyutech, and StarBED for a global virtual collaborative working environment. An OpenFlow-based multicasting scheme is adopted for efficient use of the bottleneck network bandwidth in replicating a large VM environment from CCNY to two sites in Japan. The implementation details on the global testbed and the experimental results are reported, verifying that the multicast-based transfer halves the elapsed time of VM migration compared with the unicast-based transfer.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sravani Kurma, Keshav Singh, Mayur Katwe, S. Mumtaz, Chih-Peng Li
{"title":"RIS-Empowered MEC for URLLC Systems with Digital-Twin-Driven Architecture","authors":"Sravani Kurma, Keshav Singh, Mayur Katwe, S. Mumtaz, Chih-Peng Li","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226132","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226132","url":null,"abstract":"This paper investigates a digital twin (DT) enabled reconfigurable intelligent surface (RIS)-aided mobile edge computing (MEC) system under given constraints on ultra-reliable low latency communication (URLLC). In particular, we focus on the problem of total end-to-end (e2e) latency minimization for the considered system under the joint optimization of beamforming design at RIS, power and bandwidth allocation, processing rates, and task offloading parameters using DT architecture. To tackle the formulated non-convex optimization problem, we first model it as a Markov decision process (MDP), and later we adopt a deep reinforcement learning (DRL) algorithm to solve it effectively. Simulation results confirm that the proposed DT-enabled resource allocation scheme for the RIS-empowered MEC network achieves up to 60% lower transmission delay and 20% lower energy consumption compared to without RIS scheme.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"9 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130353260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Riya Kakkar, Aparna Kumari, Rajesh Gupta, Smita Agrawal, S. Tanwar
{"title":"Artificial Neural Network and Game Theory for Secure Optimal Charging Station Selection for EVs","authors":"Riya Kakkar, Aparna Kumari, Rajesh Gupta, Smita Agrawal, S. Tanwar","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225788","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225788","url":null,"abstract":"The penetration of electric vehicles (EV s) entails the deployment of more charging station (CS) infrastructure to realize the charging requirement issues of the EV s. But, limited installation of charging infrastructure and data security issues require a secure and efficient CS selection mechanism for EV s. Towards this goal, we proposed an Artificial Intelligence (AI) and game theory-based secure CS selection scheme for EVs using blockchain. Blockchain and AI-based proposed scheme provides security and privacy during the communication between participants, i.e., EV s and CSs, for optimal CS selection. Moreover, an incorporated blockchain network with Interplanetary File System (IPFS) strengthens the reliability and cost-efficiency of CS selection by using beyond 5G network and its ultra-intelligent features. Furthermore, the blockchain and AI-based proposed scheme utilizes coalition game theory approach to recommend the optimal CS for EV and balance the fair payoff between the participants in the network. Finally, experimental results show that the proposed scheme yields better results than the conventional approaches considering the performance evaluation metrics such as State of Charge (SoC), profit analysis, and latency comparison.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132385322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Han Li, Ming Liu, Bo Gao, Ke Xiong, Pingyi Fan, K. Letaief
{"title":"Sum Computation Rate Maximization in Self-Sustainable RIS-Assisted MEC","authors":"Han Li, Ming Liu, Bo Gao, Ke Xiong, Pingyi Fan, K. Letaief","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225948","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225948","url":null,"abstract":"This paper studies a self-sustainable reconfigurable intelligent surface (SRIS)-assisted mobile edge computing (MEC) network, where a SRIS first harvests energy from a hybrid access point (HAP), and then enhances the users' offloading performance with the harvested energy. To improve computing efficiency, a sum computation rate maximization problem is formulated. Based on the alternating optimization (AO) method, an efficient algorithm is proposed to solve the formulated non-convex problem. Simulations show that when the SRIS is deployed closer to the HAP, a higher performance gain can be achieved.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133253272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ensemble Learning for Predicting Task Connectivity Over Time in Cloud Data Centers","authors":"Mustafa Daraghmeh, A. Agarwal, Y. Jararweh","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225964","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225964","url":null,"abstract":"The rapid growth and interdependencies of cloud-hosted services and applications have made it imperative to optimize data center resource management while maintaining low operating costs. Inefficient resource use, rising energy consumption, and operating costs impact cloud provider's ability to provide high-quality services on an elastic basis. However, changing the selection and decision-making processes based on how the tasks are set up can improve scheduling and resource management in cloud data centers. In this paper, we develop a multivariate time series prediction model for task connectivity based on windowing characterization and ensemble learning methods. The high cardinality features are handled using a counter encoder, and the task trace data is transformed using a sliding window, from which features are extracted and used in conjunction with the task profile data to train and tune the candidate estimators. The best model outcomes are then used to construct an ensembled estimator. As part of the evaluation, a baseline comparison is performed in order to determine how well ensemble learning predicts task connectivity over time. The model outcomes are assisted using standard classification metrics such as accuracy, precision, and recall, including the F1 score, Kappa, and Matthews correlation coefficient. The results show that the proposed model outperformed the traditional models in most performance metrics, indicating the successful implementation of an ensemble learning approach for task connectivity predictions in large-scale cloud data centers.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Lightweight Preprocessing Scheme for Secret Key Generation from MmWave Massive MIMO Channel Measurements","authors":"Lijun Yang, Xin-xing Ge, Qianyi Zhu, Lin Guo","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226124","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226124","url":null,"abstract":"Due to the new channel characteristics, previous preprocessing methods for physical layer key generation cannot be directly applied in mmWave massive MIMO systems. Actually, due to the intolerable high computation complexity and time consumption caused by large dimension of massive MIMO channel, even the previous optimal preprocessing method principal component analysis (PCA) is not suitable. To address the problem, in this paper, we propose a lightweight preprocessing approach called beamspace refinement, which is suitable for mmWave massive MIMO channel by exploiting its channel characteristics namely sparsity. The proposed scheme brings the following advantages. 1) It is lightweight. The computational complexity is quiet low. Unlike the PCA scheme, the proposed scheme does not involve the exponential calculation of the number of antennas, which makes it very suitable for mmWave massive MIMO channel. 2) It is robust against noise. Thus, it can be used to generate secret key with quiet high-entropy and high bit agreement ratio even in low SNR regimes. Numerical results show that the proposed approach outperforms the previous method DCT, WT and PCA in terms of bit agreement ratio, and is on par with PCA in terms of key capacity. Besides, the increase of the antennas number can improve key agreement ratio in our scheme, which is beneficial for massive MIMO system.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132176492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Anis ur Rahman, A. Malik, Hasan Ali Khattak, M. Aloqaily
{"title":"Task Offloading Using Multi-Armed Bandit Optimization in Autonomous Mobile Robots","authors":"Anis ur Rahman, A. Malik, Hasan Ali Khattak, M. Aloqaily","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226072","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226072","url":null,"abstract":"Evolution in ubiquitous and wireless services has enabled the massive adoption of autonomous cyber-physical systems for improving the workflows in dynamic environments. Among other applications, it has been witnessed that these modern technologies with the help of machine learning and high-speed communications can enable optimum and safe utilization of resources to complete various repetitive yet hazardous tasks. The industry 5.0 vision requires a multitude of devices to work with such orchestration that compute-intensive tasks may be offloaded to nearby nodes to enable collaboration for such time-critical yet compute-intensive tasks. In this work, we present a multi-armed bandit-based approach for task offloading in unmanned autonomous robots. Through experimental validation, a proof of concept is given. It has been demonstrated that using the proposed technique we have achieved a higher task delivery rate with reduced average delay.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129315005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}