{"title":"Recent Trends on Privacy-Preserving Technologies under Standardization at the IETF","authors":"Pratyush Dikshit, Jayasree Sengupta, Vaibhav Bajpai","doi":"10.1145/3610381.3610385","DOIUrl":"https://doi.org/10.1145/3610381.3610385","url":null,"abstract":"End-users are concerned about protecting the privacy of their sensitive personal data that are generated while working on information systems. This extends to both the data they actively provide including personal identification in exchange for products and services as well as its related metadata such as unnecessary access to their location. This is when certain privacy-preserving technologies come into a place where Internet Engineering Task Force (IETF) plays a major role in incorporating such technologies at the fundamental level. Thus, this paper offers an overview of the privacy-preserving mechanisms for layer 3 (i.e. IP) and above that are currently under standardization at the IETF. This includes encrypted DNS at layer 5 classified as DNS-over-TLS (DoT), DNS-over-HTTPS (DoH), and DNS-over-QUIC (DoQ) where the underlying technologies like QUIC belong to layer 4. Followed by that, we discuss Privacy Pass Protocol and its application in generating Private Access Tokens and Passkeys to replace passwords for authentication at the application layer (i.e. end-user devices). Lastly, to protect user privacy at the IP level, Private Relays and MASQUE are discussed. This aims to make designers, implementers, and users of the Internet aware of privacy-related design choices.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"65 1","pages":"22 - 30"},"PeriodicalIF":2.8,"publicationDate":"2023-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86223414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Annus Zulfiqar, Ben Pfaff, William Tu, G. Antichi, M. Shahbaz
{"title":"The Slow Path Needs an Accelerator Too!","authors":"Annus Zulfiqar, Ben Pfaff, William Tu, G. Antichi, M. Shahbaz","doi":"10.1145/3594255.3594259","DOIUrl":"https://doi.org/10.1145/3594255.3594259","url":null,"abstract":"Packet-processing data planes have been continuously enhanced in performance over the last few years to the point that, nowadays, they are increasingly implemented in hardware (i.e., in SmartNICs and programmable switches). However, little attention is given to the slow path residing between the data plane and the control plane, as it is not typically considered performance-critical. In this paper, we show that the slow path is set to become a new key bottleneck in Software-Defined Networks (SDNs). This is due to the growth in physical network bandwidth (200 Gbps is becoming common in data centers) and topological complexity (e.g., virtual switches now span hundreds of physical machines). We present our vision of a new Domain Specific Accelerator (DSA) for the slow path at the end host that sits between the hardware-offloaded data plane and the logically-centralized control plane. We discuss open problems in this domain and call on the networking community to creatively address this emerging issue.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"26 1","pages":"38 - 47"},"PeriodicalIF":2.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77032121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Loqman Salamatian, T. Arnold, Ítalo F. S. Cunha, Jiangcheng Zhu, Yunfan Zhang, Ethan Katz-Bassett, Matt Calder
{"title":"Who Squats IPv4 Addresses?","authors":"Loqman Salamatian, T. Arnold, Ítalo F. S. Cunha, Jiangcheng Zhu, Yunfan Zhang, Ethan Katz-Bassett, Matt Calder","doi":"10.1145/3594255.3594260","DOIUrl":"https://doi.org/10.1145/3594255.3594260","url":null,"abstract":"To mitigate IPv4 exhaustion, IPv6 provides expanded address space, and NAT allows a single public IPv4 address to suffice for many devices assigned private IPv4 address space. Even though NAT has greatly extended the shelf-life of IPv4, some networks need more private IPv4 space than what is officially allocated by IANA due to their size and/or network management practices. Some of these networks resort to using squat space, a term the network operations community uses for large public IPv4 address blocks allocated to organizations but historically never announced to the Internet. While squatting of IP addresses is an open secret, it introduces ethical, legal, and technical problems. In this work we examine billions of traceroutes to identify thousands of organizations squatting. We examine how they are using it and what happened when the US Department of Defense suddenly started announcing what had traditionally been squat space. In addition to shining light on a dirty secret of operational practices, our paper shows that squatting distorts common Internet measurement methodologies, which we argue have to be re-examined to account for squat space.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"168 1","pages":"48 - 72"},"PeriodicalIF":2.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76579085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Federico Parola, R. Procopio, Roberto Querio, Fulvio Risso
{"title":"Comparing User Space and In-Kernel Packet Processing for Edge Data Centers","authors":"Federico Parola, R. Procopio, Roberto Querio, Fulvio Risso","doi":"10.1145/3594255.3594257","DOIUrl":"https://doi.org/10.1145/3594255.3594257","url":null,"abstract":"Telecommunication operators are massively moving their network functions in small data centers at the edge of the network, which are becoming increasingly common. However, the high performance provided by commonly used technologies for data plane processing such as DPDK, based on kernel-bypass primitives, comes at the cost of rigid resource partitioning. This is unsuitable for edge data centers, in which efficiency demands both general-purpose applications and data-plane telco workloads to be executed on the same (shared) physical machines. In this respect, eBPF/XDP looks a more appealing solution, thanks to its capability to process packets in the kernel, achieving a higher level of integration with non-data plane applications albeit with lower performance than DPDK. In this paper we leverage the recent introduction of AF_XDP, an XDP-based technology that allows to efficiently steer packets in user space, to provide a thorough comparison of user space vs in-kernel packet processing in typical scenarios of a data center at the edge of the network. Our results provide useful insights on how to select and combine these technologies in order to improve overall throughput and optimize resource usage.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"19 1","pages":"14 - 29"},"PeriodicalIF":2.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82376491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast In-kernel Traffic Sketching in eBPF","authors":"S. Miano, Xiaoqi Chen, Ran Ben Basat, G. Antichi","doi":"10.1145/3594255.3594256","DOIUrl":"https://doi.org/10.1145/3594255.3594256","url":null,"abstract":"The extended Berkeley Packet Filter (eBPF) is an infrastructure that allows to dynamically load and run micro-programs directly in the Linux kernel without recompiling it. In this work, we study how to develop high-performance network measurements in eBPF. We take sketches as case-study, given their ability to support a wide-range of tasks while providing low-memory footprint and accuracy guarantees. We implemented NitroSketch, the state-of-the-art sketch for user-space networking and show that best practices in user-space networking cannot be directly applied to eBPF, because of its different performance characteristics. By applying our lesson learned we improve its performance by 40% compared to a naive implementation.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"42 1","pages":"3 - 13"},"PeriodicalIF":2.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84601412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Topology and Geometry of the Third-Party Domains Ecosystem: Measurement and Applications: ACM SIGCOMM Computer Communication Review: Vol 52, No 4","authors":"Costas Iordanou, Fragkiskos Papadopoulos","doi":"https://dl.acm.org/doi/10.1145/3577929.3577932","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577929.3577932","url":null,"abstract":"<p>Over the years, web content has evolved from simple text and static images hosted on a single server to a complex, interactive and multimedia-rich content hosted on different servers. As a result, a modern website during its loading time fetches content not only from its owner's domain but also from a range of third-party domains providing additional functionalities and services. Here, we infer the network of the third-party domains by observing the domains' interactions within users' browsers from all over the globe. We find that this network possesses structural properties commonly found in complex networks, such as power-law degree distribution, strong clustering, and small-world property. These properties imply that a hyperbolic geometry underlies the ecosystem's topology. We use statistical inference methods to find the domains' coordinates in this geometry, which abstract how popular and similar the domains are. The hyperbolic map we obtain is meaningful, revealing the large-scale organization of the ecosystem. Furthermore, we show that it possesses predictive power, providing us the likelihood that third-party domains are co-hosted; belong to the same legal entity; or merge under the same entity in the future in terms of company acquisition. We also find that complementarity instead of similarity is the dominant force driving future domains' merging. These results provide a new perspective on understanding the ecosystem's organization and performing related inferences and predictions.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"4 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138537029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The October 2022 Issue","authors":"Steve Uhlig","doi":"https://dl.acm.org/doi/10.1145/3577929.3577930","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577929.3577930","url":null,"abstract":"<p>Before we present the content of this issue, we want to make an announcement. We are delighted to introduce a new journal titled \"Proceedings of the ACM on Networking\" (PACMNET). PACMNET is among the last journals joining the recently launched Proceedings of the ACM (PACM) series. The goal of the PACM series is to showcase the highest quality research conducted in diverse areas of computer science as represented by the ACM Special Interest Groups (SIGs), SIGCOMM in our case.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"428 ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138506609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rethinking SIGCOMM's Conferences: Making Form Follow Function: ACM SIGCOMM Computer Communication Review: Vol 52, No 4","authors":"Scott Shenker","doi":"https://dl.acm.org/doi/10.1145/3577929.3577933","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577929.3577933","url":null,"abstract":"<p>In this short essay, I ask whether our current practice of highly selective conferences is helping us achieve SIGCOMM's research goals.<sup>1</sup> This requires first articulating what those goals are, and then evaluating our practices in relation to those goals. To no one's surprise, this essay contends that there is a significant mismatch between what I believe SIGCOMM's goals should be and what our current practices achieve. I then propose a radical restructuring of our conferences that would provide better alignment and, as an additional benefit, a stronger sense of community. However, I wrote this essay not to promote the specifics of a particular proposal, but to encourage our community to (i) engage in a thorough reexamination of how we organize SIGCOMM-sponsored conferences and (ii) seriously entertain the possibility of radical changes in our practices.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"21 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138537032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"LGC-ShQ: Datacenter Congestion Control with Queueless Load-Based ECN Marking: ACM SIGCOMM Computer Communication Review: Vol 52, No 4","authors":"Kristjon Ciko, Peyman Teymoori, Michael Welzl","doi":"https://dl.acm.org/doi/10.1145/3577929.3577931","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577929.3577931","url":null,"abstract":"<p>We present LGC-ShQ, a new ECN-based congestion control mechanism for datacenters. LGC-ShQ relies on ECN feedback from a Shadow Queue, and it uses ECN not only to decrease the rate, but it also increases the rate in relation to this signal. Real-life tests in a Linux testbed show that LGC-ShQ keeps the real queue at low levels while achieving good link utilization and fairness.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"45 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138537056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rethinking SIGCOMM's Conferences","authors":"S. Shenker","doi":"10.1145/3577929.3577933","DOIUrl":"https://doi.org/10.1145/3577929.3577933","url":null,"abstract":"In this short essay, I ask whether our current practice of highly selective conferences is helping us achieve SIGCOMM's research goals.1 This requires first articulating what those goals are, and then evaluating our practices in relation to those goals. To no one's surprise, this essay contends that there is a significant mismatch between what I believe SIGCOMM's goals should be and what our current practices achieve. I then propose a radical restructuring of our conferences that would provide better alignment and, as an additional benefit, a stronger sense of community. However, I wrote this essay not to promote the specifics of a particular proposal, but to encourage our community to (i) engage in a thorough reexamination of how we organize SIGCOMM-sponsored conferences and (ii) seriously entertain the possibility of radical changes in our practices.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"67 1","pages":"26 - 30"},"PeriodicalIF":2.8,"publicationDate":"2022-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84480854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}