Yang Zhang, Ruohan Zong, Lanyu Shang, Md. Tahmid Rashid, Dong Wang
{"title":"SuperClass: A Deep Duo-Task Learning Approach to Improving QoS in Image-driven Smart Urban Sensing Applications","authors":"Yang Zhang, Ruohan Zong, Lanyu Shang, Md. Tahmid Rashid, Dong Wang","doi":"10.1109/IWQOS52092.2021.9521332","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521332","url":null,"abstract":"Image-driven smart urban sensing (ISUS) has emerged as a powerful sensing paradigm to capture abundant visual information about the urban environment for intelligent city monitoring, planning, and management. In this paper, we focus on a Classification and Super-resolution Coupling (CSC) problem in ISUS applications, where the goal is to explore the interdependence between two critical tasks (i.e., classification and super-resolution) to concurrently boost the Quality of Service (QoS) of both tasks. Previous efforts often focus on solving the two tasks individually and ignore the opportunity to explore the interdependence between them. In this paper, we develop SuperClass, a deep duo-task learning framework, to effectively integrate the classification and super-resolution tasks into a holistic network design that jointly optimizes the QoS of both tasks. The evaluation results on a real-world ISUS application show that SuperClass consistently outperforms state-of-the-art baselines by simultaneously achieving better land usage classification accuracy and higher reconstructed image quality.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115583144","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}
Yanjun Li, Xiaofeng Su, Huatong Jiang, Chung Shue Chen
{"title":"Throughput Maximization for Wireless Powered Communication: Reinforcement Learning Approaches","authors":"Yanjun Li, Xiaofeng Su, Huatong Jiang, Chung Shue Chen","doi":"10.1109/IWQOS52092.2021.9521268","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521268","url":null,"abstract":"To maximize the throughput of wireless powered communication (WPC), it is critical for the device to decide when to harvest energy, when to transmit data and what transmit power to use. In this paper, we consider a WPC system with a single device using harvest-store-transmit protocol and aim to maximize the longterm average throughput with optimal allocation of the energy harvesting time, data transfer time and the device’s transmit power. With the consideration of many practical constraints including finite battery capacity, time-varying channels and non-linear energy harvesting model, we propose both deep Q-learning (DQL) and actor-critic (AC) approaches to solve the problem and obtain fully online policies. Simulation results show that the performance of our proposed AC approach comes close to that achieved by value iteration and is superior to DQL and other baseline algorithm. Meanwhile, its space complexity is 2-3 orders of magnitude less than that required by value iteration.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114320997","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}
B. Liu, Huichen Dai, Wenquan Xu, Tong Yun, J. Miao
{"title":"Scalable Hardware Content Router: Architecture, Modeling and Performance","authors":"B. Liu, Huichen Dai, Wenquan Xu, Tong Yun, J. Miao","doi":"10.1109/IWQOS52092.2021.9521334","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521334","url":null,"abstract":"Current Internet is evolving with the gradual shift from the traditional host-to-host communication model to the new host-to-content paradigm, which will eventually lead to a network of caches. The novel Named Data Networking (NDN) has been proposed as a future Internet architecture to embrace this paradigmatic shift, where caching becomes an ubiquitous functionality available at each router.A router with the functionality of content caching, running on NDN mechanisms, is termed as an NDN-based content router. Previous researchers focused on software content routers (SCR), which leverage a commercial off-the-shelf computer to execute content caching/accessing and named-based packet forwarding. SCR can only achieve limited throughput, which is far below the speed requirements of modern routers. Facing this situation, in this paper, we propose a hardware-based content router (HCR), aiming at purchasing wire-speed processing. We design a physically concise architecture for decoupling the packet buffers in line cards from the content caches attached to storage cards, enabling separate management and optimization while facilitating a modular structure for smooth capacity upgrade in response to increasing storage utilization. For lowering the operating complexity and reducing the storage management cost, we choose to employ distributed caches working in a cooperated manner by using consistent hashing. We model several candidate storage organizing schemes and carry out theoretical analyses for comparison. Analytical and synthetic workload-driven results show that the consistent hashing scheme achieves high cache performance and low cost simultaneously.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979148","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}
Yuchao Zhang, Peizhuang Cong, B. Liu, Wendong Wang, Ke Xu
{"title":"AIR: An AI-based TCAM Entry Replacement Scheme for Routers","authors":"Yuchao Zhang, Peizhuang Cong, B. Liu, Wendong Wang, Ke Xu","doi":"10.1109/IWQOS52092.2021.9521314","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521314","url":null,"abstract":"Ternary Content Addressable Memory (TCAM) is an important hardware used to store route entries in routers, which is used to assist routers to make fast decision on forwarding packets. In order to cope with the explosion of route entries due to massive IP terminals brought by 5G and the Internet of Things (IoT), today’s commercial TCAM has to keep the corresponding growth in capacity. But large TCAM capacity is causing many problems such as circuit design difficulties, production costs, and high energy consumption, so it is urgent to design a lightweight TCAM with small capacity while still maintains the original query performance.Designing such a TCAM faces two fundamental challenges. Firstly, it is essential to accurately predict the incoming flows in order to cache correct entries in limited TCAM capacity, but prediction on aggregated time-sequential data is challenging in the massive IoT scenarios. Secondly, the prediction algorithm needs to be real-time as the lookup process is in line-rate. In order to address the above two challenges, in this paper, we proposed a lightweight AI-based solution, called AIR, where we successfully decoupled the route entries and designed a parallel-LSTM prediction method. The experiment results under real backbone traffic showed that we successfully achieved comparable query performance by using just 1/8 TCAM size.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128345726","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":"Efficient Fine-Grained Website Fingerprinting via Encrypted Traffic Analysis with Deep Learning","authors":"Meng Shen, Zhenbo Gao, Liehuang Zhu, Ke Xu","doi":"10.1109/IWQOS52092.2021.9521272","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521272","url":null,"abstract":"Fine-grained website fingerprinting (WF) enables potential attackers to infer individual webpages on a monitored website that victims are visiting, by analyzing the resulting traffic protected by security protocols such as TLS. Most existing studies focus on WF at the granularity of website, which takes website homepages as their representatives for fingerprinting. Fine-grained WF can reveal more user privacy, such as online purchasing habits and video-viewing interests, and can also be employed for web censorship. Due to striking similarly of webpages on a same website, it is still an open problem to conduct fine-grained WF in an accurate and time-efficient way.In this paper, we propose BurNet, a fine-grained WF method using Convolutional Neural Networks (CNNs). To extract differences of similar webpages, we propose a new concept named unidirectional burst, which is a sequence of packets corresponding to a piece of HTTP message. BurNet takes as input unidirectional burst sequences, instead of bidirectional packet sequences, which makes it applicable to local and remote attack scenarios. BurNet employs CNNs to build a powerful classifier, where sophisticated architecture is designed to improve classification accuracy while reducing time complexity in training. We collect real-world datasets from two well-known websites and conduct extensive experiments to evaluate the performance of BurNet. The closed-world evaluation results show that BurNet outperforms the state-of-the-art methods in both attack scenarios. In the more realistic open-world setting, BurNet can achieve 0.99 precision and 0.99 recall. BurNet is also superior to its CNN-based counterparts in terms of training efficiency.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102662","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":"IMP: Impedance Matching Enhanced Power-Delivered-to-Load Optimization for Magnetic MIMO Wireless Power Transfer System","authors":"Wangqiu Zhou, Hao Zhou, Wenxiong Hua, Fengyu Zhou, Xiang Cui, Suhua Tang, Zhi Liu, Xiangyang Li","doi":"10.1109/IWQOS52092.2021.9521305","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521305","url":null,"abstract":"Recently, multiple-input multiple-output (MIMO) technology has been introduced into magnetic resonant coupling (MRC) enabled wireless power transfer (WPT) systems for concurrent charging of multiple devices. However, impedance mismatching phenomena caused by strong TX-RX or RX-RX coupling greatly affect the power delivered to load (PDL) in practical charging systems. To solve this issue, we propose an effective scheduling algorithm for Impedance Matching enhanced PDL optimization in MIMO MRC-WPT systems (called IMP), which integrates the transmitter scheduling together with the impedance matching techniques, i.e., adjusting TX coils for tuning TX-RX coupling and grouping RXs to separate strongly coupled RX pairs. We formulate this as a joint optimization problem and decouple it into three sub-problems, i.e., current scheduling, coil adjustment, and RX grouping, and solve them through alternating direction method of multipliers (ADMM) based, tabu search (TS) based, and graph clique cover based algorithms, respectively. Extensive experiments are performed on a prototype testbed, and the results demonstrate the effectiveness of our solution. Compared with the state-of-the-art power transfer efficiency (PTE) maximization solution, the proposed algorithm IMP achieves a 74.7X performance improvement of PDL on average.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130050127","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}
Jiarui Zhang, Yaodong Huang, Fan Ye, Yuanyuan Yang
{"title":"A Novel Proof-of-Reputation Consensus for Storage Allocation in Edge Blockchain Systems","authors":"Jiarui Zhang, Yaodong Huang, Fan Ye, Yuanyuan Yang","doi":"10.1109/IWQOS52092.2021.9521348","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521348","url":null,"abstract":"Edge computing guides the collaborative work of widely distributed nodes with different sensing, storage, and computing resources. For example, sensor nodes collect data and then store it in storage nodes so that computing nodes can access the data when needed. In this paper, we focus on the quality of service (QoS) in storage allocation in edge networks. We design a reputation mechanism for nodes in edge networks, which enables interactive nodes to evaluate the quality of service for reference. Each node publicly broadcasts a personal reputation list to evaluate all other nodes, and each node can calculate the global reputation of all nodes by aggregating personal reputations. We then propose a storage allocation algorithm that stores data to appropriate locations. The algorithm considers fairness, efficiency, and reliability which is derived from reputations. We build a novel Proof-of-Reputation (PoR) blockchain to support consensus on the reputation mechanism and storage allocation. The PoR blockchain ensures safety performance, saves computing resources, and avoids centralization. Extensive simulation results show our proposed algorithm is fair, efficient, and reliable. The results also show that in the presence of attackers, the success rate of honest nodes accessing data can reach 99.9%.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128941886","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":"ModelCoder: A Fault Model based Automatic Root Cause Localization Framework for Microservice Systems","authors":"Yang Cai, Biao Han, Jie Li, Na Zhao, Jinshu Su","doi":"10.1109/IWQOS52092.2021.9521318","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521318","url":null,"abstract":"Microservice system is an architectural style to develop a single application as a suite of small services running in its process and communicating with lightweight message mechanisms. Although microservice architecture enables rapid, frequent and reliable delivery of large, complex applications, it is increasingly challenging for operational staffs to locate the root cause of a microservice fault, which usually occurs on a service node and propagates to affect the entire system. To this end, in this paper, we first introduce the concept of deployment graph and service dependency graph to depict the deployment status and calling relationship between service nodes. Then we formulate the root cause localization problem in microservice systems based on the constructed graphs, in which fault model is defined to capture the characteristics of a fault’s root cause. A fault model based automatic root cause localization framework called ModelCoder is later developed to figure out the root cause of unknown faults by comparing with the predefined fault models. We evaluate ModelCoder on a real-world microservice system monitoring data set spanning 15 days. Through extensive experiments, it is revealed that ModelCoder can localize the fault root cause nodes within 80 seconds on average and improve the root cause localization accuracy (to 93%) by 12% compared with the state-of-the-art root cause localization algorithm.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130454174","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":"Optimizing Federated Learning on Device Heterogeneity with A Sampling Strategy","authors":"Xiaohui Xu, Sijing Duan, Jinrui Zhang, Yunzhen Luo, Deyu Zhang","doi":"10.1109/IWQOS52092.2021.9521361","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521361","url":null,"abstract":"Federated learning (FL) is a novel machine learning that performs distributed training locally on devices and aggregating the local models into a global one. The limited network bandwidth and the tremendous amount of model data that need to be transported bring up expensive communication cost. Meanwhile, heterogeneity in the devices’ local datasets and computation power exerts a huge influence on the performance of FL. To address these issues, we provide an empirical and mathematical analysis of device heterogeneity on the performance of model convergence and quality, then propose a holistic design to efficiently sample devices. Furthermore, we design a dynamic strategy to further speed up convergence and propose the FedAgg algorithm to alleviate the deviation caused by device heterogeneity. With extensive experiments performed in PyTorch, we show that the number of communication rounds required in FL can be reduced by up to 52% on the MNIST dataset, 32% on CIFAR-10, and 28% on FashionMNIST in comparison to the Federated Averaging algorithm.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126714184","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":"Neuron Manifold Distillation for Edge Deep Learning","authors":"Zeyi Tao, Qi Xia, Qun Li","doi":"10.1109/IWQOS52092.2021.9521267","DOIUrl":"https://doi.org/10.1109/IWQOS52092.2021.9521267","url":null,"abstract":"Although deep neural networks show their extraordinary power in various object detection tasks, it is very challenging for them to be deployed on resource constrained devices or embedded systems due to their high computational cost. Efforts such as model partition, pruning or quantization have been used at an expense of accuracy loss. Recently proposed knowledge distillation (KD) aims at transferring model knowledge from a well-trained model (teacher) to a smaller and faster model (student), which can significantly reduce the computational cost, memory usage, and prolong the battery lifetime. In this work, we propose a novel neuron manifold distillation (NMD), where the student models not only imitate teacher’s output activations, but also learn the feature geometry structure of the teacher. Our approach produces a high-quality, compact, and lightweight student model. We conduct comprehensive experiments with different distillation configurations over multiple datasets, and the proposed method demonstrates a consistent improvement in accuracy-speed trade-offs for the distilled model.","PeriodicalId":260373,"journal":{"name":"2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126284434","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}