BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Optimal probing for packet networks through Design of Experiments 
 for Markov Chains - Ben Parker\, Queen Mary\, University of London
DTSTART:20081106T160000Z
DTEND:20081106T170000Z
UID:TALK14801@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:Suppose we have a packet network which we wish to make measure
 ments on through active probing\; we wish to determine the optimal probing
  rate which allows us to find the most information about the system\, whil
 st simultaneously minimising the interference caused to the network by pro
 bing. \n\nWe use the statistical principles of design of experiments to re
 gard probing as a numerical experiment that can be designed optimally. We 
 demonstrate how to analyse the evolution of the network by modelling the s
 ystem as a Markov Chain\, and deduce its likelihood function\, and hence t
 he Fisher information matrix. From this\, numerical results provide a guid
 e to the best design for the experiment (probing rate) for different value
 s of input parameters. We further develop our ideas to show what happens w
 hen we take into account the effect of the probes interfering with the exp
 eriment. We present examples\, and demonstrate how this could be useful to
  determine optimal probing rates practically.\n
LOCATION:FW26\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR