Probabilistic Routing Algebras for QoS Routing

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.