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.

CCR Editor