Probabilistic Routing Algebras for QoS Routing

Abstract

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.

Research Areas: Network Analysis and Reasoning and Verification and Synthesis

People

Jean Mégret

PhD student

Tibor Schneider

PhD student

Prof. Laurent Vanbever

Group Leader

BibTex

@inproceedings{10.1145/3744969.3748432, 
 author = {Mégret, Jean and Schneider, Tibor and Vanbever, Laurent}, 
 title = {Probabilistic Routing Algebras for QoS Routing}, 
 year = {2025}, 
 isbn = {9798400720260}, 
 publisher = {Association for Computing Machinery}, 
 address = {New York, NY, USA}, 
 url = {https://doi.org/10.1145/3744969.3748432}, 
 doi = {10.1145/3744969.3748432}, 
 booktitle = {Proceedings of the ACM SIGCOMM 2025 Posters and Demos}, 
 pages = {85–87}, 
 numpages = {3}, 
 keywords = {Probabilistic Modelling, Quality of Service, Routing Algebra}, 
 location = {Coimbra, Portugal}, 
 }