2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)最新文献_第4页

Application-Layer DDoS Defense with Reinforcement Learning 基于强化学习的应用层DDoS防御

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9213026

Yebo Feng, Jun Li, T. Nguyen

{"title":"Application-Layer DDoS Defense with Reinforcement Learning","authors":"Yebo Feng, Jun Li, T. Nguyen","doi":"10.1109/IWQoS49365.2020.9213026","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213026","url":null,"abstract":"Application-layer distributed denial-of-service (L7 DDoS) attacks, by exploiting application-layer requests to overwhelm functions or components of victim servers, have become a rising major threat to today's Internet. However, because the traffic from an L7 DDoS attack appears legitimate in transport and network layers, it is difficult for traditional DDoS solutions to detect and defend against an L7 DDoS attack. In this paper, we propose a new, reinforcement-learning-based approach to L7 DDoS attack defense. We introduce a multiobjective reward function to guide a reinforcement learning agent to learn the most suitable action in mitigating L7 DDoS attacks. Consequently, while actively monitoring and analyzing the victim server, the agent can apply different strategies under different conditions to protect the victim: When an L7 DDoS attack is overwhelming, the agent will aggressively mitigate as many malicious requests as possible, thereby keeping the victim server functioning (even at the cost of sacrificing a small number of legitimate requests); otherwise, the agent will conservatively mitigate malicious requests instead, with a focus on minimizing collateral damage to legitimate requests. The evaluation shows that our approach can achieve minimal collateral damage when the L7 DDoS attack is tolerable and mitigate 98.73 % of the malicious application messages when the victim is brought to its knees.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229126","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}

引用次数: 16

Online Distributed Edge Caching for Mobile Data Offloading in 5G Networks 5G网络中移动数据卸载的在线分布式边缘缓存

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9213007

Yiming Zeng, Yaodong Huang, Zhenhua Liu, Yuanyuan Yang

引用次数: 4

Greening Reliability of Virtual Network Functions via Online Optimization 通过在线优化实现虚拟网络功能的绿色可靠性

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9212998

Xiaojun Shang, Yu Liu, Yingling Mao, Zhenhua Liu, Yuanyuan Yang

引用次数: 4

Network-based Malware Detection with a Two-tier Architecture for Online Incremental Update 基于网络的两层在线增量更新恶意软件检测

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9212829

Anli Yan, Zhenxiang Chen, Riccardo Spolaor, Shuaishuai Tan, Chuan Zhao, Lizhi Peng, Bo Yang

{"title":"Network-based Malware Detection with a Two-tier Architecture for Online Incremental Update","authors":"Anli Yan, Zhenxiang Chen, Riccardo Spolaor, Shuaishuai Tan, Chuan Zhao, Lizhi Peng, Bo Yang","doi":"10.1109/IWQoS49365.2020.9212829","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212829","url":null,"abstract":"As smartphones carry more and more private information, it has become the main target of malware attacks. Threats on mobile devices have become increasingly sophisticated, making it imperative to develop effective tools that are able to detect and counter such threats. Unfortunately, existing malware detection tools based on machine learning techniques struggle to keep up due to the difficulty in performing online incremental update on the detection models. In this paper, a Two-tier Architecture Malware Detection (TAMD) method is proposed, which can learn from the statistical features of network traffic to detect malware. The first layer of TAMD identifies uncertain samples in the training set through a preliminary classification, whereas the second layer builds an improved classifier by filtering out such samples. We enhance TAMD with an incremental leaning based technique (TAMD-IL), which allows to incrementally update the detection models without retraining it from scratch by removing and adding sub-models in TAMD. We experimentally demonstrate that TAMD outperforms the existing methods with up to 98.72% on precision and 96.57% on recall. We also evaluate TAMD-IL on four concept drift datasets and compare it with classical machine learning algorithms, two state-of-the-art malware detection technologies, and three incremental learning technologies. Experimental results show that TAMD-IL is efficient in terms of both update time and memory usage.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"340 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134641493","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}

引用次数: 4

Finedge: A Dynamic Cost-Efficient Edge Resource Management Platform for NFV Network Finedge:面向NFV网络的动态、高性价比的边缘资源管理平台

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9212908

Miao Li, Qixia Zhang, Fangming Liu

{"title":"Finedge: A Dynamic Cost-Efficient Edge Resource Management Platform for NFV Network","authors":"Miao Li, Qixia Zhang, Fangming Liu","doi":"10.1109/IWQoS49365.2020.9212908","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9212908","url":null,"abstract":"With the evolution of network function virtualization (NFV) and edge computing, software-based network functions (NFs) can be deployed on closer-to-end-user edge servers to support a broad range of new services with high bandwidth and low latency. However, due to the resource limitation, strict QoS requirements and real-time flow fluctuations in edge network, existing cloud-based resource management strategy in NFV platforms is inefficient to be applied to the edge. Thus, we propose Finedge, $a$ dynamic, fine-grained and cost-efficient edge resource management platform for NFV network. First, we conduct empirical experiments to find out the effect of NFs' resource allocation and their flow-level characteristics on performance. Then, by jointly considering these factors and QoS requirements (e.g., latency and packet loss rate), Finedge can automatically assign the most suitable CPU core and tune the most cost-efficient CPU quota to each NF. Finedge is also implemented with some key strategies including real-time flow monitoring, elastic resource scaling up and down, and also flexible NF migration among cores. Through extensive evaluations, we validate that Finedge can efficiently handle heterogeneous flows with the lowest CPU quota and the highest SLA satisfaction rate as compared with the default OS scheduler and other state-of-the-art resource management schemes.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132403168","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}

引用次数: 21

I Know If the Journey Changes: Flexible Source and Path Validation 我知道旅程是否改变:灵活的来源和路径验证

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9213001

Fan Yang, Ke Xu, Qi Li, Rongxing Lu, Bo Wu, T. Zhang, Yi Zhao, Meng Shen

{"title":"I Know If the Journey Changes: Flexible Source and Path Validation","authors":"Fan Yang, Ke Xu, Qi Li, Rongxing Lu, Bo Wu, T. Zhang, Yi Zhao, Meng Shen","doi":"10.1109/IWQoS49365.2020.9213001","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213001","url":null,"abstract":"No matter from the perspective of detection or defense, source and path validations are fundamentally primitive in constructing security mechanisms to greatly enhance network immunity in the face of malicious attacks, such as injection, traffic hijacking and hidden threats. However, existing works for source and path verification still impose a non-trivial operational overhead and lack adjustment capability for path dynamic changes. In this paper, we propose a flexible and convenient source and path validation protocol called PSVM, which uses an authentication structure PIC composed of ordered pieces to carry out packet verification. Specifically, in the basic PSVM protocol, PIC (related to cryptographic computation) in the packet header does not require any update during packet verification, which thus enables a lower processing overhead in routers. To cope with the challenge of path policy changes in the running protocol, the dynamic PSVM protocol supports controllable adjustment and migration, especially in the case of avoiding a malicious node or region. Our evaluation of a prototype experiment on Click demonstrates that the verification efficiency of PSVM is barely influenced by payload size or path length. Compared to the baseline of normal IP routing, the throughput reduction ratio of the basic PSVM is about 13%, which is much better than 28% of existing best solution Origin and Path Trace (OPT). In addition, for a 35-hop path with 30 pieces of PIC needed to be adjusted in dynamic PSVM, the throughput reduction ratio of routing cross node performing the adjustment operation after normal verification is only 2.4 %.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115081752","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

Preventing Spread of Spam Transactions in Blockchain by Reputation 通过信誉防止区块链中的垃圾交易传播

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9213029

Jiarui Zhang, Y. Cheng, Xiaotie Deng, Bo Wang, Jan Xie, Yuanyuan Yang, Mengqian Zhang

{"title":"Preventing Spread of Spam Transactions in Blockchain by Reputation","authors":"Jiarui Zhang, Y. Cheng, Xiaotie Deng, Bo Wang, Jan Xie, Yuanyuan Yang, Mengqian Zhang","doi":"10.1109/IWQoS49365.2020.9213029","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213029","url":null,"abstract":"As one of the fastest-growing applications in the Peer-to-Peer (P2P) network, the development of blockchain technology is accompanied by different attacks. Those include whitewashing, free-riding, and distributed denial of service (DDoS) attacks, particularly because of features such as anonymity, distributed, permissionless in the blockchain network. One popular of them is spam transactions. Although the blockchain protocol requires each node to verify all received transactions, many nodes choose to forward transactions without verification to conserve their computational power, as there is no punishment for such a shirking. And it makes the blockchain vulnerable to the spreading of spam transactions over the network and creates extra burdens for all nodes in the network. We propose a reputation mechanism for the blockchain system to tackle this problem: Each node will locally compute reputations of its neighbors, and decide the probability to verify a received transaction based on the reputation value of the transaction sender. In turn, its neighbors will have an incentive to conduct verification to keep its reputation high. Subsequently, spam transactions can be blocked before reaching the miners. We have conducted a series of simulations, which clearly demonstrate the advantage of our reputation mechanism.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128514338","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

MPTCP+: Enhancing Adaptive HTTP Video Streaming over Multipath MPTCP+:在多路径上增强自适应HTTP视频流

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9213038

Jia Zhao, Jiangchuan Liu, Cong Zhang, Yong Cui, Yong Jiang, Wei Gong

{"title":"MPTCP+: Enhancing Adaptive HTTP Video Streaming over Multipath","authors":"Jia Zhao, Jiangchuan Liu, Cong Zhang, Yong Cui, Yong Jiang, Wei Gong","doi":"10.1109/IWQoS49365.2020.9213038","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213038","url":null,"abstract":"This paper presents a systematic study on adaptive streaming over MPTCP. We start from realworld experiments with Dynamic Adaptive Streaming over HTTP (DASH) and analysis on its performance over MPTCP. We show that DASH can greatly benefit from the improved aggregated throughput by MPTCP; yet the inter-path throughput difference and the intra-path throughput fluctuation have noticeable (negative) impact, too. Without a proper design of path selection and adaptation in MPTCP, they can easily confuse the adaptation logic of DASH, resulting in low bitrates or frequent rebuffering even if high-bandwidth paths are available. We present MPTCP+, an extended multipath TCP solution to offer high quality and smooth playback for adaptive HTTP streaming. MPTCP+ incorporates a path use decision algorithm that smartly disables/enables a path to minimize the inter-path difference, and a novel congestion control algorithm that smooths congestion window evolution with multiple paths. We have implemented MPTCP+ in the MPTCP Linux kernel, with minimum change on the server-side MPTCP module only. It is fully compatible with the existing MPTCP clients and requires no change on the upper-layer protocols, too. Our experiments suggest that MPTCP+ increases the quality of experience (QoE) of DASH by up to 50%.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116999460","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

i5GAccess: Nash Q-learning Based Multi-Service Edge Users Access in 5G Heterogeneous Networks i5GAccess:基于纳什q学习的5G异构网络多业务边缘用户接入

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9212950

Anqi Zhu, Songtao Guo, Mingfang Ma

引用次数: 0

Adaptive and Robust Network Routing Based on Deep Reinforcement Learning with Lyapunov Optimization 基于Lyapunov优化的深度强化学习的自适应鲁棒网络路由

2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) Pub Date : 2020-06-01 DOI: 10.1109/IWQoS49365.2020.9213056

Zirui Zhuang, Jingyu Wang, Q. Qi, J. Liao, Zhu Han

{"title":"Adaptive and Robust Network Routing Based on Deep Reinforcement Learning with Lyapunov Optimization","authors":"Zirui Zhuang, Jingyu Wang, Q. Qi, J. Liao, Zhu Han","doi":"10.1109/IWQoS49365.2020.9213056","DOIUrl":"https://doi.org/10.1109/IWQoS49365.2020.9213056","url":null,"abstract":"The most recent development of the Internet of Things brings massive timely-sensitive and yet bursty data flows. The adaptive network control has been explored using deep reinforcement learning, but it is not sufficient for extremely bursty network traffic flows, especially when the network traffic pattern may change over time. We model the routing control in an environment with time-variant link delays as a Lyapunov optimization problem. We identify that there is a tradeoff between optimization performance and modeling accuracy when the propagation delays are included. We propose a novel deep reinforcement learning-based adaptive network routing method to tackle the issues mentioned above. A Lyapunov optimization technique is used to reduce the upper bound of the Lyapunov drift, which leads to improved queuing stability in networked systems. Experiment results show that the proposed method can learn a routing control policy and adapt to the changing environment. The proposed method outperforms the baseline backpressure method in multiple settings, and converges faster than existing methods. Moreover, the deep reinforcement learning module can effectively learn a better estimation of the longterm Lyapunov drift and penalty functions, and thus it provides superior results in terms of the backlog size, end-to-end latency, age of information, and throughput. Extensive experiments also show that the proposed model performs well under various topologies, and thus the proposed model can be used in general cases. Also the user can adjust the preference parameter at ant time without the need to retrain the neural networks.","PeriodicalId":177899,"journal":{"name":"2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127873731","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