Wednesday 26
Distributed algorithms, multi-agent and parallel computing
Thibault Bernard
› 16:00 - 16:30 (30min)
› Bât B - TD 31
On the Use of Lagrangian Optimization For Designing Distributed Self-Stabilizing Protocols
Arnaud Legrand  1@  
1 : Laboratoire d'Informatique de Grenoble  (LIG)  -  Website
CNRS : UMR5217, Université Pierre-Mendès-France - Grenoble II, Institut polytechnique de Grenoble (Grenoble INP), Université Joseph Fourier - Grenoble I
UMR 5217 - Laboratoire LIG - 38041 Grenoble cedex 9 - France Tél. : +33 (0)4 76 51 43 61 - Fax : +33 (0)4 76 51 49 85 -  France

Large scale distributed systems typically comprise hundreds to
millions of entities that have only a partial view of resources. How
to fairly and efficiently share such resources between entities in a
distributed way has thus become a critical question. A possible answer
resorts to Lagrangian optimization and distributed gradient
descent. Under certain conditions, the resource sharing problem can be
formulated as a global optimization problem, which can be solved by a
distributed self-stabilizing demand and response algorithm. In the
last decade, this technique has been applied to design network
protocols (variants of TCP, multi-path network protocols, wireless
network protocols) and even distributed algorithms for smart grids. In this talk,I will present the basics of this technique as well as the key underlying assumptions and its limitations.

Online user: 1