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

{"title":"Congestion-Aware Modeling and Analysis of Sponsored Data Plan from End User Perspective","authors":"Yi Zhao, Qi Tan, Xiaohua Xu, Hui Su, Dan Wang, Ke Xu","doi":"10.1109/IWQoS54832.2022.9812866","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812866","url":null,"abstract":"The past decade has witnessed the rapid expansion of demands for mobile traffic, while the traditional mobile traffic pricing schemes cannot accommodate such demands. Sponsored data plan (SDP), which can increase the revenue of all stakeholders in the market through transferring some of the revenue from content providers (CPs) to end users (EUs), is more suitable. However, existing studies have focused more on Internet service providers (ISPs) and CPs, ignoring the influence of EUs (e.g., the inherent attribute differences of EUs and the interaction among EUs) on the market under SDP. Regarding the difficulty of modeling the abstract property about interaction among EUs, we utilize network congestion as the medium and construct the congestion-aware SDP model based on Stackelberg game. The newly proposed model can not only analyze how network congestion affects SDP mechanism, but also elucidate the impact of interactions among EUs. More specifically, through theoretical analysis, we prove that there is a unique dynamic equilibrium in the interaction among EUs (i.e., the traffic consumption of different EUs). By taking into account network congestion, the newly proposed model also more accurately and realistically describes the optimal strategies and computation methods of all stakeholders in the market. Moreover, simulation experiments demonstrate that the positive effect brought by SDP is not as obvious as before, and EUs influence each other instead of being independent of each other. Overall, this paper emphasizes the non-negligible influence of EUs and promotes a deeper understanding of SDP mechanism, which can guide the relevant stakeholders to optimize their own decision-making details.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"135 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":"115682204","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":"An Online Approach for DNN Model Caching and Processor Allocation in Edge Computing","authors":"Zhiqi Chen, Shenmin Zhang, Zhi Ma, Shuai Zhang, Zhuzhong Qian, Mingjun Xiao, Jie Wu, Sanglu Lu","doi":"10.1109/IWQoS54832.2022.9812874","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812874","url":null,"abstract":"Edge computing is a new computing paradigm rising gradually in recent years. Applications, such as object detection, virtual reality and intelligent cameras, often leverage Deep Neural Networks (DNN) inference technology. The traditional paradigm of DNN inference based on cloud suffers from high delay because of the limited bandwidth. From the perspective of service providers, caching DNN models on the edge brings several benefits, such as efficiency, privacy, security, etc.. The problem we concerned in this paper is how to decide the cached models and how to allocate processors of edge servers to reduce the overall system cost. To solve it, we model and study the DNN Model Caching and Processor Allocation (DMCPA) problem, which considers user-perceived delay and energy consumption with limited edge resources. We model it as an integer nonlinear programming (INLP) problem, and prove its NP-Completeness. Since it is considered as a long-term average optimization problem, we leverage the Lyapunov framework to develop a novel online algorithm DMCPA-GS-Online with Gibbs Sampling. We give the theoretical analysis to prove that our algorithm is near-optimal. In experiments, we study the performance of our algorithm and compare it with other baselines. The simulation results with the trace dataset from real world demonstrate the effectiveness and adaptiveness of our algorithm.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"32 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":"131009062","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":"Rethinking the Use of Network Cycle in Time-Sensitive Networking (TSN) Flow Scheduling","authors":"Jiashuo Lin, Weichao Li, Xingbo Feng, Shuangping Zhan, Jingbin Feng, Jinu Cheng, Tao Wang, Qing Li, Yi Wang, Fuliang Li, Bo Tang","doi":"10.1109/IWQoS54832.2022.9812895","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812895","url":null,"abstract":"Time-Sensitive Networking (TSN) is an emerging network architecture that provides bounded latency and reliable network services for time-sensitive applications. Since time-triggered flows in TSN are typically periodic, a concept of network cycle is widely used in both standards and academic researches. However, although network cycle has gained popularity, its rationale has not yet been analyzed systematically.In this paper, we mathematically evaluate the performance of several flow scheduling algorithms in terms of flow schedulability with and without employing network cycle. We observe that only when the network cycle is set to a proper value can the performance of flow scheduling be significantly improved. To better evaluate the scheduling effect, a novel assessment metric and a goal-based optimization algorithm are introduced. Our experiment results show that the network cycle-based algorithm can achieve a considerable improvement (40% - 170% improvement in the number of scheduled flows) compared to the ones with network cycle disabled.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"31 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":"126383570","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":"TASP: Enabling Time-Triggered Task Scheduling in TSN-Based Mixed-Criticality Systems","authors":"Xuyan Jiang, Yiming Zhang, Wenwen Fu, Xiangrui Yang, Yinhan Sun, Zhigang Sun","doi":"10.1109/IWQoS54832.2022.9812898","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812898","url":null,"abstract":"Distributed mixed-criticality system (DMCS) has been widely used in various critical domains such as self-driving cars and space crafts. To guarantee the end-to-end QoS (i.e., deadline/jitter requirements) of sensing-controlling-actuating control loops (CL) applications, DMCS adopts Time-Sensitive Networking (TSN), an emerging real-time Ethernet technology, for communication between end systems (ES). TSN provides a synchronized global clock and guarantees bounded delay for time-critical traffic in CLs, making it possible for DMCS to collaboratively schedule the computation (on ES) and communication (in TSN) to meet the Quality of Service (QoS) requirement. However, as modern DMCS tends to use fully-fledged Linux distributions (rather than a custom real-time OS) on ES to enjoy Linux’s mature ecosystem, it is challenging for DMCS to realize TSN-based QoS guarantees because the event-triggered scheduling of Linux on ES is incompatible with TSN.This paper proposes TAsk Scheduling Puppeteer (TASP), a mechanism that schedules CL tasks based on TSN without modifying the Linux OS. The key idea of TASP is to manipulate task scheduling by controlling the timing of CL packet submissions at the interface between TSN and ES. Specifically, TASP extracts two parameters: Fore Guardband (ForeGB) and Back Guardband (BackGB). During the ForeGB period before a CL packet’s submission, TASP forbids any packets’ submission; while during the BackGB period after a CL packet’s submission, TASP forbids any other CL packets’ submission. ForeGB and BackGB can ensure that there is at most one schedulable task on the ES at any time, and thus Linux has no choice but to schedule the only task, making the Linux scheduler a puppet. We have deployed TASP and evaluated it in real-world TSN switches based on an open-source TSN project, OpenTSN. The TASP-enabled ES can achieve task scheduling precisely based on TSN’s global clock, which outperforms the original ES by reducing end-to-end jitter from milliseconds to microseconds.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"24 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":"114757758","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":"Bandwidth Prediction for 5G Cellular Networks","authors":"Yuxiang Lin, Yi Gao, Wei Dong","doi":"10.1109/IWQoS54832.2022.9812912","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812912","url":null,"abstract":"Effective bandwidth prediction in the fifth-generation (5G) cellular networks is essential for bandwidth-consuming applications, such as virtual reality and holographic video streaming. However, accurate bandwidth prediction in 5G networks remains a challenging task due to the short-distance coverage and frequent handover properties of 5G base stations. In this paper, we propose HYPER, a HYbrid bandwidth PrEdiction appRoach using commercial smartphones. Hyper uses an AutoRegressive Moving Average (ARMA) time series predictive model for intra-cell bandwidth prediction and a Random Forest (RF) regression model for cross-cell bandwidth prediction. Our ARMA model takes prior bandwidth usage as its input, while the RF model further uses related network and physical features to predict future bandwidth. We conduct a measurement study in commercial 5G networks to analyze the relationship between these features and bandwidth. Moreover, we also propose a handover window adaptation algorithm to automatically adjust the handover window size and determine which model to use during handover. We use commercial 5G smartphones for data collection and conduct extensive experiments in diverse urban environments. Experimental results based on one TB of cellular data show that HYPER can reduce the bandwidth prediction error by more than 13% compared to state-of-the-art bandwidth prediction approaches.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"51 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":"122689906","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":"Geographic Low-Earth-Orbit Networking without QoS Bottlenecks from Infrastructure Mobility","authors":"Lixin Liu, Hewu Li, Yuanjie Li, Zeqi Lai, Yangtao Deng, Yimei Chen, Wei Li, Qian Wu","doi":"10.1109/IWQoS54832.2022.9812903","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812903","url":null,"abstract":"Low-earth-orbit (LEO) satellite mega-constellations promise broadband, low-latency network infrastructure from space for terrestrial users in remote areas. However, they face new QoS bottlenecks from infrastructure mobility due to the fast-moving LEO satellites and earth’s rotations. Both cause frequent space-ground link churns and challenge the network latency, bandwidth, and availability at the global scale. Today’s LEO networks mask infrastructure mobility with fixed anchors (ground stations) but cause single-point bandwidth/latency bottlenecks. Instead, we design LBP to remove the LEO network’s QoS bottlenecks from infrastructure mobility. LBP removes remote terrestrial fixed anchors via geographic addressing for shorter latencies and more bandwidth. It adopts local, orbit direction-aware geographic routing to avoid global routing updates for high network availability. LBP further shortens the routing paths by refining handover policies by satellites’ orbital directions. Our experiments in controlled testbeds and trace-driven emulations validate LBP’s 1.64× network latency reduction, 9.66× more bandwidth, and improve network availability to 100%.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"os-34 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":"127776147","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":"UFLB: A Unified Framework for Modeling and Analyzing Load Balancing Methods in DCNs","authors":"Yawen Chen, Deke Guo, Bangbang Ren, Junjie Xie, Lailong Luo","doi":"10.1109/IWQoS54832.2022.9812902","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812902","url":null,"abstract":"Data centers usually employ scale-out network topologies to provide sufficient network bandwidth for applications. The traditional equal-cost multi-path (ECMP) routing method is proposed to tackle the serious load imbalance problem across all links. However, it does not achieve the desired performance and still incurs low network throughput. Consequently, researchers recently redesigned some load balancing mechanisms for data center networks (DCNs) from different design dimensions. However, it remains open to systematically measure and evaluate their performance in various settings. It is impractical for evaluators to implement or simulate involved load balancing mechanisms. In this paper, we propose a unified framework, UFLB, which can well model and emulate representative load balancing mechanisms for data center networks in a lightweight way. This framework has overcome three significant challenges: model traffic distribution in the symmetry as well as asymmetry data center networks, characterize mainstream load balancing methods, and systematically combine them with high accuracy. We evaluate the effectiveness of our model under not only general settings of data center networks but also some special settings, such as various link failures and asymmetric topologies. The results indicate that the deviation rate of UFLB is within 15% against the implementation of load balancing mechanisms, such as ECMP, CONGA, DRILL, HERMES, PRESTO, in NS2, while it can be several orders of magnitude faster.","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":"133537990","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":"Investigating the Predictability of QoS Metrics in Cellular Networks","authors":"Stefan Herrnleben, Johannes Grohmann, Veronika Lesch, Thomas Prantl, Florian Metzger, T. Hossfeld, Samuel Kounev","doi":"10.1109/IWQoS54832.2022.9812881","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812881","url":null,"abstract":"Applications on mobile devices face varying network conditions in cellular networks. The connected radio cell is often changing, especially with moving devices. Different access technologies, varying signal strengths, or distance to the connected radio tower influence the Quality of Service (QoS) of mobile applications. Existing technologies like buffering or adaptive video streaming work reactive, i.e., they react to a decreasing download bitrate. In contrast, these technologies and mobile applications in general could benefit from early knowledge of the expected connection quality.This work investigates the predictability of QoS metrics in cellular networks based on the experience of previous measurements. For this, we developed an Android app to measure download bitrates with minimal data consumption. We performed over 90 000 measurements using a single network operator and analyzed how precise QoS indicators like packet round trip times and download bitrates can be predicted. We developed a methodology to predict the expected download bitrate along a route and present our approach of aggregating measurements into hexagons of dynamic size. The core contributions of this work are (i) a methodology and implementation of systematic measurement data collection, (ii) an open data publication of our measurement data set, and (iii) an approach for predicting QoS metrics in cellular networks based on aggregated measurements. Our results show, that our approach is able to predict the downlink bitrate, the packet round trip time (ping), or DNS query duration along a given route.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"43 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":"131054043","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":"Dynamic Pricing Scheme for Edge Computing Services: A Two-layer Reinforcement Learning Approach","authors":"Feng Lyu, X. Cai, Fan Wu, Huali Lu, Sijing Duan, Ju Ren","doi":"10.1109/IWQoS54832.2022.9812869","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812869","url":null,"abstract":"Edge computing servers (ECSs) have been widely deployed in large-scale mobile edge computing (MEC) systems, which can provide nearby computing services by charging users a price. Service pricing schemes can regulate user task offloading and affect the total revenue of service providers. Investigating how to maximize the revenue of service provider and improve the utilization of edge computing resources becomes crucial while is challenging, considering the users mobility and the uncertainty of users service requests. In this paper, we model the dynamic pricing process of ECS as a Markov decision process and propose a dynamic pricing approach based on Dueling Double Deep Q Network (D3QN) by using the current load conditions and user characteristics, the goal of which is to maximize the revenue of service provider. In addition, considering more ECSs in the MEC system, with the dynamic variations of ECSs loads and the different arrival rate of user tasks, we propose a joint scheduling approach based on D3QN (called RLJS) to collectively improve the total service revenue of service providers. Specifically, we first use a data-driven method to group the ECSs and then devise a D3QN-based task scheduling scheme to distribute tasks among ECS groups by considering the load and price conditions in real time. Simulation results demonstrate the efficacy of RLJS in improving the total revenue of the system provider and reducing the user delays.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"41 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":"128475344","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":"How Asynchronous can Federated Learning Be?","authors":"Ningxin Su, Baochun Li","doi":"10.1109/IWQoS54832.2022.9812885","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812885","url":null,"abstract":"As a practical paradigm designed to involve large numbers of edge devices in distributed training of deep learning models, federated learning has witnessed a significant amount of research attention in the recent years. Yet, most existing mechanisms on federated learning assumed either fully synchronous or asynchronous communication strategies between clients and the federated learning server. Existing designs that were partially asynchronous in their communication were simple heuristics, and were evaluated using the number of communication rounds or updates required for convergence, rather than the wall-clock time in practice.In this paper, we seek to explore the entire design space between fully synchronous and asynchronous mechanisms of communication. Based on insights from our exploration, we propose Port, a new partially asynchronous mechanism designed to allow fast clients to aggregate asynchronously, yet without waiting excessively for the slower ones. In addition, Port is designed to adjust the aggregation weights based on both the staleness and divergence of model updates, with provable convergence guarantees. We have implemented Port and its leading competitors in Plato, an open-source scalable federated learning research framework designed from the ground up to emulate real-world scenarios. With respect to the wall-clock time it takes for converging to the target accuracy, Port outperformed its closest competitor, FedBuff, by up to 40% in our experiments.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"1 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":"126992824","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}