Jianwei Liu, Xiang Zou, Jinsong Han, Feng Lin, K. Ren
{"title":"BioDraw: Reliable Multi-Factor User Authentication with One Single Finger Swipe","authors":"Jianwei Liu, Xiang Zou, Jinsong Han, Feng Lin, K. Ren","doi":"10.1109/IWQoS49365.2020.9212855","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212855","url":null,"abstract":"Multi-factor user authentication (MFUA) becomes increasingly popular due to its superior security comparing with single-factor user authentication. However, existing MFUAs require multiple interactions between users and different authentication components when sensing the multiple factors, leading to extra overhead and bad use experiences. In this paper, we propose a secure and user-friendly MFUA system, namely BioDraw, which utilizes four categories of biometrics (impedance, geometry, composition, and behavior) of human hand plus the pattern-based password to identify and authenticate users. A user only needs to draw a pattern on a RFID tag array, while four biometrics can be simultaneously collected. Particularly, we design a gradient-based pattern recognition algorithm for pattern recognition and then a CNN-LSTM-based classifier for user recognition. Furthermore, to guarantee the systemic security, we propose a novel anti-spoofing scheme, called Binary ALOHA, which utilizes the inhabit randomness of RFID systems. We perform extensive experiments over 21 volunteers. The experiment result demonstrates that BioDraw can achieve a high authentication accuracy (with a false reject rate less than 2%) and is effective in defending against various attacks.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116929915","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}
Manjiang Yin, Xiangyang Li, Yanyong Zhang, Panlong Yang, Chengchen Wan
{"title":"Back-Guard: Wireless Backscattering based User Activity Recognition and Identification with Parallel Attention Model","authors":"Manjiang Yin, Xiangyang Li, Yanyong Zhang, Panlong Yang, Chengchen Wan","doi":"10.1109/IWQoS49365.2020.9213006","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213006","url":null,"abstract":"With the rapid advance of smart home and office systems, it becomes possible to provide a fine-grained user activity tracking service accurately recognizing user activities and identities in a seamless and non-invasive manner. Such a system can find applications in various domains, such as elder safeguard, customized services, and simply personal activity diary. Recently, several radio frequency (RF) based sensing systems were proposed for human sensing, most of which focus on limited scenarios and suffer from interference caused by other users or wireless devices. To tackle this challenge, we propose Back-Guard, which achieves accurate and non-intrusive user activity recognition and then user identification through battery-free wireless backscattering. Back-Guard carefully examines the backscatter spectrogram data and extracts high-level features from both spatial and temporal domains that can characterize the user behaviors. Leveraging the parallel attention based deep learning models, our system can discriminate different motions and users accurately and robustly in various situations. We implement a prototype system and collect data in actual scenarios from 25 users for over 2 months. Extensive experiments demonstrate the promising performance of our system. In particular, Back-Guard achieves 93.4% activity recognition accuracy and 91.5% user identification accuracy, respectively. Our experiments also demonstrate little accuracy reduction when multiple users are separated, e.g., by around 2 meters.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124669942","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}
Xi Huang, Yinxu Tang, Ziyu Shao, Yang Yang, Hong Xu
{"title":"Joint Switch-Controller Association and Control Devolution for SDN Systems: An Integration of Online Control and Online Learning","authors":"Xi Huang, Yinxu Tang, Ziyu Shao, Yang Yang, Hong Xu","doi":"10.1109/IWQoS49365.2020.9212913","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212913","url":null,"abstract":"In software-defined networking (SDN) systems, it is a common practice to adopt a multi-controller design and control devolution techniques to improve the performance of the control plane. However, in such systems the decision making for joint switch-controller association and control devolution often involves various uncertainties, e.g., the temporal variations of controller accessibility, and computation and communication costs of switches. In practice, statistics of such uncertainties are unattainable and need to be learned in an online fashion, calling for an integrated design of learning and control. In this paper, we formulate a stochastic network optimization problem that aims to minimize time-average system costs and ensure queue stability. By transforming the problem into a combinatorial multi-armed bandit problem with long-term stability constraints, we adopt bandit learning methods and optimal control techniques to handle the exploration-exploitation tradeoff and long-term stability constraints, respectively. Through an integrated design of online learning and online control, we propose an effective Learning-Aided Switch-Controller Association and Control Devolution (LASAC) scheme. Our theoretical analysis and simulation results show that LASAC achieves a tunable tradeoff between queue stability and system cost reduction with a sublinear regret bound over a finite time horizon.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121220623","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}
Yuan Meng, Shenglin Zhang, Yongqian Sun, Ruru Zhang, Zhilong Hu, Yiyin Zhang, Chenyang Jia, Zhaogang Wang, Dan Pei
{"title":"Localizing Failure Root Causes in a Microservice through Causality Inference","authors":"Yuan Meng, Shenglin Zhang, Yongqian Sun, Ruru Zhang, Zhilong Hu, Yiyin Zhang, Chenyang Jia, Zhaogang Wang, Dan Pei","doi":"10.1109/IWQoS49365.2020.9213058","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213058","url":null,"abstract":"An increasing number of Internet applications are applying microservice architecture due to its flexibility and clear logic. The stability of microservice is thus vitally important for these applications' quality of service. Accurate failure root cause localization can help operators quickly recover microservice failures and mitigate loss. Although cross-microservice failure root cause localization has been well studied, how to localize failure root causes in a microservice so as to quickly mitigate this microservice has not yet been studied. In this work, we propose a framework, MicroCause, to accurately localize the root cause monitoring indicators in a microservice. MicroCause combines a simple yet effective path condition time series (PCTS) algorithm which accurately captures the sequential relationship of time series data, and a novel temporal cause oriented random walk (TCORW) method integrating the causal relationship, temporal order, and priority information of monitoring data. We evaluate MicroCause based on 86 real-world failure tickets collected from a top tier global online shopping service. Our experiments show that the top 5 accuracy (AC@5) of MicroCause for intra-microservice failure root cause localization is 98.7%, which is greatly higher (by 33.4 %) than the best baseline method.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132066734","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":"Serpens: A High-Performance Serverless Platform for NFV","authors":"Junxian Shen, Heng Yu, Zhilong Zheng, Chen Sun, Mingwei Xu, Jilong Wang","doi":"10.1109/IWQoS49365.2020.9213030","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213030","url":null,"abstract":"Many enterprises run Network Function Virtualization (NFV) services on public clouds to relieve management burdens and reduce costs. However, NFV operators still face the burden of choosing the right types of virtual machines (VMs) for various network functions (NFs), as well as the cost of renting VMs at a granularity of months or years while many VMs remain idle during valley hours. A recent computing model named serverless computing automatically executes user-defined functions on requests arrival, and charges users based on the number of processed requests. For NFV operators, serverless computing has the potential of completely relieving NF management burden and significantly reducing costs. Nevertheless, naively exploring existing serverless platforms for NFV introduces significant performance overheads in three aspects, including high remote state access latency, long NF launching time, and high packet delivery latency between NFs. To address these problems, we propose Serpens, a high-performance serverless platform for NFV. Firstly, Serpens designs a novel state management mechanism to support local state access. Secondly, Serpens proposes an efficient NF execution model to provide fast NF launching and avoid extra packet delivery. We have implemented a prototype of Serpens. Evaluation results demonstrate that Serpens could significantly improve performance for NFs and service function chains (SFCs) comparing to existing serverless platforms.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132308802","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":"Index","authors":"","doi":"10.1109/iwqos49365.2020.9212834","DOIUrl":"https://doi.org/10.1109/iwqos49365.2020.9212834","url":null,"abstract":"","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117147135","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 Deep Reinforcement Learning Approach for Online Computation Offloading in Mobile Edge Computing","authors":"Yameng Zhang, Tong Liu, Yanmin Zhu, Yuanyuan Yang","doi":"10.1109/IWQoS49365.2020.9212868","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212868","url":null,"abstract":"With the explosion of mobile smart devices, many computation intensive applications have emerged, such as interactive gaming and augmented reality. Mobile edge computing is put forward, as an extension of cloud computing, to meet the low-latency requirements of the applications. In this paper, we consider an edge computing system built in an ultra-dense network with numerous base stations, and heterogeneous computation tasks are successively generated on a smart device moving in the network. An optimal task offloading strategy, as well as optimal CPU frequency and transmit power scheduling, is desired by the device user, to minimize both task completion latency and energy consumption in a long-term. However, due to the stochastic computation tasks and dynamic network conditions, the problem is particularly difficult to solve. Inspired by reinforcement learning, we transform the problem into a Markov decision process. Then, we propose an online offloading approach based on a double deep Q network, in which a specific neural network model is also provided to estimate the cumulative reward achieved by each action. We also conduct extensive simulations to compare the performance of our proposed approach with baselines.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129817991","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}
Zefan Ge, Lei Xie, Shuangquan Wang, Xinran Lu, Chuyu Wang, Gang Zhou, Sanglu Lu
{"title":"Mag-Barcode: Magnet Barcode Scanning for Indoor Pedestrian Tracking","authors":"Zefan Ge, Lei Xie, Shuangquan Wang, Xinran Lu, Chuyu Wang, Gang Zhou, Sanglu Lu","doi":"10.1109/IWQoS49365.2020.9213069","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213069","url":null,"abstract":"In typical scenarios for indoor localization and tracking, it is essential to accurately track the pedestrians when they are crossing the connections of different spaces. In this paper, we propose a magnet barcode scanning-based solution for indoor pedestrian tracking. We assemble multiple magnet bars into magnet arrays as a unique magnet barcode, and deploy different magnet barcodes at different connections to label them. We embed an inertial measurement unit (IMU) into the pedes-trian‘s shoes. When the pedestrian crosses these connections, the magnetometer from the IMU scans the magnet barcode and recognize its corresponding ID. In this way, indoor pedestrian tracking can be regarded as a process of continuously scanning different magnet barcodes. By performing correlation analysis on these barcodes, the trace of pedestrian can be effectively depicted in the indoor map. To build a unique magnet barcode based on the magnet bar arrays, we provide an optimized structure for building the magnet barcode. To tackle the diversities of the pedestrian's gait traces in identifying the magnet barcode, we provide a generalized model based on the space axis for magnet barcode identification. As far as we know, this is the first work to use the magnet bar array to construct the magnet barcode for indoor pedestrian tracking. The real experiment results show that our system can achieve an average accuracy of 88.9% in identifying the magnet barcodes and an average accuracy of 93.1 % for indoor pedestrian tracking.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129105002","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}
Jiamei Lv, Yuxuan Zhang, Wei Dong, Yi Gao, Chun Chen
{"title":"A General Approach to Robust QR Codes Decoding","authors":"Jiamei Lv, Yuxuan Zhang, Wei Dong, Yi Gao, Chun Chen","doi":"10.1109/IWQoS49365.2020.9212963","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212963","url":null,"abstract":"With the continued proliferation of smart mobile devices, Quick Response (QR) code has played an important role in daily life. They may be distorted and partially invisible due to bright spots, folding and stains When they are printed on soft materials such as plastic bags. Existing scanners may fail in detecting and decoding QR codes due to distortion. In this paper, we propose a simple but effective approach to decoding distorted and partial QR codes. First, we improve an existing QR code detection algorithm to extract QR codes. Then based on the structural features of QR codes that white and black modules are staggered, we propose a novel distortion correction mechanism that uses an adaptive window to match each module. In order to tackle the problem of invisibility, we print multiple QR codes and capture them in an image. Considering confidence of each module in separate, we reconstruct a relatively complete QR code. Extensive experiments have been conducted to evaluate the performance of our approach. The results show that our approach improves the decoding rate by 50% – 60% compared to the other two baselines.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131801449","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":"RLLL: Accurate Relative Localization of RFID Tags with Low Latency","authors":"Xuan Liu, Quan Yang, Shigeng Zhang, Bin Xiao","doi":"10.1109/IWQoS49365.2020.9212981","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212981","url":null,"abstract":"Radio frequency identification (RFID) has been widely used in many smart applications. In many scenarios, it is essential to know the ordering of a set of RFID tags. For example, to quickly detect misplaced books in smart libraries, we need to know the relative ordering of the tags attached to the books. Although several relative RFID localization algorithms have been proposed, they usually suffer from large localization latency and cannot support applications that require real-time detection of tag (product) positions like automatic manufacturing on an assembly line. Moreover, existing approaches face significant degradation in ordering accuracy when the tags are close to each other. In this paper, we propose RLLL, an accurate Relative Localization algorithm for RFID tags with Low Latency. RLLL reduces localization latency by proposing a novel geometry-based approach to identifying the V-zone in the phase reading sequence of each tag. Moreover, RLLL uses only the data in the V-zone to calculate relative positions of tags and thus avoids the negative effects of low-quality data collected when the tag is far from the antenna. Experimental results with commercial RFID devices show that RLLL achieves an ordering accuracy of higher than 0.986 with latency less than 0.8 seconds even when the tags are spaced only 7 mm from adjacent tags, in which case the state-of-the-art solutions only achieve ordering accuracy of lower than 0.8 with localization latency larger than 3 seconds.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134434426","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}