Tag Archives: editorial

A Retrospective on Campus Network Traffic Monitoring

Martin Arlitt, Mehdi Karamollahi, Carey Williamson

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.

Download from ACM

Report of 2021 DINRG Workshop on Centralization in the Internet

Christian Huitema, Geoff Huston, Dirk Kutscher, Lixia Zhang

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.

Download from ACM

Recent Trends on Privacy-Preserving Technologies under Standardization at the IETF

Pratyush Dikshit, Jayasree Sengupta, Vaibhav Bajpai

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.

Download from ACM

Measuring Broadband America: A Retrospective on Origins, Achievements, and Challenges

Eric W. Burger, Padma Krishnaswamy, Henning Schulzrinne

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.

Download from ACM

The April 2023 issue

This April 2023 issue contains one technical paper and four editorial notes.

The technical paper, Vulnerability Disclosure Considered Stressful, by Giovane C. M. Moura and colleagues, describes the authors’ experience running a Coordinated Vulnerability Disclosure (CVD) for the TSUNAME vulnerability. The process of Coordinated Vulnerability Disclosure (CVD) is widely viewed as the gold standard in the notification process that follows the discovery of a vulnerability, aiming at getting operators to patch their systems before attackers can do much harm. However, the task of setting up a CVD can be daunting because security researchers have too few guidelines and experience reports to rely on when they are faced with setting up their own process. This paper is helpful to our community as it may help anyone who may have to report vulnerabilities during their work.

Then, we have four editorial notes. In the first, Measuring Broadband America: A Retrospective on Origins, Achievements, and Challenges, Eric Burger and colleagues present a retrospective on the “Measuring Broadband America” program, run by the United States Federal Communications Commission (FCC), which continually measures and releases data on the performance of consumer broadband access networks in the US. In the second, Recent Trends on Privacy-Preserving Technologies under Standardization at the IETF, Pratyush Dikshit and colleagues present an overview of the privacy-preserving mechanisms for layer 3 (i.e. IP) and above that are currently under standardization at the IETF. The third editorial note, Report of 2021 DINRG Workshop on Centralization in the Internet, by Christian Huitema and colleagues, reports on the workshop on Centralization in the Internet hosted by the Internet Research Task Force (IRTF) Research Group on Decentralizing the Internet (DINRG), on June 3, 2021. The fourth editorial note, A Retrospective on Campus Network Traffic Monitoring, by Martin Arlitt and colleagues, shares some of the authors’ experiences about monitoring the traffic on their campus Internet link for about two decades.

I hope that you will enjoy reading this new issue and welcome comments and suggestions on CCR Online (https://ccronline.sigcomm.org) or by email at ccr-editor at sigcomm.org.

The January 2023 issue

This January 2023 issue contains five technical papers.

The first technical paper, Fast In-kernel Traffic Sketching in eBPF, by Sebastiano Miano and colleagues, studies how to develop high-performance network measurements in eBPF. The extended Berkeley Packet Filter (eBPF) allows to dynamically load and run micro-programs in the Linux kernel without the need for recompiling it. The authors use sketches as case-study, given their ability to support a wide-range of tasks while providing low-memory footprint and accuracy guarantees. The authors apply their approach to a state-of-the-art sketch for user-space networking, show that best practices in user-space networking cannot be directly applied to eBPF, and improve its performance by 40% compared to a naive implementation. The lessons learned in this paper are not only applicable to network measurement algorithms but extend to a wide variety of eBPF-based programs.

The second technical paper, Comparing User Space and In-Kernel Packet Processing for Edge Data Centers, by Federico Parola and colleagues, is motivated by the increased availability of small data centers at the edge of the network. Network operators are moving their network functions in these computing facilities. However, commonly used technologies for data plane processing such as DPDK, based on kernel-bypass primitives, provide high performance but 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. This research addresses the premise that in edge data centers, with limited resources, packet processing and protocol stack workloads are likely to be consolidated within the same servers. As a result, kernel-based XDP may be a more attractive option than DPDK-based data plane processing. This motivates the need for a deeper understanding of kernel-based XDP and its various forms to support different workload types.

The third technical paper, P4RROT: Generating P4 Code for the Application Layer, by Csaba Györgyi and colleagues, proposes a new code generation mechanism to streamline application-level offloads expressed in the P4 programming language. The authors present P4RROT, a new library that allow developers to write application layer logic in Python which is then converted in P4. The authors discuss the pain points and challenges for automatic code generation and show the applicability of P4RROT in two different contexts: a publish-subscribe sensor data processing system and a real-time data streaming engine, supporting MQTT-SN and MoldUDP traffic.

The fourth technical paper, The Slow Path Needs an Accelerator Too!, by Annus Zulfiqar and colleagues, shows that the slow path is set to become a new key bottleneck in Software-Defined Networks (SDNs). The authors present their 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. They also discuss open problems and call on the networking community to creatively address this emerging issue.

The fifth technical paper, Who squats IPv4 Addresses?, by Loqman Salamatian and colleagues, analyzes the phenomenon of squatted IP space: IPv4 addresses that operators use although they have not been allocated to them. This is possible because larger IPv4 blocks exist that have been allocated to organizations which never announced them in the global routing system. The authors draw on a very large data set of traceroutes and develop a heuristic to identify how squat space is used, by whom, and what the implications for Internet routing and the operator communities are. This paper is a significant contribution of interest to everyone with an interest in the operation of Internet routing and larger networks.

I hope that you will enjoy reading this new issue and welcome comments and suggestions on CCR Online (https://ccronline.sigcomm.org) or by email at ccr-editor at sigcomm.org.

Rethinking SIGCOMM’s Conferences: Making Form Follow Function

Scott Shenker

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.

Download from ACM

The October 2022 issue

This October 2022 issue contains two technical papers and one editorial note.

The first technical paper, LGC-ShQ: Datacenter Congestion Control with Queueless Load-based ECN Marking, by Kristjon Ciko and colleagues, provides a thorough performance evaluation of LGC-ShQ, a novel congestion control (CC)mechanism for data-centers. LGC-ShQ’s performance are compared (over Linux) against HULL, the closest solution in the state-of-the-art.

The second technical paper, Topology and Geometry of the Third-Party Domains Ecosystem: Measurement and Applications, by Costas Iordanou and colleagues, studies the network of the third-party domains by observing the domains’ interactions within users’ browsers from all over the globe. The authors then discuss the structural properties of the corresponding network. The results provide a new perspective on understanding the ecosystem’s organization.

We have one editorial note. In Rethinking SIGCOMM’s Conferences: Making Form Follow Function, Scott Shenker asks whether our current practice of highly selective conferences is helping us achieve SIGCOMM’s research goals. This essay contends that there is a significant mismatch between what SIGCOMM’s goals should be and what our current practices achieve, and proposes a radical restructuring of our conferences that would provide better alignment and, as an additional benefit, a stronger sense of community.

I hope that you will enjoy reading this new issue and welcome comments and suggestions on CCR Online (https://ccronline.sigcomm.org) or by email at ccr-editor at sigcomm.org.

AppClassNet: A commercial-grade dataset for application identification research

Wang Chao, Alessandro Finamore, Lixuan Yang, Kevin Fauvel, Dario Rossi

Abstract

The recent success of Artificial Intelligence (AI) is rooted into several concomitant factors, namely theoretical progress coupled to practical availability of data and computing power. Therefore, it is not surprising that the lack of high quality data is often recognized as one of the major factors limiting AI research in several domains, and the networking domain is not excluded. Large companies have access to large data assets, that would constitute interesting benchmarks for algorithmic research in the broader scientific community. However, such datasets are private assets that are generally very difficult to share due to privacy or business sensitivity concerns.

Following numerous requests we received from the scientific community, we release AppClassNet, a commercial-grade dataset for benchmarking traffic classification and management methodologies. AppClassNet is significantly larger than the datasets generally available to the academic community in terms of both the number of samples and classes, and reaches scales similar to the popular ImageNet dataset commonly used in computer vision literature.

To avoid leak of user- and business-sensitive information, we opportunely anonymized the dataset, while empirically showing that it still represents a relevant benchmark for algorithmic research. In this paper, we describe the public dataset as well as the steps we took to avoid leakage of sensitive information while retaining relevance as a benchmark. We hope that AppClassNet can be instrumental for other researchers to address more complex commercial-grade problems in the broad field of traffic classification and management.

Download from ACM

The multiple roles that IPv6 addresses can play in today’s Internet

Maxime Piraux, Tom Barbette, Nicolas Rybowski, Louis Navarre, Thomas Alfroy, Cristel Pelsser, François Michel, Olivier Bonaventure

Abstract

The Internet use IP addresses to identify and locate network interfaces of connected devices. IPv4 was introduced more than 40 years ago and specifies 32-bit addresses. As the Internet grew, available IPv4 addresses eventually became exhausted more than ten years ago. The IETF designed IPv6 with a much larger addressing space consisting of 128-bit addresses, pushing back the exhaustion problem much further in the future.

In this paper, we argue that this large addressing space allows reconsidering how IP addresses are used and enables improving, simplifying and scaling the Internet. By revisiting the IPv6 addressing paradigm, we demonstrate that it opens up several research opportunities that can be investigated today. Hosts can benefit from several IPv6 addresses to improve their privacy, defeat network scanning, improve the use of several mobile access networks and their mobility as well as to increase the performance of multicore servers. Network operators can solve the multihoming problem more efficiently and without putting a burden on the BGP RIB, implement Function Chaining with Segment Routing, differentiate routing inside and outside a domain given particular network metrics and offer more fine-grained multicast services.

Download from ACM