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

Harmonizing Energy Efficiency and QoE for Brightness Scaling-based Mobile Video Streaming 协调基于亮度缩放的移动视频流的能效和QoE

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

Chao Qian, Daibo Liu, Hongbo Jiang

{"title":"Harmonizing Energy Efficiency and QoE for Brightness Scaling-based Mobile Video Streaming","authors":"Chao Qian, Daibo Liu, Hongbo Jiang","doi":"10.1109/IWQoS54832.2022.9812899","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812899","url":null,"abstract":"Brightness scaling (BS) is an emerging and promising technique with outstanding energy efficiency on mobile video streaming. However, existing BS-based approaches totally neglect the inherent interaction effect between BS factor, video bitrate and environment context, and their combined impact on user’s visual perception in mobile scenario, leading to inharmonious between energy consumption and user’s quality of experience (QoE). In this paper, we propose PEO, a novel user-Perception-based video Experience Optimization for energy-constrained mobile video streaming, by jointly considering the inherent connection between device’s state of motion, BS factor, video bitrate and the resulting user-perceived quality. Specifically, by capturing the motion of on-the-run device, PEO first infers the optimal bitrate and BS factor, therefore avoiding bitrate-inefficiency for energy saving while guaranteeing the user-perceived QoE. On that basis, we formulate the device motion-aware and user perception-aware video streaming as an optimization problem where we present an optimal algorithm to maximize the object function, and thus propose an online bitrate selection algorithm. Our evaluation (based on trace analysis and user study) shows that, compared with state-of-the-art techniques, PEO can raise the perceived quality by 23.8%-41.3% and save up to 25.2% energy consumption.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"23 5 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":"115590472","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

VPPlus: Exploring the Potentials of Video Processing for Live Video Analytics at the Edge VPPlus:探索边缘实时视频分析的视频处理潜力

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

Junpeng Guo, Shengqing Xia, Chunyi Peng

引用次数: 2

Break the Blackbox! Desensitize Intra-domain Information for Inter-domain Routing 打破黑盒子!对域间路由的域内信息进行脱敏处理

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

Peizhuang Cong, Yuchao Zhang, Lei Wang, H. Ni, Wendong Wang, Xiangyang Gong, Tong Yang, Dan Li, Ke Xu

{"title":"Break the Blackbox! Desensitize Intra-domain Information for Inter-domain Routing","authors":"Peizhuang Cong, Yuchao Zhang, Lei Wang, H. Ni, Wendong Wang, Xiangyang Gong, Tong Yang, Dan Li, Ke Xu","doi":"10.1109/IWQoS54832.2022.9812918","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812918","url":null,"abstract":"Along with the ever-increasing amount of data generated from edge networks, cross domain (also known as Autonomous Systems, AS) transmission problem has attracted more and more attention. As mature and widely used inter-domain routing protocols, BGP-based solutions often use the number of domains (i.e. AS hops) of each path to make inter-domain routing decisions, which is simple and effective, but usually can not get the optimal routing results due to the lack of real state/information within ASes. These protocols choose the path with less AS hops as the forwarding path, even if the total latency or cost of the domains on this path is higher. While to solve this problem, directly access to intra-domain information as the assistance to make routing decisions is impractical due to data privacy.In this paper, we propose DIT, which makes near-optimal inter-domain routing decisions with desensitized intra-domain information. To do so, we design a homomorphic encrypted-based private number comparison scheme to export intra-domain information securely and thus assist in routing decisions. We conduct a series of experiments according to five real network topologies with nearly 900 simulated flows, and the results show that DIT reduces the number of forwarding hops by about 45% in average and reduces flow completion time by about 60%.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"11 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":"126160235","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

FROD: An Efficient Framework for Optimizing Decision Trees in Packet Classification 一种有效的数据包分类决策树优化框架

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

Longlong Zhu, Jiashuo Yu, Jiayi Cai, Jinfeng Pan, Zhigao Li, Zhengyang Zhou, Dong Zhang, Chunming Wu

{"title":"FROD: An Efficient Framework for Optimizing Decision Trees in Packet Classification","authors":"Longlong Zhu, Jiashuo Yu, Jiayi Cai, Jinfeng Pan, Zhigao Li, Zhengyang Zhou, Dong Zhang, Chunming Wu","doi":"10.1109/IWQoS54832.2022.9812915","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812915","url":null,"abstract":"To perform efficient packet classification, decision tree-based methods conduct decision trees via hand-tuned heuristics. Then the performance testing and optimization are executed to ensure an excellent searching speed and space overhead. Specifically, when the performance is below expectation, existing solutions attempt to optimize the algorithms, such as conducting more sophisticated heuristics. However, reconstruction or adjustment for algorithms produces an intolerable time overhead due to the long optimization period, caused by uncertain performance benefits and high pre-processing time. In this paper, we propose FROD, an efficient framework for optimizing the decision trees directly in packet classification. FROD raises a meticulous evaluation to accurately appraise decision trees constructed by different heuristics. It then seeks out the bottleneck components via a lightweight heuristic. After that, FROD searches the optimal division for inferior components considering structural constraints and characteristics of traffic distribution. Evaluation on ClassBench shows that FROD benefits existing decision tree-based solutions in classification time by 41% and memory footprint by 19% on average, and reduces classification time by up to 64%.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"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":"123171633","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

A Privacy-aware Distributed Knowledge Graph Approach to QoIS-driven COVID-19 Misinformation Detection 基于qos驱动的COVID-19错误信息检测的隐私感知分布式知识图方法

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

Lanyu Shang, Ziyi Kou, Yang Zhang, Jin Chen, Dong Wang

{"title":"A Privacy-aware Distributed Knowledge Graph Approach to QoIS-driven COVID-19 Misinformation Detection","authors":"Lanyu Shang, Ziyi Kou, Yang Zhang, Jin Chen, Dong Wang","doi":"10.1109/IWQoS54832.2022.9812879","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812879","url":null,"abstract":"In this paper, we focus on the quality of information service (QoIS) of COVID-19-related information on social media. Our goal is to provide reliable COVID-19 information service by accurately detecting the misleading COVID-19 posts on social media by exploring the community-contributed COVID-19 fact data (CCFD) from different social media platforms. In particular, CCFD refers to the fact-checking reports that are submitted to each social media platform by its users and fact-checking professionals. Our work is motivated by the observation that CCFD often contains useful COVID-19 knowledge facts (e.g., \"COVID-19 is not a flu\") that can effectively facilitate the identification of misleading COVID-19 social media posts. However, CCFD is often private to the individual social media platform that owns it due to the data privacy concerns such as data copyright of CCFD and user profile information of CCFD contributors. In this paper, we leverage the CCFD from different social media platforms to accurately detect COVID19 misinformation while effectively protecting the privacy of CCFD. Two critical challenges exist in solving our problem: 1) how to generate privacy-aware COVID-19 knowledge facts from the platform-specific CCFD? 2) How to effectively integrate the privacy-aware COVID-19 knowledge facts from different social media platforms to correctly assess the truthfulness of a COVID19 post? To address these challenges, we develop CoviDKG, a COVID-19 distributed knowledge graph framework that constructs a set of CCFD-based knowledge graphs on individual social media platform and exchanges the privacy-aware COVID19 knowledge facts across different platforms to effectively detect misleading COVID-19 posts. We evaluate CoviDKG on two real-world social media datasets and the results show that CoviDKG achieves significant performance gains compared to state-of-the-art baselines in accurately detecting misleading COVID-19 posts on social media.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"3 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941215","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}

引用次数: 6

Service Placement and User Assignment in Multi-Access Edge Computing with Base-Station Failure 考虑基站故障的多址边缘计算服务布局与用户分配

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

Haruto Taka, Fujun He, E. Oki

{"title":"Service Placement and User Assignment in Multi-Access Edge Computing with Base-Station Failure","authors":"Haruto Taka, Fujun He, E. Oki","doi":"10.1109/IWQoS54832.2022.9812901","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812901","url":null,"abstract":"Multi-access edge computing (MEC) enables users to exploit the resources of cloud computing at a base station (BS) in proximity to the users where an MEC server is hosted. While we have advantage of being able to communicate with low latency and small network load in MEC networks, the resources in BSes are limited. One challenge is where to provide users with services from to make efficient use of resources. Furthermore, to enhance the reliability of MEC system, the case that a BS fails needs to be considered. This paper proposes a service placement and user assignment model with preventive start-time optimization against a single BS failure in MEC networks. The proposed model preventively determines the service placement and user assignment in each BS failure pattern to minimize the worst-case penalty which is the largest penalty among all failure patterns. We formulate the proposed model as an integer linear programming problem. We introduce two algorithms, one is the greedy algorithm with allocation upgrade and the other is with allocation upgrade and preemption, to solve the problem. The results show that the introduced algorithms obtain a solution with the smaller worst-case penalty than the benchmark in a practical time.","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":"130413744","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

Flexible and Efficient Multicast Transfers in Inter-Datacenter Networks 数据中心间网络中灵活高效的组播传输

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

Long Luo, Linjian Yu, Tie Ma, Hongfang Yu

{"title":"Flexible and Efficient Multicast Transfers in Inter-Datacenter Networks","authors":"Long Luo, Linjian Yu, Tie Ma, Hongfang Yu","doi":"10.1109/IWQoS54832.2022.9812867","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812867","url":null,"abstract":"The explosive growth of global distributed services has led to a massive increase in bulk multicast data transfers over the inter-datacenter Wide-Area Network. While many solutions have been proposed to improve the performance of inter-DC bulk data transfers, they are insufficient to optimize multicast transfers because they fail to explore the characteristics of multicast transfers and network topology. This paper presents FlexCast, a flexible and efficient solution to optimize the completion times for multicast transfers. FlexCast takes advantage of topological characteristics to divide network sites into groups, partition receivers into subsets, and construct load-adaptive Steiner trees for receiver partitions to reduce completion time. It also employs a flexible multicast model for parallel transmission. For better performance FlexCast uses multiple scheduling policies to handle offline request submission, and for greater efficiency it adopts a combination of small-scale optimization and fast heuristic to address online request submission quickly. Simulations on real-world topologies show that FlexCast improves the completion time for multicast receivers by up to 80% compared to prior solutions.","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":"133457244","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

Flow Sequence-Based Anonymity Network Traffic Identification with Residual Graph Convolutional Networks 基于流序列的残差图卷积网络匿名网络流量识别

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

Ruijie Zhao, Xianwen Deng, Yanhao Wang, Libo Chen, Ming Liu, Zhi Xue, Yijun Wang

{"title":"Flow Sequence-Based Anonymity Network Traffic Identification with Residual Graph Convolutional Networks","authors":"Ruijie Zhao, Xianwen Deng, Yanhao Wang, Libo Chen, Ming Liu, Zhi Xue, Yijun Wang","doi":"10.1109/IWQoS54832.2022.9812882","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812882","url":null,"abstract":"Identifying anonymity services from network traffic is a crucial task for network management and security. Currently, some works based on deep learning have achieved excellent performance for traffic analysis, especially those based on flow sequence (FS), which utilizes information and features of the traffic flow. However, these models still face a serious challenge because of lacking a mechanism to take into account relationships between flows, resulting in mistakenly recognizing irrelevant flows in FS as clues for identifying traffic. In this paper, we propose a novel FS-based anonymity network traffic identification framework to tackle this problem, which leverages Residual Graph Convolutional Network (ResGCN) to exploit relationships between flows for FS feature extraction. Moreover, we design a practical scheme to preprocess the raw data of real-world traffic, which further improves identification performance and efficiency. Experimental results on two real-world traffic datasets demonstrate that our method outperforms state-of-the-art methods by a large margin.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"47 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132791691","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}

引用次数: 5

DUET: Joint Deployment of Trucks and Drones for Object Monitoring DUET:联合部署卡车和无人机进行对象监控

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

Lihao Wang, Weijun Wang, Haipeng Dai, Jiaqi Zheng, Bangbang Ren, Shuyu Shi, Rong Gu

{"title":"DUET: Joint Deployment of Trucks and Drones for Object Monitoring","authors":"Lihao Wang, Weijun Wang, Haipeng Dai, Jiaqi Zheng, Bangbang Ren, Shuyu Shi, Rong Gu","doi":"10.1109/IWQoS54832.2022.9812917","DOIUrl":"https://doi.org/10.1109/IWQoS54832.2022.9812917","url":null,"abstract":"The limitation on the flight range motivates a hybrid monitoring system, wherein trucks carrying drones drive to pre-planned positions and then free drones for task execution. While the flight range limitation is mitigated, it is challenging to determine the destination of trucks and drones and set airborne cameras. This paper optimizes the joint Deployment of trUcks and dronEs for objecT monitoring (DUET), that is, deploy a set of trucks where each truck carries drones, and each drone is equipped with a varifocal camera such that the overall monitoring utility for target objects is maximized. To tackle the DUET problem, we first model the hybrid system and monitoring utility; then, discretize the solution space of DUET with performance bound. In this way, the problem is transformed into a two-level combinatorial optimization problem satisfying submodularity. To address it, a two-level greedy algorithm with $frac{{{{(e - 1)}^2}}}{{e(2e - 1)}} cdot (1 - varepsilon )$ approximation ratio is proposed to select deployment strategies. After the strategy selection, an optimal method is devised to carefully adjust the strategy for energy saving and communication improvement without loss of monitoring utility. Both simulations and field experiments are conducted to evaluate the proposed framework, which outperforms baseline algorithms on monitoring utility by at least 28.4% and 40%, respectively.","PeriodicalId":353365,"journal":{"name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","volume":"18 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":"114550420","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

EAScatter: Excitor-Aware Bluetooth Backscatter EAScatter:激励感知蓝牙反向散射

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

Zhanxiang Huang, Wei Gong

引用次数: 3