Olivier Bonaventure’s research while affiliated with Université Catholique de Louvain - UCLouvain and other places

BGP distributes prefixes advertised by Autonomous Systems (ASes) and computes the best paths between them. It is the only routing protocol used to exchange interdomain routes on the Internet. Since its original definition in the late 1980s, BGP uses TCP. To prevent attacks, BGP has been extended with features such as TCP-MD5, TCP-AO, GTSM and data-plane filters. However, these ad hoc solutions were introduced gradually as the Internet grew. In parallel, TLS was standardized to secure end-to-end data-plane communications. Today, a large proportion of the Internet traffic is secured using TLS. Surprisingly, BGP still does not use TLS despite its adequate security features to establish BGP sessions. In this paper, we make the case for using a secure transport with BGP. This can be achieved with TLS combined with TCP-AO or by replacing TCP by QUIC. This protects the BGP stream using established secure transport protocols. In addition, we show that a secure transport using X.509 certificates enables BGP routers to be securely and automatically configured from these certificates. We extend the open-source BIRD BGP daemon to support TLS with TCP-AO and QUIC, to handle such certificates and demonstrate several use cases that benefit from the secure and automated capabilities enabled by our proposal.

The Proceedings of the ACM on Networking (PACMNET) series present the highest-quality research conducted in the areas of emerging computer networks and their applications. We encourage submissions that present new technologies, novel experimentation, creative use of networking technologies, and new insights made possible using analysis. The journal is strongly supported by the ACM Special Interest Group on Communications and Computer Networks (SIGCOMM) and involves top-level researchers in its Editorial Board. This issue contains four papers submitted for the June '23 deadline that were revised by their authors based on the extensive feedback provided by the reviewers. We would like to thank the many individuals who contributed to this issue of PACMNET, in particular the authors, who submitted their best work to PACMNET, and the Associate Editors, who provided constructive feedback to the authors in their reviews, participated in the online discussions and the Editors' meeting. We would like also to thank the SIGCOMM Executive Committee Chair and the CoNEXT Steering Committee members who supported and guided us as usual.

A growing number of Internet applications require low latency. Unfortunately, most of these applications cannot use the rich features of the QUIC protocol since it only uses retransmissions to cope with packet losses. We propose, implement and evaluate, a revisit of the QUIC loss recovery mechanism. relies on Forward Erasure Correction (FEC) only if it is needed by the application’s latency requirements and uses classical retransmissions otherwise. We implement and evaluate its performance for real-time video and HTTP/3. Compared to previous works adding FEC to QUIC, is the first to be evaluated with and obtain significant performance improvements for popular applications over real lossy networks. Our evaluation shows that for video improves the video quality while meeting strict delay requirements. For HTTP/3 transfers, efficiently reduces the tail latency when packet losses occur without causing harm when there are no losses. We confirm these results using emulation over a wide ranges of bandwidth, delays and loss scenarios. We release our implementation to encourage other researchers and industry to explore in more details the use of FEC in QUIC.

The Proceedings of the ACM on Networking (PACMNET) series present the highest-quality research conducted in the areas of emerging computer networks and their applications. We encourage submissions that present new technologies, novel experimentation, creative use of networking technologies, and new insights made possible using analysis. The journal is strongly supported by the ACM Special Interest Group on Communications and Computer Networks (SIGCOMM) and involves top-level researchers in its Editorial Board. This issue contains papers submitted for the June '23 deadline. 129 long papers and 19 short papers were submitted to this deadline. 24 of the long papers and 5 of the short papers have been accepted after a rigorous review process organized with 50 Associate Editors and a few external reviewers. After review, each paper was conditionally accepted (with shepherding), allowed a "oneshot- major" revision, or rejected. The review process was split into two rounds. All submissions received at least 3 reviews in the first round. The papers that advanced to the second round received at least two additional reviews. After an online discussion phase among the reviewers, papers were extensively discussed during an online Associate Editors' meeting where the final decisions were made. In case of major revision, the authors have been invited to address the reviewers' comments and prepare a thoroughly revised version of their contribution. Revised papers have been then thoroughly reviewed again before being either accepted or rejected. This issue collects papers that have been finally accepted for publication after going through the minor revision process. The long papers published in this issue and in the two previous ones will be presented at the CoNEXT 2023 conference on December 5-8, in Paris, France together with the short papers that appear in the conference proceedings.

The Proceedings of the ACM series present the highest-quality research conducted in diverse areas of computer science, as represented by the ACM Special Interest Groups (SIGs). PACMNET focuses on contributions presenting significant and novel research results on emerging computer networks and their applications. PACMNET collects top-quality scholarly articles in the area of computer networking.We encourage submissions that present new technologies, novel experimentation, creative use of networking technologies, and new insights made possible using analysis. The journal is strongly supported by the ACM Special Interest Group on Communications and Computer Networks (SIGCOMM) and involves top-level researchers in its Editorial Board.

Latency is becoming a key factor of performance for Internet applications and has triggered a number of changes in its protocols. Our work revisits the impact on latency of address family selection in dual-stack hosts. Through RIPE Atlas measurements, we analyse the address families latency difference and establish two requirements based on our findings for a latency-focused selection mechanism. First, the address family should be chosen per destination. Second, the choice should be able to evolve over time dynamically. We propose and implement a solution formulated as an online learning problem balancing exploration and exploitation. We validate our solution in simulations based on RIPE Atlas measurements, implement and evaluate our prototype in four access networks using Chrome and popular web services. We demonstrate the ability of our solution to converge towards the lowest-latency address family and improve the latency of transport connections used by applications.

We are very excited to introduce the first issue of the ACM Proceedings of the ACM on Networking (PACMNET) journal. The Proceedings of the ACM series presents the highest-quality research conducted in diverse areas of computer science, as represented by the ACM Special Interest Groups (SIGs). PACMNET focuses on contributions presenting significant and novel research results on emerging computer networks and their applications. PACMNET was created to collect top-quality scholarly articles in the area of computer networking. PACMNET encourages submissions that present new technologies, novel experimentation, creative use of networking technologies, and new insights made possible using analysis. The journal is strongly supported by the ACM Special Interest Group on Communications and Computer Networks (SIGCOMM) and involves top-level researchers in its Editorial Board.bWe started working on PACMNET in 2019, with the idea of having a new journal that guarantees both a fast publication time and a very rigorous and constructive review process. The creation of PACMNET was done with the enthusiastic support of the ACM SIGCOMM community, and it will be especially attractive for networking researchers from regions where conference publications are no valued.

By combining the security features of TLS with the reliability of TCP, QUIC opens new possibilities for many applications. We demonstrate the benefits that QUIC brings for routing protocols. Current Internet routing protocols use insecure transport protocols. BGP uses TCP possibly with authentication. OSPF uses its own transport protocol above plain IP. We design and implement a library that allows to replace the transport protocols used by BGP and OSPF with QUIC. We apply this library to the BIRD routing daemon and report preliminary results.