Bruno Kauffmann , université Paris 6

Location :

at INRIA,  
meeting room « verte (green)  1 », 5th floor, 23 
avenue d'Italie, 75013 PARIS

Access: https://intranet.paris-rocquencourt.inria.fr/pratique/pre-antenne-parisienne/comment-se-rendre-a-la-pre-antenne-paris-italie/

Abstract :

Queueing theory is typically concerned with the solution of direct problems, where the trajectory of 
the queueing system, and laws thereof,  are derived based on a complete specification of the 
system, its inputs and initial conditions.
In this paper we point out the importance of 
inverse problems in queueing theory, which aim to deduce unknown parameters of the system based 
on partially observed trajectories. We focus on the class of problems stemming from probing based 
methods for packet switched telecommunications networks, which have become a central tool in 
the  measurement of the structure and performance of the Internet.

We provide a general definition of the inverse problems in this class and map out the key 
variants: the analytical methods, the statistical methods and the design of experiments. We also 
contribute to the theory in each of these subdomains.

Accordingly, the particular inverse problem based on Kelly-type queues in a line is tackled in detail, 
and a number of other examples are given. We also show how such inverse problems can be 
used in practice for Internet measurement.

This is a joint work with Francois Baccelli and Darryl Veitch.

Host :

INRIA