Author Archives: Olivier Bonaventure

DICE: Dynamic Multi-RAT Selection in the ICN-enabled Wireless Edge

Gaurav Panwar, Reza Tournai, Travis Mick, Abderrahmen Mtibaa, Satyajayant Misra

Coupled with the rapid increase in mobile device users and the bandwidth and latency demands are the continuous increase of devices’ processing capabilities, storage, and wireless connectivity options. The multiple radio access technology (multi-RAT) is proposed to satisfy mobile users’ increasing needs. The Information-Centric Networking (ICN) paradigm is better tuned (than the current Internet Protocol approach) to support multi-RAT communications. ICN eschews the connection-based content retrieval model used today and has desirable features such as data naming, in-network caching, and device mobility–a paradigm ripe for exploration.

We propose DICE, an ICN forwarding strategy that helps a device dynamically select a subset of its multi-RAT interfaces for communication. DICE assesses the state of edge links and network congestion to determine the minimum number of interfaces required to perform data delivery. We perform simulations to compare DICE’s performance with bestroute2 and multicast strategies (part of the named data networking simulator, ndnSIM). We show that DICE is the best of both worlds: providing a higher delivery ratio (0.2–2 times) and much lower overhead (by 2–8 times) for different packet rates.

Download the full article DOI: 10.1145/3155055.3155066


Report on Networking and Programming Languages 2017

Nikolaj Bjorne, Marco Canini, Nik Sultana

The third workshop on Networking and Programming Languages, NetPL 2017, was held in conjunction with SIGCOMM 2017. The workshop series attracts invited speakers from academia and industry and a selection of contributed abstracts for short presentations. NetPL brings together researchers from the networking community and researchers from the programming languages and verification communities. The workshop series is a timely forum for exciting trends, technological and scientific advances in the intersection of these communities.

We describe some of the highlights from the invited talks through the lens of three trends: Advances in network machine architectures, network programming abstractions, and network verification.

NetPL included five invited speakers, four from academia, and one from industry. The program contained six contributed papers out of eight submitted for presentation. The workshop organizers reviewed the abstracts for quality and scope. A total of 42 registrations were received and the attendance occupied the lecture room to the brink.

Slides and abstracts from all talks are available from the workshop home page: Videos of the presentations are available in the NetPL YouTube channel:

Download the full article DOI: 10.1145/3155055.3155061

The July 2017 Issue

Computer Communication Review (CCR) continues to evolve. As announced earlier, we now accept technical articles that are longer than six pages provided that the authors release software or datasets to help readers to repeat or reproduce the main results described in the paper. These articles are reviewed on the basis of their technical merits and the supplied artifacts are also peer-reviewed. The summary of those two reviews are attached to each accepted paper. All the technical papers that appear in this issue provide artifacts.

The CCR Online website, https:// has been enhanced with a comments section to encourage inter- actions between readers and authors. We have also launched the Community Com- ments section on CCR Online. This section contains preprints of submitted papers while they are being reviewed. Readers are en- couraged to provide constructive comments to these papers. Authors have to opt-in to have their papers listed in this section.

In 2003, David Clark and his colleagues proposed a vision of a knowledge plane for the Internet. In our first technical paper, Albert Mestres and his colleagues revisit this vision and propose Knowledge-Defined Networking. This paper argues that Software-Defined Networking (SDN) and Network Analytics (NA) are two subdomains where in- teractions between Artificial Intelligence and networking would bring many benefits. The provide both use cases and simple experi- mental results. The available software and datasets could serve as a starting point for researchers willing to explore this emerging field.

Our second technical paper tackles a different topic. Ivan Voitalov and his colleagues propose a new routing scheme in Geohyperbolic Routing and Addressing Schemes. A key concern when designing a routing scheme is the scalability of the solution and the size of the forwarding tables. The solution proposed in this paper couples network topology design with a specific addressing scheme so that forwarding tables and update messages are minimised. The proposed solution is evaluated by simulations and the authors release their software and datasets.

In our third technical paper, On the Evolution of ndnSIM: an Open-Source Simulator for NDN Experimentation, Spyridon Mastorakis et al. describe the ndnSIM network simulator. The first version of this simulator was released in 2012 and it has continuously evolved since. The paper describes the evolution of the simulator, some results and the lessons learned by the authors that would probably apply to other open source projects.

Two editorials also appear in this issue. The first one, co-authored by kc Claffy and David Clark summarises the 7th interdisciplinary Workshop on Internet Economics (WIE) that was held in December 2016. In our second editorial, Using Networks to Teach About Networks (Report on Dagstuhl Seminar #17112), Jurgen Schonwalder and his colleagues summarise a recent Dagsthul seminar that was entirely devoted to network education.

I hope that you will enjoy reading this new issue and welcome comments and suggestions on CCR Online or by email at ccr-editor at

Using Networks to Teach About Networks (Report on Dagstuhl Seminar #17112)

Jürgen Schönwälder , Timur Friedman, Aiko Pras.

This report summarizes a two and a half days Dagstuhl seminar on “Using Networks to Teach About Networks”. The seminar brought together people with mixed backgrounds in order to exchange experiences gained with different approaches to teach computer networking. Despite the obvious question of what to teach, special attention was given to the questions of how to teach and which tools and infrastructures can be used effectively today for teaching purposes.

Download the full article

Workshop on Internet Economics (WIE2016) Final Report

kc claffy, David Clark.

On December 8-9 2016, CAIDA hosted the 7th interdisciplinary Workshop on Internet Economics (WIE) at the UC San Diego’s Supercomputer Center. This workshop series provides a forum for researchers, Internet facilities and service providers, technologists, economists, theorists, policy makers, and other stakeholders to inform current and emerging regulatory and policy debates. This year we first returned to the list of aspirations we surveyed at the 2014 workshop, and described the challenges of mapping them to actions and measurable
progress. We then reviewed evolutionary shifts in traffic, topology, business, and regulatory models, and (our best understanding of) the economics of the ecosystem. These discussions inspired an extended thought experiment for the second day of the workshop: outlining a new telecommunications legislative framework, including proposing a set of
goals and scope of such regulation, and minimal list of sections required to pursue and measure progress toward those goals. The format was a series of focused sessions, where presenters prepared 10-minute talks on relevant issues, followed by in-depth discussions. This report highlights the discussions and presents relevant open research questions identified by participants. Slides presented and this report are available at

Download the full article

On the Evolution of ndnSIM: an Open-Source Simulator for NDN Experimentation

Spyridon Mastorakis, Alexander Afanasyev, Lixia Zhang.

As a proposed Internet architecture, Named Data Networking (NDN) takes a fundamental departure from today’s TCP/IP architecture, thus requiring extensive experimentation and evaluation. To facilitate such experimentation, we have developed ndnSIM, an open-source NDN simulator based on the NS-3 simulation framework. Since its first release in 2012, ndnSIM has gone through five years of active development and integration with the NDN prototype implementations, and has become a popular platform used by hundreds of researchers around the world. This paper presents an overview of the ndnSIM design, the ndnSIM development process, the design tradeoffs, and the reasons behind the design decisions. We also share with the community a number of lessons we have learned in the process.

Download the full article

Geohyperbolic Routing and Addressing Schemes

Ivan Voitalov, Rodrigo Aldecoa, Lan Wang, Dmitri Krioukov.

The key requirement to routing in any telecommunication network, and especially in Internet-of-Things (IoT) networks, is scalability. Routing must route packets between any source and destination in the network without incurring unmanageable routing overhead that grows quickly with increasing network size and dynamics. Here we present an addressing scheme and a coupled network topology design scheme that guarantee essentially optimal routing scalability. The FIB sizes are as small as they can be, equal to the number of adjacencies a node has, while the routing control overhead is minimized as nearly zero routing control messages are exchanged even upon catastrophic failures in the network. The key new ingredient is the addressing scheme, which is purely local, based only on geographic coordinates of nodes and a centrality measure, and does not require any sophisticated non-local computations or global network topology knowledge for network embedding. The price paid for these benefits is that network topology cannot be arbitrary but should follow a specific design, resulting in Internet-like topologies. The proposed schemes can be most easily deployed in overlay networks, and also in other network deployments, where geolocation information is available, and where network topology can grow following the design specifications.

Download the full article

Knowledge-Defined Networking

Albert Mestres, Alberto Rodriguez-Natal, Josep Carner, Pere Barlet-Ros, Eduard Alarcón, Marc Solé, Victor Muntés-Mulero, David Meyer, Sharon Barkai, Mike J. Hibbett, Giovani Estrada, Khaldun Ma, Florin Coras, Vina Ermagan, Hugo Latapie, Chris Cassar, John Evans, Fabio Maino, Jean Walrand.

The research community has considered in the past the application of Artificial Intelligence (AI) techniques to control and operate networks. A notable example is the Knowledge Plane proposed by D.Clark et al. However, such techniques have not been extensively prototyped or deployed in the field yet. In this paper, we explore the reasons for the lack of adoption and posit that the rise of two recent paradigms: Software-Defined Networking (SDN) and Network Analytics (NA), will facilitate the adoption of AI techniques in the context of network operation and control. We describe a new paradigm that accommodates and exploits SDN, NA and AI, and provide use-cases that illustrate its applicability and benefits. We also present simple experimental results that support, for some relevant use-cases, its feasibility. We refer to this new paradigm as Knowledge-Defined Networking (KDN).

Download the full article

Community feedback

Like most scientific journals, Computer Communication Review (CCR) publishes peer-reviewed papers. Reviewing papers takes time and the papers that appear in CCR have typically been submitted four months before their online publication. Once a paper is submitted, it is reviewed by a few experts in the field who assess the technical merits of the paper. If the paper supplies artefacts (software, datasets, …) additional reviewers also evaluate those artefacts. Those reviews and the associated discussions take time and often allow the authors to significantly improve the quality of their papers.

In parallel with their submission to CCR, some authors also distribute their paper to colleagues or post it on online repositories. To provide more feedback to such authors, we start a new experiment in CCR. Authors who submit papers that contain artefacts (software, datasets, …) can now opt for community feedback. In this case, the paper is quickly checked by the editor and if suitable it is posted on during the review process together with links to the additional material. We start this experiment with the following paper that is currently under review :

We hope that this new service will be useful for the community and encourage you to provide feedback to the authors through website comments. Feel free to also contact the editor by email if you have any suggestion or comment on this new service.

The April 2017 Issue

This new issue of Computer Communication Review (CCR) contains again a mix of technical papers and editorials. In the first paper, Principles for Measurability in Protocol Design, Mark Allman and his colleagues argue about the importance of considering the requirements from measurements in the design of protocols. Protocols are designed to solve operational problems and the operators that deploy or support those protocols often use measurements to monitor or tune their utilisation. This paper proposes six principles that should be used by protocol designers when developing a new protocol or architecture. The vision differs from earlier work that has often relied on specialised out-of-band measurement protocols. Based on a few primitives, the authors propose a high-level design for an In-Protocol Internet Measurement Facility. The solution is discussed with several examples and use cases. The next step will be to completely specify, implement and deploy such a protocol.

Our second technical paper, A Techno-Economic Approach for Broadband Deployment in Underserved Areas, was selected as the best paper of the SIGCOM’16 GAIA workshop, but could not be included in the previous issue of CCR. In this paper, Ramakrishnan Durairajan and Paul Barford describe a framework that allows government or companies to identify the best locations to deploy network infrastructure based on factors that include cost and user demographics.

Our first editorial, Learning Networking by Reproducing Research Results, co-authored by Lisa Yan and Nick McKeown, describes how students at Stanford University have reproduced experimental research results from over 40 different networking papers during the last five years. Since 2012, students who follow this advanced graduate networking course select one scientific paper and try to reproduce one of the results of the paper in pairs. This project lasts three weeks. It appears to work really well and provides several benefits. Firstly, the students to gain a more in-depth knowledge on the chosen paper than by simply presenting the paper. Secondly, the students can interact with the researchers who wrote the paper if they have specific questions about one particular experiment. Thirdly, the students learn the importance of performing reproducible experiments before starting their own research. This looks like an excellent way to educate the next generation of networking researchers and I would strongly encourage you to consider this model if you teach an advanced graduate networking class or seminar.

In our second editorial, Summary of the Works-in-Progress Session at IMC16, Dave Choffnes reports on the work in progress session that was organised during IMC’16. This session was intended as a forum for the exchange of ideas within the IMC community. Dave first describes how the session was organised and then briefly summarises the tools and research that participants shared during this session.

Finally, in our third editorial, 2016 International Teletraffic Congress (ITC 28) Report, Tobias Hossfeld provides a detailed summary of the International Teletraffic Congress that was held in September 2016 in Wurzburg, Germany.

Olivier Bonaventure

CCR Editor