Forecasting Routing Inputs

HotNets '26: Proceedings of the 25th ACM Workshop on Hot Topics in Networks

Abstract

BGP messages exchanged over peering sessions in the Internet are currently believed to be unpredictable. Today, network management systems (e.g., for verification, analysis, and optimisation) manage this unpredictability in one of two ways: They either consider future routing inputs in a case-by-case manner, or they consider all possible ones, including highly unlikely scenarios. Thus, the impact or risk of routing inputs on the network is either under- or overestimated. In this paper, we present a probabilistic perspective to bridge the gap between these two extremes. We explore the idea of building forecasting models of routing inputs and begin to answer the questions of how feasible it is and what it is useful for. This view paves the way for a large class of new systems trying to provide guarantees in spite of uncertainty.

Research Areas: Network Analysis and Reasoning and Verification and Synthesis

People

BibTex

coming soon