首页 > 最新文献

ACM Sigcomm Computer Communication Review最新文献

英文 中文
Recent Trends on Privacy-Preserving Technologies under Standardization at the IETF IETF标准化下隐私保护技术的最新趋势
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-03 DOI: 10.1145/3610381.3610385
Pratyush Dikshit, Jayasree Sengupta, Vaibhav Bajpai
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.
终端用户关心如何保护他们在使用信息系统时产生的敏感个人数据的隐私。这扩展到他们主动提供的数据,包括个人身份信息,以换取产品和服务,以及相关的元数据,如不必要的访问他们的位置。这就是当某些隐私保护技术出现时,互联网工程任务组(IETF)在将这些技术整合到基础层面上发挥主要作用。因此,本文概述了目前IETF正在标准化的第3层(即IP)及以上层的隐私保护机制。这包括第5层的加密DNS,分为DNS-over- tls (DoT)、DNS-over- https (DoH)和DNS-over-QUIC (DoQ),其中QUIC等底层技术属于第4层。然后,我们讨论了隐私通行证协议及其在生成私有访问令牌和passkey中的应用,以取代应用层(即终端用户设备)的身份验证密码。最后,为了在IP层保护用户隐私,讨论了专用中继和掩码。其目的是使设计者、实现者和Internet用户意识到与隐私相关的设计选择。
{"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}
引用次数: 2
The Slow Path Needs an Accelerator Too! 慢路也需要加速器!
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-01 DOI: 10.1145/3594255.3594259
Annus Zulfiqar, Ben Pfaff, William Tu, G. Antichi, M. Shahbaz
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.
在过去的几年中,数据包处理数据平面的性能不断提高,如今,它们越来越多地在硬件(即smartnic和可编程交换机)中实现。然而,很少关注位于数据平面和控制平面之间的慢路径,因为它通常不被认为是性能关键的。在本文中,我们证明了慢路径将成为软件定义网络(sdn)的一个新的关键瓶颈。这是由于物理网络带宽的增长(200 Gbps在数据中心变得越来越普遍)和拓扑复杂性(例如,虚拟交换机现在跨越数百台物理机器)。我们提出了一个新的领域特定加速器(DSA)的愿景,用于位于硬件卸载数据平面和逻辑集中控制平面之间的终端主机的慢路径。我们讨论了这个领域的开放问题,并呼吁网络社区创造性地解决这个新出现的问题。
{"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}
引用次数: 1
Who Squats IPv4 Addresses? 谁占用了IPv4地址?
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-01 DOI: 10.1145/3594255.3594260
Loqman Salamatian, T. Arnold, Ítalo F. S. Cunha, Jiangcheng Zhu, Yunfan Zhang, Ethan Katz-Bassett, Matt Calder
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.
为了缓解IPv4地址的枯竭,IPv6提供了扩展的地址空间,而NAT允许单个公网IPv4地址满足多个分配私有IPv4地址空间的设备。尽管NAT极大地延长了IPv4的保质期,但由于网络的规模和/或网络管理实践,一些网络需要比IANA官方分配的更多的私有IPv4空间。其中一些网络诉诸于使用“蹲下空间”(蹲下空间),这是网络运营社区使用的一个术语,指的是分配给组织但从未向互联网公布的大型公共IPv4地址块。虽然占用IP地址是一个公开的秘密,但它会带来道德、法律和技术问题。在这项工作中,我们检查了数十亿条跟踪路由,以确定数千个组织的非法占用。我们来看看他们是如何使用它的,以及当美国国防部突然开始宣布传统上的蹲点空间时发生了什么。除了揭露操作实践的肮脏秘密外,我们的论文还表明,蹲下扭曲了常见的互联网测量方法,我们认为必须重新检查这些方法以解释蹲下空间。
{"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}
引用次数: 1
Comparing User Space and In-Kernel Packet Processing for Edge Data Centers 比较边缘数据中心的用户空间和内核内包处理
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-01 DOI: 10.1145/3594255.3594257
Federico Parola, R. Procopio, Roberto Querio, Fulvio Risso
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.
电信运营商正在大规模地将其网络功能转移到网络边缘的小型数据中心,这种情况正变得越来越普遍。然而,常用的数据平面处理技术(如DPDK)基于内核绕过原语提供的高性能是以严格的资源分区为代价的。这不适用于边缘数据中心,因为边缘数据中心的效率要求在相同的(共享的)物理机器上执行通用应用程序和数据平面电信工作负载。在这方面,eBPF/XDP看起来是一个更有吸引力的解决方案,因为它能够在内核中处理数据包,实现与非数据平面应用程序的更高级别集成,尽管性能低于DPDK。在本文中,我们利用最近引入的AF_XDP(一种基于xdp的技术,允许有效地引导用户空间中的数据包),在网络边缘数据中心的典型场景中提供用户空间与内核内数据包处理的全面比较。我们的结果为如何选择和组合这些技术以提高总体吞吐量和优化资源使用提供了有用的见解。
{"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}
引用次数: 1
Fast In-kernel Traffic Sketching in eBPF eBPF中的快速内核内流量绘制
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-01-01 DOI: 10.1145/3594255.3594256
S. Miano, Xiaoqi Chen, Ran Ben Basat, G. Antichi
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.
扩展的Berkeley Packet Filter (eBPF)是一种基础结构,它允许直接在Linux内核中动态加载和运行微程序,而无需重新编译它。在这项工作中,我们研究了如何在eBPF中开发高性能的网络测量。我们将草图作为案例研究,因为它们能够支持广泛的任务,同时提供低内存占用和准确性保证。我们实现了用于用户空间网络的最先进草图NitroSketch,并表明用户空间网络中的最佳实践不能直接应用于eBPF,因为它具有不同的性能特征。通过应用我们的经验教训,我们将其性能提高了40%。
{"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}
引用次数: 3
Topology and Geometry of the Third-Party Domains Ecosystem: Measurement and Applications: ACM SIGCOMM Computer Communication Review: Vol 52, No 4 第三方域生态系统的拓扑和几何:测量和应用:ACM SIGCOMM计算机通信评论:Vol 52, No 4
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-12-19 DOI: https://dl.acm.org/doi/10.1145/3577929.3577932
Costas Iordanou, Fragkiskos Papadopoulos

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.

多年来,web内容已经从托管在单个服务器上的简单文本和静态图像演变为托管在不同服务器上的复杂,交互式和多媒体丰富的内容。因此,现代网站在加载时不仅从其所有者的域名中获取内容,还从一系列提供额外功能和服务的第三方域名中获取内容。在这里,我们通过观察域在全球用户浏览器中的交互来推断第三方域的网络。我们发现该网络具有复杂网络中常见的幂律度分布、强聚类和小世界性质等结构特性。这些特性暗示了生态系统拓扑结构的基础是双曲几何。我们用统计推理的方法在这个几何图形中找到域的坐标,抽象出域的流行程度和相似程度。我们得到的双曲图是有意义的,它揭示了生态系统的大规模组织。此外,我们表明它具有预测能力,为我们提供了第三方域共同托管的可能性;属于同一法人实体的;或者将来在公司收购方面合并到同一实体下。我们还发现,互补性而不是相似性是推动未来领域合并的主导力量。这些结果为理解生态系统的组织和进行相关推论和预测提供了新的视角。
{"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}
引用次数: 0
The October 2022 Issue 2022年10月号
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-12-19 DOI: https://dl.acm.org/doi/10.1145/3577929.3577930
Steve Uhlig

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.

在我们提出这个问题的内容之前,我们想做一个公告。我们很高兴地推出一份名为《美国计算机学会网络学报》(PACMNET)的新期刊。PACMNET是最近推出的ACM (PACM)系列会刊的最后一批期刊之一。PACM系列的目标是展示在计算机科学的不同领域进行的最高质量的研究,以ACM特别兴趣小组(SIGs)为代表,在我们的案例中是SIGCOMM。
{"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}
引用次数: 0
Rethinking SIGCOMM's Conferences: Making Form Follow Function: ACM SIGCOMM Computer Communication Review: Vol 52, No 4 重新思考SIGCOMM的会议:使形式遵循功能:ACM SIGCOMM计算机通信评论:卷52,第4期
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-12-19 DOI: https://dl.acm.org/doi/10.1145/3577929.3577933
Scott Shenker

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.

在这篇短文中,我想问我们目前的高选择性会议是否有助于我们实现SIGCOMM的研究目标这需要首先阐明这些目标是什么,然后根据这些目标评估我们的实践。毫无疑问,这篇文章认为,在我认为SIGCOMM的目标应该是什么和我们当前的实践实现之间存在着显著的不匹配。然后,我建议对我们的会议进行彻底的重组,以提供更好的一致性,并作为一个额外的好处,增强社区意识。然而,我写这篇文章并不是为了推广一个特定提案的细节,而是为了鼓励我们的社区(I)对我们如何组织sigcomm赞助的会议进行彻底的重新检查,以及(ii)认真考虑我们实践中彻底改变的可能性。
{"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}
引用次数: 0
LGC-ShQ: Datacenter Congestion Control with Queueless Load-Based ECN Marking: ACM SIGCOMM Computer Communication Review: Vol 52, No 4 LGC-ShQ:基于无队列负载的ECN标记的数据中心拥塞控制:ACM SIGCOMM计算机通信评论,Vol 52, No . 4
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-12-19 DOI: https://dl.acm.org/doi/10.1145/3577929.3577931
Kristjon Ciko, Peyman Teymoori, Michael Welzl

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.

我们提出了LGC-ShQ,一个新的基于ecn的数据中心拥塞控制机制。LGC-ShQ依赖于来自影子队列的ECN反馈,它不仅使用ECN来降低速率,而且还增加了与该信号相关的速率。在Linux测试平台上的实际测试表明,LGC-ShQ在实现良好的链路利用率和公平性的同时,将真实队列保持在较低的水平。
{"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}
引用次数: 0
Rethinking SIGCOMM's Conferences 重新思考SIGCOMM会议
IF 2.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-10-30 DOI: 10.1145/3577929.3577933
S. Shenker
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.
在这篇短文中,我想问我们目前的高选择性会议是否有助于我们实现SIGCOMM的研究目标这需要首先阐明这些目标是什么,然后根据这些目标评估我们的实践。毫无疑问,这篇文章认为,在我认为SIGCOMM的目标应该是什么和我们当前的实践实现之间存在着显著的不匹配。然后,我建议对我们的会议进行彻底的重组,以提供更好的一致性,并作为一个额外的好处,增强社区意识。然而,我写这篇文章并不是为了推广一个特定提案的细节,而是为了鼓励我们的社区(I)对我们如何组织sigcomm赞助的会议进行彻底的重新检查,以及(ii)认真考虑我们实践中彻底改变的可能性。
{"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}
引用次数: 0
期刊
ACM Sigcomm Computer Communication Review
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1