Research interests

• P2P Networks
• Ad Hoc Networks, their protocols and analytical models. Links availability models, physical and MAC layers.
• Web graph, social networks.
• PageRank computation.

Publications and Research Reports

• "On Using Matching Theory to Understand P2P Network Design", Fabien Mathieu, Julien Reynier, Anh-Tuan Gai, Fabien de Montgolfier, Laurent Viennot, Dmitry Lebedev, accepted to INOC 2007, report version INRIA RR 6075
• "Ad Hoc Networks: Study of Protocol Behaviour", PhD thesis (defended on 24/09/2006), preprint
• "PageRank of Scale Free Growing Networks", K. Avrachenkov and D. Lebedev, accepted to Internet Mathematics Journal, report version INRIA RR-5858,2006, bibtex
• "A Framework for the Comparison of AODV and OLSR Protocols", D. Lebedev, AINTEC'05, Bangkok, Thailand, bibtex
• "Path Lengths in Ad Hoc Networks", D. Lebedev and J.-M. Steyaert, IWWAN'04, Oulu, Finland, bibtex
• "Many TCP user asymptotic analysis of the AIMD model", D. Hong and D. Lebedev, INRIA RR-4229, 2001, bibtex