{"title":"One Layer for All: Efficient System Security Monitoring for Edge Servers","authors":"Lele Ma","doi":"10.1109/IPCCC51483.2021.9679369","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679369","url":null,"abstract":"Edge computing promises higher bandwidth and lower latency to end-users. However, edge servers usually have limited computing resources and are geographically distributed over the edge. This imposes new challenges for efficient system monitoring and control of edge servers.In this paper, we propose EdgeVMI, a framework to monitor and control services running on edge servers with lightweight virtual machine introspection(VMI). The key of our technique is to run the monitor in a lightweight virtual machine which can leverage hardware events for monitoring memory read and writes. In addition, the small binary size and memory footprints of the monitor could reduce the start/stop time of service, the runtime overhead, as well as the deployment efforts.Inspired by unikernels, we build our monitor with only the necessary system modules, libraries, and functionalities of a specific monitor task. To reduce the security risk of the monitoring behavior, we separate the monitor into two isolated modules: one acts as a sensor to collect security information and another acts as an actuator to conduct control commands. Our evaluation shows the effectiveness and the efficiency of the monitoring system, with an average performance overhead of 2.7%.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132350130","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":"VideoKV: A Fast Key-Value Store For Intelligent Video Surveillance Terminals*","authors":"Zhenli Cui, Yu Luo","doi":"10.1109/IPCCC51483.2021.9679403","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679403","url":null,"abstract":"With the development of embedded hardware and artificial intelligence technology, video surveillance terminals based on embedded device are becoming more intelligent, and the ability of image recognition is one of its development trends. Compared with the indiscriminate storage of surveillance video by traditional video surveillance terminals, intelligent video surveillance terminals with image recognition can be used as an edge computing node to automatically identify surveillance video clips containing the pre-set targets, and store these video clips (called valid videos) locally, discarding other meaningless surveillance video clips, thereby reducing the pressure on the remote data center. However, for some complex application scenarios, intelligent video surveillance terminals may generate a large number of valid videos. Therefore, there is an urgent need for a high-efficiency storage system suitable for embedded devices to store valid videos. General-purpose key-value stores (KVs) are widely used to store massive amounts of unstructured data, but their design is too elaborate, which will seriously increase the burden on the CPU of embedded devices. According to characteristics and storage requirements of valid videos, we present a new lightweight persistent KV: VideoKV, which is designed for embedded devices, it not only implements the core interfaces of general-purpose KVs, but also expands the interfaces to make it more compatible with diverse hardware environment of embedded devices. VideoKV is also more efficient when storing valid videos, we compare VideoKV against available state-of-the-art Log-Structured Merge (LSM) and B+ tree KVs, VideoKV can achieve throughput at least 1.5x that of its competitors on write-intensive workloads, 2.2x on scan-intensive workloads, and reduce CPU consumption rate by 25%.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132616801","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":"MR-tree: A Parametric Family of Multi-Rail Fat-tree","authors":"Yuyang Wang, Dezun Dong, Fei Lei","doi":"10.1109/IPCCC51483.2021.9679441","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679441","url":null,"abstract":"Although using Multi-Rail network is a popular choice for many HPC systems to overcome bandwidth limitations, the influence of connection modes between multi-port nodes and switching network is not well understood so far. This work provides a detailed analysis of different node connection modes in Multi-Rail Fat-tree. To gain a deep understanding of relevant issues, we propose a new parametric family of Multi-Rail Fat-tree called MR-tree, which could cover all balanced node connection modes for Multi-Rail Fat-tree. We evaluate different node connection modes by theoretical analysis and flit level simulation. We show that there are great differences across various node connection modes. Among the key differences are the following: cost, average shortest path length, fault-tolerance, and path diversity. In addition, our simulation results reveal that the performance gap for Multi-Rail Fat-trees with different node connection modes may vary significantly depending on the oversubscribed conditions. The above results leave open the possibility that optimization of node connection mode can yield better results for Multi-Rail Fat-tree.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457095","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}
Thomas Prantl, Dominik Prantl, Lukas Beierlieb, Lukas Iffländer, A. Dmitrienko, Samuel Kounev, Christian Krupitzer
{"title":"Performance Evaluation for a Post-Quantum Public-Key Cryptosystem","authors":"Thomas Prantl, Dominik Prantl, Lukas Beierlieb, Lukas Iffländer, A. Dmitrienko, Samuel Kounev, Christian Krupitzer","doi":"10.1109/IPCCC51483.2021.9679412","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679412","url":null,"abstract":"Quantum Computing threatens security of today’s systems. Confidence in today’s security technologies largely relies on Public Key Cryptography (PKC), which depends on computational difficulty of mathematical problems that cannot be solved efficiently using any technology available today. This will, however, change once a sufficiently capable quantum computer will become available. Similarly, security of symmetric crypto algorithms will also be substantially weakened. Current progress in research proves that Quantum Computing is no longer science fiction. Hence, research and development of post-quantum cryptographic algorithms that can withstand attacks in Quantum Computing era are of paramount importance. This paper complements existing research in this domain with a performance analysis of a post-quantum cryptosystem capable of encrypting and decrypting messages either bit-wise or string-wise. Specifically, we describe a workflow for implementing the scheme, design a reproducible hardware performance evaluation testbed for an IoT and an online shopping scenario, define performance metrics, and perform performance evaluation case studies. Our performance analysis shows that bit-wise encryption and decryption and the corresponding key generation fits resource-constrained IoT microcontrollers as well as on average laptops. The encryption and decryption of a bit each take less than 30 ms and the key generation less than 300 ms.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128370020","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":"Resource allocation algorithm for MEC based on Deep Reinforcement Learning","authors":"Yijie Wang, Xin Chen, Ying Chen, Shougang Du","doi":"10.1109/IPCCC51483.2021.9679368","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679368","url":null,"abstract":"In recent years, driven by the commercialization of the 6th Generation Communication Technology (6G), an increasing number of 6G devices connected to mobile networks produces computation-intensive tasks such as ultra-high-resolution video streaming, inter-active visual reality (VR) gaming, augmented reality (AR). However, the computing capacity and the capacity of battery of the 6G devices are limited. The technology of computation offloading would offload the tasks from the IoT devices to the edge network in the scenario of mobile edge computing (MEC). Not only can solve the shortage of mobile user device in energy effciency, but also deal with the tasks in low latency. IoT devices can offload computing tasks or execute them locally to finish the work. In order to find the optimal allocation rate of local computing tasks and offloading tasks, a resource allocation policy gradient (RAPG) based DDPG is considered. Finally we analyze the performance of RAPG by contrasts with different resource allocation algorithms. Numerial simulation results showed that the RAPG can achieve the best allocate rate between the BS and local, also can reduce the overall system delay of task combination with minimum energy consumption.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124545348","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":"Data Placement Strategies for Data-Intensive Computing over Edge Clouds","authors":"Xinliang Wei, A. B. M. M. Rahman, Yu Wang","doi":"10.1109/IPCCC51483.2021.9679438","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679438","url":null,"abstract":"Edge computing has become an increasingly popular computing paradigm. Deploying edge clouds allows performing data-intensive computing at the edge of the network instead of a remote cloud to reduce data access latency and improve data processing efficiency. One of the key challenges in data-intensive edge computing is how to effectively place the data at the edge clouds such that the access latency to the data is minimized. In this paper, we study such a data placement problem in edge computing where different data items have diverse popularity. We first propose a data popularity based placement method when the data requests are unknown. It maps both data items and edge servers to a virtual plane and places data based on its virtual coordinate in the plane. We consider data popularity during both the mapping of data items to the plane and making the placement decision. We further propose an optimization-based placement strategy for the case when the data requests are known. By formulating an integer programming problem, our proposed solution aims to find the optimal placement decision. Simulation results show that both proposed strategies efficiently reduce the average latency of data access.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117150715","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":"ALLPC: A Lightweight Block Cipher Based on Generalized Feistel Networks for IoT","authors":"Junhua Cheng, Songtao Guo, Jing He","doi":"10.1109/IPCCC51483.2021.9679401","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679401","url":null,"abstract":"As millions of intelligent devices are gradually deployed at the edge of networks, a large amount of private and sensitive data generated at those devices need to be transmitted, stored and processed safely among these devices, which become a serve challenge because these resource constrained IoT devices cannot satisfy the requirements of conventional encryption ciphers. In this paper, we propose the extended Type-1 generalized Feistel networks (Type-1 EGFNs) and instantiate it into a lightweight block cipher called ALLPC. We analyze performance of the cipher in security, software implementation and hardware implementation. The Type-1 EGFNs overcomes the shortcomings of slow diffusion of Type-1 GFNs. Compared with other existing lightweight block ciphers, experimental results shows that ALLPC cipher can achieve compact hardware and low-performance software (e.g. low memory) while having low execution time, high throughput and low energy consumption on 32-bit ARM-Cortex M3 STM32F103 platform. In our security analysis, ALLPC cipher can attain adequate security level against many different attacks.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114876688","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}
A. Al-Ghushami, Dabeeruddin Syed, Ameema Zainab, M. Ahmed, Jadran Sessa
{"title":"Deep Learning-based Face Mask Usage Detection on Low Compute Resource Devices","authors":"A. Al-Ghushami, Dabeeruddin Syed, Ameema Zainab, M. Ahmed, Jadran Sessa","doi":"10.1109/IPCCC51483.2021.9679407","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679407","url":null,"abstract":"The advent of the COVID-19 pandemic has brought several never-before-seen changes in the daily lives of people around the globe. As a way to curb the spreading of the disease, wearing face masks has become mandatory in the majority of public places. To solve the necessity of face mask detection in such situations, there have been only a handful of research endeavors up to this date. Computer vision has advanced multi-fold with the advent of AlexNet architecture. With a motivation to go deeper with the neural network architecture, the concept of Depthwise Separable Convolutions and projection layer was developed in MobileNetV1. In this work, a novel lightweight deep learning model based on Single Shot Detector (SSD) MobileNetV2 architecture is proposed for face mask detection using images and video streams of crowds aiming its utilization on low compute re-source environment. An open benchmark face mask dataset, with 4095 images including masked and no mask images, is utilized to train the model for detection. The model is initialized using transfer learning with the freezing of base layers. The proposed methodology can efficiently aid in tracking and enforcing social distancing rules in crowded places with the use of surveillance cameras. On the different benchmarks that we have tested, the model proved to be highly successful and has achieved an accuracy rate of 99.39% and an F1 score of 0.995.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127372967","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}
H. Romesburg, Jian Wang, Yushan Jiang, Huihui Wang, H. Song
{"title":"Software Defined Radio based Security Analysis For Unmanned Aircraft Systems","authors":"H. Romesburg, Jian Wang, Yushan Jiang, Huihui Wang, H. Song","doi":"10.1109/IPCCC51483.2021.9679408","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679408","url":null,"abstract":"With the development of unmanned aerial systems (UAS), the ubiquitous deployment of UAS is becoming a trend. With the digital transceiver, the remote pilot can control the UAS remotely and effectively. With the deployment of 5G technology on a large scale, the convenience of remote control is becoming obvious and stable. However, the convenience of remote control technologies also brings more vulnerabilities to UAS. Software defined radio (SDR) has been explored to play system exploitation and penetration test for the radio system widely. With block programming, an SDR can become a hands-on system exploitation tool for research. With the adjustment of antennas and programmings, we can exploit the vulnerabilities of the UAS system and fixed the problem in advance. In this paper, we introduce an approach to leverage SDR to realize signal spoofing for GPS location and injection for digital communication. Based on SDR, we analyze the security of UAS on the GPS and digital connections. With the adjustment of antennas, we can define the SDR into a GPS spoofing tool and inject the packets in the communication of the digital transceiver. The evaluation shows the approach can delay the GPS searching for tens of minutes and disorder the connections between ground control station to UAS.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436419","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}
Jirun Duan, Ke Ren, Wei-Guang Zhou, Yueyue Xu, Wanchun Dou
{"title":"A Service Migration Method for Resource Competition in Mobile Edge Computing","authors":"Jirun Duan, Ke Ren, Wei-Guang Zhou, Yueyue Xu, Wanchun Dou","doi":"10.1109/IPCCC51483.2021.9679421","DOIUrl":"https://doi.org/10.1109/IPCCC51483.2021.9679421","url":null,"abstract":"In the mobile edge computing (MEC) environment, tasks can be offloaded to edge servers for better service. However, the locations of users are not fixed. As users move, tasks need to be migrated to the vicinity of users to ensure quality of service (QoS). At present, most research considers the problem of service migration from the perspective of a single user. The single user migration scheme is only concerned with it’s own optimal choice, without considering the interference between multiple users, which will lead to multiple users blindly competing for resources and resulting in edge server overload. This paper proposes a service migration method for resource competition, which can eliminate the problem of edge server overload caused by blind resource competition among users. Experimental results show that, compared with the existing algorithms, proposed method has lower cost and higher availability in multi-user scenarios.","PeriodicalId":125158,"journal":{"name":"2021 IEEE International Performance, Computing, and Communications Conference (IPCCC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130849960","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}