TITLE:
Information Flow over Wireless Networks: A Deterministic Approach
SPEAKER: Andrea Montanari (Stanford University)
DATE: 2:00 - 3:00 PM, Monday, September 29, 2008
LOCATION: Sigma, 1L
ABSTRACT:
Measuring flow sizes in internet core routers is a notoriously
difficult problem in networking. On one hand, high data rates
require the use of fast memories (SRAM), that cannot accommodate
a standard counter structure. On the other, it is difficult
to maintain the flow-to-counter association at high speed.
I will describe a new solution of this problem, inspired from
"coding theory" and "random projections" ideas. The resulting
architecture (Counter Braids) outperforms existing approaches.
The basic philosophy is: compress as you count. I will also
discuss a fundamental (information theoretic) characterization of
this problem.
BIOGRAPHY:
Andrea Montanari received a Laurea degree in Physics in 1997, and a
Ph. D. in Theoretical Physics in 2001 (both from Scuola Normale
Superiore in Pisa, Italy). He has been post-doctoral fellow at
Laboratoire de Physique Théorique de l'Ecole Normale Supérieure
(LPTENS), Paris, France, and the Mathematical Sciences Research
Institute, Berkeley, USA. Since 2002 he is Chargée de Recherche (a
permanent research position with Centre National de la Recherche
Scientifique, CNRS) at LPTENS.
In September 2006 he joined Stanford University as Assistant Professor
in the Departments of Electrical Engineering and Statistics.
He was co-awarded the ACM SIGMETRICS best paper award in 2008. He
received the CNRS bronze medal for theoretical physics in 2006 and the
National Science Foundation CAREER award in 2008.
|
|
|