2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)最新文献

Towards Sustainable Multi-Tier Space Networking for LEO Satellite Constellations 面向低轨道卫星星座的可持续多层空间网络

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812872

Yi Ching Chou, Xiaoqiang Ma, Feng Wang, Sami Ma, S. H. Wong, Jiangchuan Liu

{"title":"Towards Sustainable Multi-Tier Space Networking for LEO Satellite Constellations","authors":"Yi Ching Chou, Xiaoqiang Ma, Feng Wang, Sami Ma, S. H. Wong, Jiangchuan Liu","doi":"10.1109/IWQoS54832.2022.9812872","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812872","url":null,"abstract":"For the recent two years, companies such as Starlink, Kuiper, and Telesat are launching low earth orbit (LEO) satellites to form LEO satellite mega-constellations. Unfortunately, the LEO satellite mega-constellations are not sustainable in the long term since their large size makes LEO congested, causing issues such as satellite brightness, satellite conjunction, and space debris. The issues become worse as LEO satellites have shorter battery lifespans and experience drag force, which shortens the satellite life and produces more space debris objects when LEO satellites reach the end of life. To address the issues, we propose deploying higher-orbit satellites to form a satellite-based sustainable multi-tier space network (SMTSN) instead of launching a massive number of LEO satellites. In this paper, we model the costs and gains for routing traffic with our SMTSN framework. We propose a solution to find the optimal routing paths and an efficient distributed coverage-aware (EDCA) algorithm to predict the number of skipped LEO satellites when the traffic is routed through a higher-orbit satellite. We run extensive simulations to compare the LEO satellite constellations with and without our SMTSN framework, and the results show a significant improvement in the battery cell cycle life consumption with the SMTSN framework.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123391289","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}

引用次数: 3

Privacy-Preserving and Robust Federated Deep Metric Learning 隐私保护和鲁棒联邦深度度量学习

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812909

Yulong Tian, Xiaopeng Ke, Zeyi Tao, Shaohua Ding, Fengyuan Xu, Qun Li, Hao Han, Sheng Zhong, Xinyi Fu

{"title":"Privacy-Preserving and Robust Federated Deep Metric Learning","authors":"Yulong Tian, Xiaopeng Ke, Zeyi Tao, Shaohua Ding, Fengyuan Xu, Qun Li, Hao Han, Sheng Zhong, Xinyi Fu","doi":"10.1109/IWQoS54832.2022.9812909","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812909","url":null,"abstract":"Federated learning, in contrast to traditional learning paradigms, has demonstrated its unique advantages in providing intelligence at the edge. However, existing federated learning approaches focus on the end-to-end classification tasks requiring a simple collaboration procedure where each participant can perform its local training independently. Unfortunately, there are still many tasks relying on learning the distinguishable feature metrics with respect to all the data, which is a different collaboration procedure across training participants. For example, the model for people identification has to ensure the feature representing a person is dissimilar to those representing others. To enable such federated learning for deep metrics (a.k.a federated deep metric learning) is challenging due to the data privacy and procedure robustness issues. With the consideration of these two challenges, this work proposes a novel computing framework for federated deep metric learning. This framework leverages the system-algorithm co-design to address privacy concerns via the Trusted Execution Environment (SGX enclave) and Differential Privacy mechanism. It also introduces a large-scale federated protocol which can robustly and efficiently deal with practical factors like the network fluctuation. We implement and evaluate our computing framework with two settings. One is a real-world implementation with a large number of mobile devices, while the other one is in our controllable environment for conducting experiments in various tasks. Our evaluation results show that our computing framework is able to train federated deep metric learning models with excellent scalability, data privacy preserving, and considerable accuracy even in exception conditions.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123589280","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}

引用次数: 0

HPUCache: Toward High Performance and Resource Utilization in Clustered Cache via Data Copying and Instance Merging HPUCache:通过数据复制和实例合并实现集群缓存的高性能和资源利用率

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812925

Qianli Wang, Si Wu, Yongkun Li, Yinlong Xu, Fei Chen, Pengcheng Wang, Lei Han

{"title":"HPUCache: Toward High Performance and Resource Utilization in Clustered Cache via Data Copying and Instance Merging","authors":"Qianli Wang, Si Wu, Yongkun Li, Yinlong Xu, Fei Chen, Pengcheng Wang, Lei Han","doi":"10.1109/IWQoS54832.2022.9812925","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812925","url":null,"abstract":"As one of the most popular in-memory cache systems, Redis provides low-latency and high-performance data access for modern internet services. However, in large-scale Redis systems, the access skewness and locality in storage workloads induce a small number of hot-spot instances with degraded system performance and massive cold instances with low CPU utilization. This paper proposes HPUCache to address the hot-spots via data copying and cold instances via instance merging. HPUCache fully utilizes the cached mapping in Redis client, and dynamically updates this mapping to enable access to the multiple data copies. Hence it can manage multiple copies achieving both Redis client compatibility and high user access performance. It also proposes an asynchronous instance merging strategy based on disk snapshots and temporal caches, which separates the massive data movement from the critical user access path to achieve high performance instance merging. We integrate HPUCache into Redis. Experiments under two types of workloads show that, compared to the native Redis design, HPUCache achieves 2.4× and 3.5× performance gains, 2× and 6× CPU utilization gains respectively.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125377710","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}

引用次数: 1

Demystifying and Mitigating TCP Capping 解密和减轻TCP封顶

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812892

Qingkai Meng, Fengyuan Ren, Tong Zhang, Danfeng Shan, Yajun Yang

{"title":"Demystifying and Mitigating TCP Capping","authors":"Qingkai Meng, Fengyuan Ren, Tong Zhang, Danfeng Shan, Yajun Yang","doi":"10.1109/IWQoS54832.2022.9812892","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812892","url":null,"abstract":"Today’s Internet user experience greatly depends on some user-perceived network metrics, such as throughput and latency. To improve these metrics, many Internet content providers build the content delivery network (CDN) to provide their services. Generally, CDNs adopt TCP as their transport protocol. A recent line of work improves TCP by proposing novel congestion control algorithms. However, we measure TCP performance in the production CDN and identify an interesting phenomenon termed TCP capping. When the flows experience TCP capping, the fixed-size receive window (rwnd) restricts these flows from fully utilizing network bandwidth. Through in-depth analysis, we demystify that the root cause of TCP capping is an inappropriate constraint on rwnd due to not considering the receiver’s processing capability. To mitigate it, this paper proposes a server-side scheme Apollo and a client-side scheme Artemis for Internet content providers and users, respectively. Apollo probes the receiver’s processing capability and assists the sender in packet sending. And Artemis adjusts the receive buffer in light of the receiver’s processing capability. In our evaluation, compared to vanilla TCP, TCP (w/ Apollo) and TCP (w/ Artemis) shorten flow completion time by up to 91.8% and 94.9%, respectively.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125464034","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}

引用次数: 0

An Experimental Study of Triggered Multi-User Uplink Access with Real Application Traffic 真实应用流量下触发多用户上行接入的实验研究

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812876

Vinicius Da Silva Goncalves, E. Knightly

{"title":"An Experimental Study of Triggered Multi-User Uplink Access with Real Application Traffic","authors":"Vinicius Da Silva Goncalves, E. Knightly","doi":"10.1109/IWQoS54832.2022.9812876","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812876","url":null,"abstract":"The 802.11ax amendment introduced Triggered Uplink Access (TUA) to Wi-Fi to support uplink Multi-User (MU) MIMO. TUA coordinates simultaneous transmission of uplink users via an AP-transmitted trigger that gives an AP-selected group of users permission to transmit simultaneously for an AP-selected duration of time. Thus, TUA promises performance gains by enabling multi-user transmission and reducing contention overhead for access. In this paper, for the first time, we experimentally study the role of real application traffic on the performance of TUA. In particular, while TUA gains for fully backlogged traffic are well established, we show that bursty closed-loop traffic radically transforms performance. Using a real-time emulator, we experimentally evaluate the empirical limits of triggered uplink multi-user access with traffic from a real file transfer application and different uplink triggering strategies. Our results show that TUA significantly reduces file transfer latency compared to legacy single-user uplink, but unfortunately the standardized method for low-overhead backlog reporting leaves substantial benefits unrealized. Moreover, we show that unlike a single-user uplink, TUA has non-monotonic performance with respect to the frame aggregation limit.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125425433","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}

引用次数: 3

Nearly Optimal Protocols for Computing Multi-party Private Set Union 计算多方私有集联合的近最优协议

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812897

Xuhui Gong, Qiang-Sheng Hua, Hai Jin

{"title":"Nearly Optimal Protocols for Computing Multi-party Private Set Union","authors":"Xuhui Gong, Qiang-Sheng Hua, Hai Jin","doi":"10.1109/IWQoS54832.2022.9812897","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812897","url":null,"abstract":"Private Set Operations (PSO) are a hot research topic and one of the most extensive research problems in data mining. In the PSO, Multi-party Private Set Union (MPSU) is one of the fundamental problems. It allows some participants to learn the union of their data sets without leaking any useful information. However, most of the existing works have high communication, computation and round complexities. In this paper, we first propose a novel and efficient protocol to securely compute MPSU under the semi-honest model. In our system model, there exist n participants where each participant has a set of size k (k could be different among participants). There are also up to t (0 ≤ t < n) participants which could collude with each other. We suppose the communication channels among participants are insecure and can easily suffer from eavesdropping attacks. Our first protocol using element computing algorithm and Homomorphic Encryption, i.e., HE-MPSU, only requires O(1) rounds and has O(nNλ) communication complexity which almost matches the communication lower bound Ω(nN/log n) for the MPSU problem, where λ is a security parameter and N (k ≤ N ≤ nk) is the set union cardinality. In addition, we note that for the two-party case, i.e., n = 2, our HE-MPSU protocol has the same complexities as the state-of-the-art work in [1]. For this special case, i.e., two-party Private Set Union (PSU), we further optimize and design a more efficient protocol using oblivious transfer (OT) protocol, i.e., OT-PSU. It only requires O(1) rounds and O(kλ) communication complexity which almost matches the communication lower bound Ω(k). More importantly, it avoids using computationally expensive public-key operations (exponentiations). In other words, the number of exponentiations in this protocol is independent of the size of the data sets. Compared with the existing protocols, our two protocols have the lowest communication, computation and round complexities.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131749437","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}

引用次数: 2

PRM: An Efficient Partial Recovery Method to Accelerate Training Data Reconstruction for Distributed Deep Learning Applications in Cloud Storage Systems PRM:一种加速云存储系统中分布式深度学习应用训练数据重构的高效部分恢复方法

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812919

Piao Hu, Yunfei Gu, Ranhao Jia, Chentao Wu, Minyi Guo, Jie Li

{"title":"PRM: An Efficient Partial Recovery Method to Accelerate Training Data Reconstruction for Distributed Deep Learning Applications in Cloud Storage Systems","authors":"Piao Hu, Yunfei Gu, Ranhao Jia, Chentao Wu, Minyi Guo, Jie Li","doi":"10.1109/IWQoS54832.2022.9812919","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812919","url":null,"abstract":"Distributed deep learning is a typical machine learning method running in distributed environment such as cloud computing systems. The corresponding training, validation and test datasets are very large in general (e.g., several TBs), which need to be stored across multiple data nodes. Due to the high disk failure ratio in cloud storage systems, one of the critical issues for distributed deep learning is how to efficiently tolerate disk failures in the training procedures. These failures can lead to a large amount of data loss, which decreases the training accuracy and slows down the training process. Although several recovery methods are proposed to accelerate the data reconstruction, the related overhead is extremely high, such as high CPU/GPU utilization, a large number of I/Os, etc.To address the above problems, we propose a novel Partial-Recovery Method (called PRM) , which is an adaptive recovery method to accelerate data reconstruction for distributed deep learning applications in cloud storage systems. The key idea of PRM is combining the advantages of erasure coding’s ability to obtain global information on the data distribution with the AI’s ability to recover partial lost data, which can sharply reduce the overhead with acceptable training accuracy. To demonstrate the effectiveness of the PRM approach, we conduct several experiments. The results show that, compared to the state-of-the-art full or approximate recovery methods, PRM decreases the average network transmission time overhead by up to 64.50%, and reduces the recovery time by up to 55.90%, respectively.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893495","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}

引用次数: 0

QoS Routing Using Dominant-Distance Vectors 基于优势距离向量的QoS路由

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812900

J. Garcia-Luna-Aceves, Bradley R. Smith, Judith T. Samson

引用次数: 2

BubbleTCAM: Bubble Reservation in SDN Switches for Fast TCAM Update BubbleTCAM:用于快速TCAM更新的SDN交换机中的气泡保留

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812904

Cong Luo, Chuhao Chen, Hao Mei, Ruyi Yao, Ying Wan, Wenjun Li, Sen Liu, B. Liu, Yang Xu

{"title":"BubbleTCAM: Bubble Reservation in SDN Switches for Fast TCAM Update","authors":"Cong Luo, Chuhao Chen, Hao Mei, Ruyi Yao, Ying Wan, Wenjun Li, Sen Liu, B. Liu, Yang Xu","doi":"10.1109/IWQoS54832.2022.9812904","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812904","url":null,"abstract":"The unique hardware structure of Ternary Content-Addressable Memory (TCAM) enables its unparalleled lookup throughput but also causes slow update due to the Priority Order Constraint (POC). With the increase of application demands, TCAM update has become a bottleneck in the network. This paper proposes a new TCAM management mechanism named BubbleTCAM to enable fast TCAM update, in which available empty entries are defined as bubbles. The core idea of Bub-bleTCAM is to uniformly distribute bubbles and dependency chains in TCAM, which is beneficial to updates. BubbleTCAM consists of two components: bubble management and rule insertion. Bubble management enables TCAM to have uniformly distributed bubbles at all times through three key procedures: bubble lock reservation, bubble lock release and bubble generation. Rule insertion ensures that dependency chains of rules are uniformly stretched and distributed in TCAM. In addition, BubbleTCAM avoids the reorder problem by pre-sorting. Our evaluation based on the rulesets generated by ClassBench shows that BubbleTCAM effectively reduces the average cost and worst cost (in units of rule movements) during rule updates by at least 48% and 50%, respectively. Especially for the worst cost, the performance can be improved by up to 196x.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116015217","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}

引用次数: 3

APS: Adaptive Packet Sizing for Efficient End-to-End Network Transmission APS:有效的端到端网络传输的自适应数据包大小

2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) Pub Date : 2022-06-10 DOI: 10.1109/IWQoS54832.2022.9812871

Feixue Han, Qing Li, Jianer Zhou, Hong Chao Xu, Yong Jiang

{"title":"APS: Adaptive Packet Sizing for Efficient End-to-End Network Transmission","authors":"Feixue Han, Qing Li, Jianer Zhou, Hong Chao Xu, Yong Jiang","doi":"10.1109/IWQoS54832.2022.9812871","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812871","url":null,"abstract":"Much effort has been devoted to improving the performance of network transmission. Yet, the impact of packet size which is limited by the 1500-byte maximum transmission unit (MTU) has not received adequate attention. Through comprehensive experiments, we find that jumbo frames which are commonly used as an alternate do not always yield the best performance under different transmission situations.In this paper, we elaborate on the limitations of the regular and jumbo frames and analyze how packet sizes affect network performance. Based on these, we present Adaptively Packet Sizing (APS), a dynamic packet size adjustment method that can be easily integrated into existing window-based congestion control algorithms. APS utilizes a machine learning method to predict the optimal packet size, which can minimize flow completion time (FCT) according to the instantaneous network condition. Besides, a packet size based priority mechanism is proposed to further improve the performance. We implement APS in both simulation and testbed environments. APS reduces the FCT by up to 50% and gains better performance in scenarios with various loss rates.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130543173","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}

引用次数: 2