Jiayu Wang, Peng Liu, Zehua Guo, Sen Liu, Chao Yao
{"title":"Exploring the Impact of Attacks on Ring AllReduce","authors":"Jiayu Wang, Peng Liu, Zehua Guo, Sen Liu, Chao Yao","doi":"10.1145/3469393.3469676","DOIUrl":"https://doi.org/10.1145/3469393.3469676","url":null,"abstract":"Distributed Machine Learning (DML) is widely used to accelerate the training of the deep learning model. In DML, Parameter-Server (PS) and Ring AllReduce are two typical architectures. Recently, observing that many works address the security problem in PS, whose performance can be greatly degraded by malicious participation during the training process. However, the robustness of Ring AllReduce, which can solve the communication bandwidth problem in PS, to the malicious participant is still unknown. In this paper, we design a series of experiments to explore the security problem in Ring AllReduce, and reveal it can also suffer from the malicious participant.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115209388","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":"A Sketch Algorithm to Monitor High Packet Delay in Network Traffic","authors":"Jiaqi Zhu, Kai Zhang, Qun Huang","doi":"10.1145/3469393.3469398","DOIUrl":"https://doi.org/10.1145/3469393.3469398","url":null,"abstract":"Packet delay is a consensual indicator of network conditions. High delay packets of a flow indicate that there may be network congestion or network anomalies. In this paper, we consider Intra-FlowPacketDelay (IFPD), which is defined as the time span between two adjacent packets of a flow. In particular, we aim to detect packets that exhibit high IFPD. The key challenge is to simultaneously achieve high detection accuracy and preserve low resource usage. Existing measurement approaches reduce resource overheads by injecting probe packets or sampling. However, they can only measure an average delay of some packets but fail to monitor delay behavior of every single packet. To this end, we propose a sketch-based approach. Unfortunately, existing sketch-based methods cannot be directly applied to our high IFPD detection problem. That is because traditional sketch algorithms require that the update operation is additive, while measuring IFPD needs to deal with timestamps, which is not additive. We address this issue in three aspects: (i) using fingerprints to mitigate hash conflicts; (ii) a conservative update method that only selects one bucket to update; (iii) a replacement strategy that keeps potential flows with high IFPD in the sketch. Our experiments on real world traces demonstrate that our solution identifies high IFPD with nearly 99% recall rate and 99% precision with 600 KB memory, which outperforms existing sketch-based solutions.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116029984","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":"Physical-Layer Informed Multipath Redundancy Optimization for Mobile Real-Time Communication","authors":"Jing Chen, Zili Meng, Mingwei Xu","doi":"10.1145/3469393.3469673","DOIUrl":"https://doi.org/10.1145/3469393.3469673","url":null,"abstract":"• Popular RTC applications pose strict requirements on end-to-end latency • E.g., cloud video gaming, video conferencing, remote surgery ... • High variations of mobile “last mile” greatly impact the path condition • A common solution: Send data redundantly on multiple paths • E.g., when the condition of a path worsens, • Congestion control, AQM ... × • Duplicate data on another path (in good condition) √ Background APNet 2021 – 5th Asia-Pacific Workshop on Networking. Jun 24, 2021, Shenzhen, China.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"590 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123140336","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}
Byungkwon Choi, Jinwoo Park, Chunghan Lee, Dongsu Han
{"title":"pHPA: A Proactive Autoscaling Framework for Microservice Chain","authors":"Byungkwon Choi, Jinwoo Park, Chunghan Lee, Dongsu Han","doi":"10.1145/3469393.3469401","DOIUrl":"https://doi.org/10.1145/3469393.3469401","url":null,"abstract":"Microservice is an architectural style that breaks down monolithic applications into smaller microservices and has been widely adopted by a variety of enterprises. Like the monolith, autoscaling has attracted the attention of operators in scaling microservices. However, most existing approaches of autoscaling do not consider microservice chain and severely degrade the performance of microservices when traffic surges. In this paper, we present pHPA, an autoscaling framework for the microservice chain. pHPA proactively allocates resources to the microservice chains and effectively handles traffic surges. Our evaluation using various open-source benchmarks shows that pHPA reduces 99%-tile latency and resource usage by up to 70% and 58% respectively compared to the most widely used autoscaler when traffic surges.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130885772","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}
Wenting Wei, Tianjie Ju, Han Liao, Weike Zhao, Huaxi Gu
{"title":"FLAG: Flow Representation Generator based on Self-supervised Learning for Encrypted Traffic Classification","authors":"Wenting Wei, Tianjie Ju, Han Liao, Weike Zhao, Huaxi Gu","doi":"10.1145/3469393.3469394","DOIUrl":"https://doi.org/10.1145/3469393.3469394","url":null,"abstract":"Due to its excellent ability in learning features from large scale raw data, deep learning (DL) has attracted much attention for encrypted traffic classification. However, most DL-based traffic classifiers usually rely on enormous labeled samples. Motivated by this, we investigate a self-supervised traffic classifier (FLAG) without sacrifice of identification accuracy, only depending on small labeled traffic samples and highly available unlabeled traffic samples. Specifically, focusing on local short-term characteristics of traffic, we design a preprocessing algorithm, termed as N-phrase Extration, to convert unlabeled raw traffic dataset into sequences of high-frequency phrases as input of Bidirectional Encoder. On account of their significance, potential timing characteristics from input sequences are mined by Bidirectional Encoder and embedded into robust representations with distributed vectors to enhance classifier’s performance significantly. Our comprehensive experiments indicate FLAG can achieve 98.65% in 100% of dataset and 98.07% in 10% of dataset in terms of true positive rate in UNB ISCX VPN-nonVPN dataset, which are better than p-FP, FS-Net and Deep Packet.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114924283","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":"Flexible Routing with Policy Exchange","authors":"Bin Gui, Fangping Lan, Anduo Wang","doi":"10.1145/3469393.3469395","DOIUrl":"https://doi.org/10.1145/3469393.3469395","url":null,"abstract":"BGP and its alternatives alike, struggle with distributed policy making in the absence of a central authority: BGP prioritizes independence of the participating networks (e.g., ASes), imposes zero coordination, but has to tolerate inflexible policies each network can express. On the other hand, BGP alternatives (source routing, for example), through coordination, trade independence for flexibility, but only achieve flexibility partially. This paper asks, to achieve flexible routing, what is the fitting adjustment between network independence and coordination? To answer this question, we propose a simple principle that the sole end to interfere with the flexibility of a participating network is to prevent harms — decreasing the level of flexibility — to others. As an instantiation of this principle, we introduce the concept of policy exchange that dynamically adjusts independently set policies on the fly, and develop a preliminary implementation with conditional table, a strong knowledge representation system that allows us to distribute and manipulate policies with the usual SQL-like operators. Our preliminary experiments on realistic network topology and synthetic policies are encouraging.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123484431","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":"Learning Based Deadline Aware Congestion Control","authors":"Rongji Liao, Jinyao Yan, Tao Lin, Yuhao Chen","doi":"10.1145/3469393.3469675","DOIUrl":"https://doi.org/10.1145/3469393.3469675","url":null,"abstract":"A large variety of applications are deadline aware such as 360 degree VR (Virtual Reality), video conference and online gaming. In this paper, we propose a congestion control algorithm using deep reinforcement learning named DRL-CC to make the data arrive before the deadline. The initial experiments validate that our method dramatically increases the number of packets arrived before the deadline compared with existing algorithms.","PeriodicalId":291942,"journal":{"name":"5th Asia-Pacific Workshop on Networking (APNet 2021)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122287678","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}