Report from the 6th PhD School on Traffic Monitoring and Analysis (TMA)

Idilio Drago, Fabio Ricciato, Ramin Sadre
Abstract

This is a summary report by the organizers of the 6th TMA PhD school held in Louvain-la-Neuve on 5-6 April 2016. The insight and feedback received about the event might turn useful for the organization of future editions and similar events targeting students and young researchers.

Download the full article

CliMB: Enabling Network Function Composition with Click Middleboxes

Rafael Laufer, Massimo Gallo, Diego Perino, Anandatirtha Nandugudi.
Abstract

Click has significant advantages for middlebox development, including modularity, extensibility, and reprogrammability. Despite these features, Click still has no native TCP support and only uses nonblocking I/O, preventing its applicability to middleboxes that require access to application data and blocking I/O. In this paper, we attempt to bridge this gap by introducing Click middleboxes (CliMB). CliMB provides a full-fledged modular TCP layer supporting TCP options, congestion control, both blocking and nonblocking I/O, as well as socket and zero-copy APIs to applications. As a result, any TCP network function may now be realized in Click using a modular L2-L7 design. As proof of concept, we develop a zero-copy SOCKS proxy using CliMB that shows up to 4x gains compared to an equivalent implementation using the Linux in-kernel network stack.

Download the full article

Latency Measurement as a Virtualized Network Function using Metherxis

Diego Rossi Mafioletti , Alextian Bartholomeu Liberatto , Rodolfo da Silva Villaça, Cristina Klippel Dominicini, Magnos Martinello, Moises Renato Nunes Ribeiro.
Abstract

Network latency is critical to the success of many highspeed, low-latency applications. RFC 2544 discusses and defines a set of tests that can be used to describe the performance characteristics of a network device. However, most of the available measurement tools cannot perform all the tests as described in this standard. As a novel approach, this paper proposes Metherxis, a system that can be implemented on general purpose hardware and enables Virtualized Network Functions (VNFs) to measure network device latency with micro-second grade accuracy. Results show that Metherxis achieves highly accurate latency measurements when compared to OFLOPS, a well known measurement tool.

Download the full article

Measuring the Quality of Experience of Web users

Enrico Bocchi, Luca De Cicco , Dario Rossi.
Abstract

Measuring quality of Web users experience (WebQoE) faces the following trade-off. On the one hand, current practice is to resort to metrics, such as the document completion time (onLoad), that are simple to measure though knowingly inaccurate. On the other hand, there are metrics, like Google’s SpeedIndex, that are better correlated with the actual user experience, but are quite complex to evaluate and, as such, relegated to lab experiments. In this paper, we first provide a comprehensive state of the art on the metrics and tools available for WebQoE assessment. We then apply these metrics to a representative dataset (the Alexa top-100 webpages) to better illustrate their similarities, differences, advantages, and limitations. We next introduce novel metrics, inspired by Google’s SpeedIndex, that offer significant advantage in terms of computational complexity, while maintaining a high correlation with the SpeedIndex. These properties make our proposed metrics highly relevant and of practical use.

Download the full article

“Resource Pooling” for Wireless Networks: Solutions for the Developing World

Junaid Qadir, Arjuna Sathiaseelan, Liang Wang.
Abstract

We live in a world in which there is a great disparity between the lives of the rich and the poor. Technology offers great promise in bridging this gap. In particular, wireless technology unfetters developing communities from the constraints of infrastructure providing a great opportunity to leapfrog years of neglect and technological waywardness. In this paper, we highlight the role of resource pooling for wireless networks in the developing world. Resource pooling involves (i) abstracting a collection of networked resources to behave like a single unified resource pool and (ii) developing mechanisms for shifting load between the various parts of the unified resource pool. The popularity of resource pooling stems from its ability to provide resilience, high utilization, and flexibility at an acceptable cost. We show that “resource pooling”, which is very popular in its various manifestations, is the key unifying principle underlying a diverse number of successful wireless technologies (such as white space networking, community networks, etc.). We discuss various applications of resource pooled wireless technologies and provide a discussion on open issues.

Download the full article

The 8th Workshop on Active Internet Measurements (AIMS-8) Report

Abstract

On 10-12 February 2016, CAIDA hosted the eighth Workshop on Active Internet Measurements (AIMS-8) as part of our series of Internet Statistics and Metrics Analysis (ISMA) workshops. This workshop series provides a forum for stakeholders in Internet active measurement projects to communicate their interests and concerns, and explore cooperative approaches to maximizing the collective benefit of deployed infrastructure and gathered measurements. Discussion topics included: infrastructure development status and plans; experimental design, execution, and cross-validation; challenges to incentivize hosting, sharing, and using measurement infrastructure; data access, sharing, and analytics; and challenges of emerging high bandwidth network measurement infrastructure. Other recurrent topics included paths toward increased interoperability and cooperative use of infrastructures, and ethical frameworks to support active Internet measurement. Materials related to the workshop are at
http://www.caida.org/workshops/aims/1602/.

Download the full article

Recursive SDN for Carrier Networks

James McCauley, Zhi Liu, Aurojit Panda, Teemu Koponen, Barath Raghavan, Jennifer Rexford, Scott Shenker.
Abstract

Control planes for global carrier networks should be programmable and scalable. Neither traditional control planes nor new SDN-based control planes meet both of these goals. Here we propose a framework for recursive routing computations that combines the best of SDN (programmability through centralized controllers) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design’s ability to support a variety of unicast routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism based on network virtualization.

Public review by Joseph Camp

While software-defined networks have received significant attention in recent years, the networks studied often lack multiple orders of magnitude from today’s global carrier networks in terms of geographical span and nodal scale. Hence, this paper sets forth a recursive routing computation framework that balances the programmability of SDNs with the scalability of a traditional hierarchical structure. Simulations of about 10,000 nodes are used to show the viability of such an approach. Remarkably, the authors show that their recovery approach can offer “five 9s” of network repair even under a heavy link failure scenario.

Download the full article

April 2016 : Table of contents

Technical papers

Editorials

July 2016 : Table of contents

Technical papers

Editorials

The July 2016 Issue

This issue of Computer Communication Review is again a bit special. The previous issue was the last issue published on paper. The issue that you read is the first to be printed only on electrons. We hope that moving to an entirely online publication model will allow CCR to better serve the needs of the community. CCR is now available through a dedicated website : https://ccronline.sigcomm.org . We will add new features on the website to encourage interactions among the entire community. Ideas and suggestions on how to improve the website are more than welcome.
This issue contains a wide range of articles. Four peer-reviewed articles have been accepted. In “Controlling Queueing Delays for Real-Time Communication : The Interplay of E2E and AQM Algorithms”, Gaetano Carlucci et al. analyse the performance of the Google Congestion Control algorithm for real time communication with Active Queue Management (AQM) and scheduling techniques. In “What do Parrots and BGP Routers have in common”, David Hauwele et al. use controlled experiments and measurements to determine why BGP routers send duplicate messages. In “TussleOS: Managing Privacy versus Functionality Trade-offs on IOT Devices”, Rayman Preet Singh et al. propose a different model to improve OS-level support for privacy in Internet of Things. In “InKeV: In-Kernel Distributed Network Virtualisation for DCN”, Zaafar Ahmed et al. propose to leverage the extended Berkeley Packet Filter (eBFP), a way to safely introduce new functionality into the Linux kernel.
In addition to the peer-reviewed technical papers, this issue contains a record number of editorial papers. In “Opening Up Attendance at Hotnets”, the HotNets Steering Committee reports the results of the more open attendance policy used for Hotnets 2015. In “EZ-PC: Program Committee Selection Made Easy”, Vyas Sekar argues that selecting a technical program committee (PC) for a conference or workshop is a complex process that can be improved by using software tools. He proposes EZ-PC, an open-source software that formulates this process as a simple constraint satisfaction problem and reports on his experience with the software. In “New Kid on the Block: Network Functions Virtualization: From Big Boxes to Carrier Clouds”, Leonhard Nobach et al. provide an overview on the current state-of-the-art and open research questions in Network Function Virtualisation (NFV). Then five editorials summarise the main findings of five recently held workshops : the Roundtable on Real-Time Communications Research: 5G and Real-Time Communications — Topics for Research, the 2015 Workshop on Internet Economics (WIE), the Internet Research Task Force and Internet Society workshop on Research and Applications of Internet Measurements (RAIM), the Research and Infrastructure Challenges for Applications and Services in the Year 2021 and the 2016 BGP Hackathon. The 2016 BGP Hackathon was a joint effort between researchers who study the Border Gateway Protocol (BGP) and network operators who manage routers that rely on this protocol. During a few days in February 2016, members from these two communities met to develop new software tools together. The results of this hackathon are a clear example that it is possible to achieve excellent results by joining forces and working together on a common objective. The organisers of the hackathon applied for community funding from ACM SIGCOMM and used this funding to offer travel grants and increase the participation of researchers to the hackathon. I hope that the SIGCOMM Executive Committee will receive other requests for funding for similar hackathons in the coming months and years.
Finally, we also have our regular columns. In his student mentoring column, Aditya Akella discusses the different between journal and conference papers, different types of jobs and conference talks. In the industrial column, Nandita Dukkipati and her colleagues discuss the deployment of new congestion control schemes in datacenters and on the Internet based on their experience at a large cloud provider.
Olivier Bonaventure
CCR Editor