Jean Bernard David Mégret


Last Name

Mégret

First Name

Jean Bernard David

ORCID

0000-0002-2608-1684

Organisational unit

09477 - Vanbever, Laurent / Vanbever, Laurent

Filters

20253
Reset filters

Search Results

Publications1 - 3 of 3
  • Probabilistic Routing Algebras for QoS Routing
    Item type: Other Conference Item
    Mégret, Jean Bernard David; Schneider, Tibor; Vanbever, Laurent (2025)
    Proceedings of the ACM SIGCOMM 2025 Posters and Demos
    Algebraic structures have been practical tools in the field of protocol analysis and design by providing formal answers to routing problems. However, by means of abstractions, some information from the underlying network is lost, thus providing only a coarse approximation of the real situation. We propose an algebra modelling attributes of the network probabilistically to better characterise dependencies and randomness of real networks. This opens up new perspectives for quality of service routing and traffic engineering.
  • POSTER: Probabilistic Routing Algebras for QoS Routing
    Item type: Conference Poster
    Mégret, Jean Bernard David; Schneider, Tibor; Vanbever, Laurent (2025)
  • Guided Exploration of Control Plane Routing States
    Item type: Conference Paper
    Schneider, Tibor; Mégret, Jean Bernard David; Vanbever, Laurent (2025)
    In recent years, significant progress has been madetowards scalable network control-plane verification. Yet, opera-tors are still hesitant to deploy such systems. We argue that thisreluctance is in part due to a semantic gap between operatorsreasoning about routing states and verifiers exploring the spaceof environments. Indeed, operators express the specification interms of behavior of routing states, while verifiers usually rely onsolvers to find specific environments that violate the specification.This semantic gap prevents users from guiding these solvers todirectly explore routing states that violate the specification, or tosearch for states that are most relevant or likely. In this paper, we present a new approach for flexible control-plane verification. Instead of relying on rigid off-the-shelf solvers,we design a novel backtracking algorithm to directly explore thespace of routing states. This enables users to guide the explorationaccording to the specification and domain-specific knowledgefrom operators. This algorithm paves the way for novel use cases,ranging from finding relevant (e.g., likely) counterexamples toperforming verification of probabilistic specifications.
Publications1 - 3 of 3