发布求助
文献互助 智能选刊 最新文献

ACM Sigcomm Computer Communication Review最新文献

筛选
英文 中文
Report of 2021 DINRG Workshop on Centralization in the Internet 2021年DINRG互联网集中化研讨会报告
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-30 DOI: 10.1145/3610381.3610386
C. Huitema, G. Huston, D. Kutscher, Lixia Zhang
{"title":"Report of 2021 DINRG Workshop on Centralization in the Internet","authors":"C. Huitema, G. Huston, D. Kutscher, Lixia Zhang","doi":"10.1145/3610381.3610386","DOIUrl":"https://doi.org/10.1145/3610381.3610386","url":null,"abstract":"The Internet Research Task Force (IRTF) Research Group on Decentralizing the Internet (DINRG) hosted a workshop on Centralization in the Internet on June 3, 2021. The workshop focused on painting a broad-brush landscape of the Internet centralization problem space: its starting point, its driving force, together with an articulation on what can and should be done.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"9 1","pages":"31 - 39"},"PeriodicalIF":2.8,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81122627","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
Measuring Broadband America: A Retrospective on Origins, Achievements, and Challenges 衡量宽带美国:回顾起源、成就和挑战
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-30 DOI: 10.1145/3610381.3610384
Eric W. Burger, Padma Krishnaswamy, H. Schulzrinne
{"title":"Measuring Broadband America: A Retrospective on Origins, Achievements, and Challenges","authors":"Eric W. Burger, Padma Krishnaswamy, H. Schulzrinne","doi":"10.1145/3610381.3610384","DOIUrl":"https://doi.org/10.1145/3610381.3610384","url":null,"abstract":"The \"Measuring Broadband America\" program, run by the United States Federal Communications Commission (FCC), continually measures and releases data on the performance of consumer broadband access networks in the US. This paper presents a retrospective on the program, from its beginnings in 2010 to the present. It also reviews the underlying measurement approaches, philosophies, distinguishing features, and lessons learned over the program's duration thus far. We focus on fixed broadband access since it is the program component with the longest history. We also discuss future directions and challenges.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"23 1","pages":"11 - 21"},"PeriodicalIF":2.8,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87937387","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
Vulnerability Disclosure Considered Stressful 被认为有压力的漏洞披露
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-30 DOI: 10.1145/3610381.3610383
G. Moura, J. Heidemann
{"title":"Vulnerability Disclosure Considered Stressful","authors":"G. Moura, J. Heidemann","doi":"10.1145/3610381.3610383","DOIUrl":"https://doi.org/10.1145/3610381.3610383","url":null,"abstract":"Vulnerability disclosure is a widely recognized practice in the software industry, but there is a lack of literature detailing the firsthand experiences of researchers who have gone through the process. This work aims to bridge that gap by sharing our personal experience of accidentally discovering a DNS vulnerability and navigating the vulnerability disclosure process for the first time. We document our mistakes and highlight the important lessons we learned, such as the fact that public disclosure can be effective but can also be more time-consuming and emotionally taxing than anticipated. Additionally, we discuss the ethical considerations and potential consequences that may arise during each step of the disclosure process. Lastly, drawing from our own experiences, we identify and discuss issues with the current disclosure process and propose recommendations for its improvement. Our ultimate aim is to provide valuable insights to fellow researchers who may encounter similar challenges in the future and contribute to the enhancement of the overall disclosure process for the benefit of the wider community.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"30 1","pages":"2 - 10"},"PeriodicalIF":2.8,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77397282","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
A Retrospective on Campus Network Traffic Monitoring 校园网流量监控回顾
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-30 DOI: 10.1145/3610381.3610387
M. Arlitt, Mehdi Karamollahi, C. Williamson
{"title":"A Retrospective on Campus Network Traffic Monitoring","authors":"M. Arlitt, Mehdi Karamollahi, C. Williamson","doi":"10.1145/3610381.3610387","DOIUrl":"https://doi.org/10.1145/3610381.3610387","url":null,"abstract":"On April 1, 2023 we stopped monitoring the traffic on our campus Internet link, nearly 20 years to the day since we first started doing so. During these two decades, we faced a vast array of issues that affected the collection, storage, analysis and backup of our monitoring data. In this paper we share some of our experiences, so that future networking researchers have an opportunity to learn from our successes as well as our many mistakes and misfortunes.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"29 1","pages":"40 - 45"},"PeriodicalIF":2.8,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72954083","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 April 2023 Issue 2023年4月刊
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-30 DOI: 10.1145/3610381.3610382
Steve Uhlig
{"title":"The April 2023 Issue","authors":"Steve Uhlig","doi":"10.1145/3610381.3610382","DOIUrl":"https://doi.org/10.1145/3610381.3610382","url":null,"abstract":"This April 2023 issue contains one technical paper and four editorial notes.","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"42 1","pages":"1 - 1"},"PeriodicalIF":2.8,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86522900","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
P4RROT: Generating P4 Code for the Application Layer P4RROT:为应用层生成P4代码
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-20 DOI: https://dl.acm.org/doi/10.1145/3594255.3594258
Csaba Györgyi, Sándor Laki, Stefan Schmid
{"title":"P4RROT: Generating P4 Code for the Application Layer","authors":"Csaba Györgyi, Sándor Laki, Stefan Schmid","doi":"https://dl.acm.org/doi/10.1145/3594255.3594258","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594255.3594258","url":null,"abstract":"<p>Throughput and latency critical applications could often benefit of performing computations close to the client. To enable this, distributed computing paradigms such as edge computing have recently emerged. However, with the advent of programmable data planes, computations cannot only be performed by servers but they can be offloaded to network switches. Languages like P4 enable to flexibly reprogram the entire packet processing pipeline. Though these devices promise high throughput and ultra-low response times, implementing application-layer tasks in the data plane programming language P4 is still challenging for an application developer who is not familiar with networking domain. In this paper, we first identify and examine obstacles and pain points one can experience when offloading server-based computations to the network. Then we present P4rrot, a code generator (in form of a library) which allows to overcome these limitations by providing a user-friendly API to describe computations to be offloaded. After discussing the design choices behind P4rrot, we introduce our proof-of-concept implementation for two P4 targets: Netronome SmartNIC and BMv2. To demonstrate the applicability of P4rrot, we investigate case studies in the context of publish-subscribe sensor data processing and real-time data streaming, supporting, in particular, MQTT-SN and MoldUDP packets.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"396 ","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138506614","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
Who Squats IPv4 Addresses? 谁占用了IPv4地址?
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-20 DOI: https://dl.acm.org/doi/10.1145/3594255.3594260
Loqman Salamatian, Todd Arnold, Ítalo Cunha, Jiangchen Zhu, Yunfan Zhang, Ethan Katz-Bassett, Matt Calder
{"title":"Who Squats IPv4 Addresses?","authors":"Loqman Salamatian, Todd Arnold, Ítalo Cunha, Jiangchen Zhu, Yunfan Zhang, Ethan Katz-Bassett, Matt Calder","doi":"https://dl.acm.org/doi/10.1145/3594255.3594260","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594255.3594260","url":null,"abstract":"<p>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 <i>squat space</i>, 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.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"378 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138506620","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 Slow Path Needs an Accelerator Too! 慢路也需要加速器!
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-20 DOI: https://dl.acm.org/doi/10.1145/3594255.3594259
Annus Zulfiqar, Ben Pfaff, William Tu, Gianni Antichi, Muhammad Shahbaz
{"title":"The Slow Path Needs an Accelerator Too!","authors":"Annus Zulfiqar, Ben Pfaff, William Tu, Gianni Antichi, Muhammad Shahbaz","doi":"https://dl.acm.org/doi/10.1145/3594255.3594259","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594255.3594259","url":null,"abstract":"<p>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.</p><p>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.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"415 3","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138506602","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
Fast In-kernel Traffic Sketching in eBPF eBPF中的快速内核内流量绘制
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-20 DOI: https://dl.acm.org/doi/10.1145/3594255.3594256
Sebastiano Miano, Xiaoqi Chen, Ran Ben Basat, Gianni Antichi
{"title":"Fast In-kernel Traffic Sketching in eBPF","authors":"Sebastiano Miano, Xiaoqi Chen, Ran Ben Basat, Gianni Antichi","doi":"https://dl.acm.org/doi/10.1145/3594255.3594256","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594255.3594256","url":null,"abstract":"<p>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.</p><p>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.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"377 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138506621","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
Comparing User Space and In-Kernel Packet Processing for Edge Data Centers 比较边缘数据中心的用户空间和内核内包处理
IF 2.8 4区 计算机科学
ACM Sigcomm Computer Communication Review Pub Date : 2023-04-20 DOI: https://dl.acm.org/doi/10.1145/3594255.3594257
Federico Parola, Roberto Procopio, Roberto Querio, Fulvio Risso
{"title":"Comparing User Space and In-Kernel Packet Processing for Edge Data Centers","authors":"Federico Parola, Roberto Procopio, Roberto Querio, Fulvio Risso","doi":"https://dl.acm.org/doi/10.1145/3594255.3594257","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594255.3594257","url":null,"abstract":"<p>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.</p>","PeriodicalId":50646,"journal":{"name":"ACM Sigcomm Computer Communication Review","volume":"363 1","pages":""},"PeriodicalIF":2.8,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138506624","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信