{"title":"TSNTag","authors":"Jinli Yan, Wenwen Fu, W. Quan, Zhigang Sun","doi":"10.1145/3405837.3411399","DOIUrl":"https://doi.org/10.1145/3405837.3411399","url":null,"abstract":"Time-Sensitive Networking (TSN) emerges as a novel network paradigm by empowering ethernet with deterministic and reliable capabilities. Currently, the TSN Task Group has published comprehensive standards and drafts on time synchronization, flow control, etc [6]. Although TSN has a great potential to be applied in distributed real-time domains (e.g., aerospace, industry control, energy), it is challenging for developers to save resource consumption and cost when designing TSN infrastructures [5].","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130931176","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}
Xin Zhe Khooi, Levente Csikor, M. Kang, D. Divakaran
{"title":"Towards in-network time-decaying aggregates for heavy-hitter detection","authors":"Xin Zhe Khooi, Levente Csikor, M. Kang, D. Divakaran","doi":"10.1145/3405837.3411402","DOIUrl":"https://doi.org/10.1145/3405837.3411402","url":null,"abstract":"Keeping track of heavy hitters (HH) entirely in the data plane is an all-important aspect of many real-time monitoring tasks (e.g., load-balancing, attack detection). Existing interval-reset-based sketch and hash table approaches are incapable of delivering consistent and high accuracy when operating in heterogeneous scenarios where various applications with different purposes require the flows to be tracked at different time scales, not to mention their dependence on the control plane for data structure management. We propose HashAge and SkAge, novel in-network time-decaying algorithms for hash table- and sketch-based HH detection. We show that our proposed algorithms offer consistent and higher detection accuracy while operating in heterogeneous demands whilst not requiring any data structure management from the control plane at all.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"328 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114656296","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":"Visualizing QUIC and HTTP/3 with qlog and qvis","authors":"Robin Marx, W. Lamotte, P. Quax","doi":"10.1145/3405837.3412356","DOIUrl":"https://doi.org/10.1145/3405837.3412356","url":null,"abstract":"The new QUIC and HTTP/3 (H3) protocols being finalized by the IETF are powerful but also highly complex. They combine advanced approaches from predecessors such as TCP (e.g., congestion and flow control, reliability) and HTTP/2 (H2) (e.g., stream multiplexing, prioritization), with cutting-edge features (e.g., 0-RTT data, connection migration). As QUIC runs on top of UDP, these intricate systems have to be re-implemented from scratch, often in userspace, which has turned out to be error-prone. QUIC also fully integrates TLS 1.3 and is end-to-end encrypted at the transport layer. This means that, unlike with TCP, elements like packet and acknowledgement numbers are indiscernible to passive observers in encrypted packet traces (e.g., .pcap files analyzed with tools like Wireshark). As such, QUIC requires (ephemeral) TLS keys for even high-level analysis, leading to scalability, privacy and security issues. It is clear that QUIC+H3's overall complexity and heavy security focus make them difficult to implement, debug, observe, analyse, use and teach in practice.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134512645","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}
Guilherme Bueno, Mateus Saquetti, J. Azambuja, Weverton Cordeiro
{"title":"Defending lightweight virtual switches from cross-app poisoning attacks with vIFC","authors":"Guilherme Bueno, Mateus Saquetti, J. Azambuja, Weverton Cordeiro","doi":"10.1145/3405837.3411380","DOIUrl":"https://doi.org/10.1145/3405837.3411380","url":null,"abstract":"We present vIFC, a conceptual architecture for Information Flow Control (IFC) policy enforcement in lightweight programmable data planes (PDP) virtualization solutions. In contrast to existing solutions for preventing Cross-App Poisoning Attacks (CAP) like ProvSDN, our solution can monitor and prevent CAP attacks launched against lightweight virtual switches emulated by a general-purpose switch program or composed in a single switch program.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129729714","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 proof-of-concept 5G mobile gateway with eBPF","authors":"Federico Parola, S. Miano, Fulvio Risso","doi":"10.1145/3405837.3411395","DOIUrl":"https://doi.org/10.1145/3405837.3411395","url":null,"abstract":"In this poster we propose the first proof-of-concept open-source implementation of a 5G Mobile Gateway based on eBPF/XDP and present benchmarks that compare its performance with alternative technologies. We show how it outperforms other in-kernel solutions (e.g., OvS) and is comparable with DPDK-based platforms.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125154612","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":"MeshScope","authors":"Xing Li, Xiao Wang, Yan Chen","doi":"10.1145/3405837.3411370","DOIUrl":"https://doi.org/10.1145/3405837.3411370","url":null,"abstract":"The microservice architecture has been widely adopted in modern cloud environments. It greatly improves the flexibility of cloud applications by splitting a large and complex application into multiple microservices. To manage the communication among services, as an emerging microservice deployment paradigm, service mesh goes further. It builds a dedicated communication infrastructure layer that can transparently provide some standard features for microservices, such as load balancing, encryption, and access control. Benefiting from this, developers can focus on their applications' functionalities, and administrators can manage the inter-service communication elegantly and flexibly.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121069760","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":"Observing BGP route poisoning in the wild","authors":"Yangyang Wang, Mingwei Xu","doi":"10.1145/3405837.3411403","DOIUrl":"https://doi.org/10.1145/3405837.3411403","url":null,"abstract":"On the Internet, Border Gateway Protocol (BGP) is the standard to construct inter-domain routes among autonomous systems (ASes). Data traffic follows the inverse direction of BGP route propagation. For the outbound traffic, an AS can make its own selection in the range of the routes received from its peering neighbor ASes, and change the traffic outbound paths for better performance or bypassing failures. It is more difficult for ASes to control inbound traffic paths because it cannot determine the selection for remote ASes. An AS only has to manipulate BGP path attributes of the advertised prefixes it owns to trigger the potential path change from other ASes to itself.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129211278","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}
Pham Tran Anh Quang, Youcef Magnouche, Jérémie Leguay, Xuan Gong, Feng Zeng
{"title":"Model predictive control for load balancing","authors":"Pham Tran Anh Quang, Youcef Magnouche, Jérémie Leguay, Xuan Gong, Feng Zeng","doi":"10.1145/3405837.3411383","DOIUrl":"https://doi.org/10.1145/3405837.3411383","url":null,"abstract":"To improve bandwidth utilization, flow aggregates are typically split over multiple paths. This demonstration shows that load balancing can be enhanced by exploiting traffic predictions. We present a Model Predictive Control (MPC) based load balancing framework that optimizes the maximum link utilization to proactively mitigate congestion.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131361436","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}
Che Zhang, Zhen Wang, Shiwei Zhang, Weichao Li, Qing Li, Yi Wang
{"title":"Large scale symmetric network malfunction detection","authors":"Che Zhang, Zhen Wang, Shiwei Zhang, Weichao Li, Qing Li, Yi Wang","doi":"10.1145/3405837.3411373","DOIUrl":"https://doi.org/10.1145/3405837.3411373","url":null,"abstract":"Network malfunction detection is expected to be fast while ensuring accuracy to reduce its impact and cost. Existing malfunction detection (MD) approaches are often unable to achieve both simultaneously for large scale networks. A key factor that governs the quality of a MD system is to distinguish the malfunction ones with the normal ones. Considering many networks are designed to be symmetric and malfunctions are usually only a small portion, this paper propose A4 - an automatic MD system which combines node embedding based on structural similarity in graphs (Graph-Wave which scales linearly) with density-based spatial clustering (DBSCAN) to distinguish malfunctions as the noises efficiently for original symmetric networks.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116265783","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":"Towards optimal path encoding using SAT solver","authors":"Dong Guo, Ying Zhang","doi":"10.1145/3405837.3411389","DOIUrl":"https://doi.org/10.1145/3405837.3411389","url":null,"abstract":"A Software-Defined Networking with programmable data-plane allows applications to realize policies by generating both datapath layouts and rules on switches. However, computing optimized datapath layouts and populating the compact rules for such datapaths can be overwhelmingly complex. This paper introduces a generic approach to realize network-wide policies in network, then derive optimal encoding for paths and forwarding rules for switches by modeling the process as a SAT problem. Finally, the evaluations on real ISP topologies show that our solution achieves about a 50% reduction of the path encoding length in average compare with the state of the art.","PeriodicalId":396272,"journal":{"name":"Proceedings of the SIGCOMM '20 Poster and Demo Sessions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116294513","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}