Distributed Resource Allocation

Jean Walrand (EECS, UC Berkeley) - Professeur
Digital Security

Date: November 26th 2012
Location: Eurecom - Eurecom

This talk reviews algorithms for distributed resource allocation. The algorithms are derived using duality in convex programming, Lyapunov drift techniques, and entropy relaxation. Simple examples of congestion control and scheduling illustrate the methods. These techniques have been used to derive allocation schemes in wireless networks, data center networks and P2P networks. Bio: Jean Walrand received his Ph.D. in EECS from UC Berkeley and has been on the faculty of that department since 1982. He is the author of an Introduction to Queueing Networks (Prentice Hall, 1988) and of Communication Networks: A First Course (2nd ed. McGraw-Hill,1998) and co-author of High-Performance Communication Networks (2nd ed, Morgan Kaufman, 2000), of Communication Networks: A Concise Introduction (Morgan & Claypool, 2010), and of Scheduling and Congestion Control for Communication and Processing networks (Morgan & Claypool, 2010). His research interests include stochastic processes, queuing theory, communication networks, game theory and the economics of the Internet. Prof. Walrand is a Fellow of the Belgian American Education Foundation and of the IEEE and a recipient of the Lanchester Prize, the Stephen O. Rice Prize, and the IEEE Kobayashi Award. Host : Patrick LOISEAU (EURECOM)

Permalink: https://www.eurecom/seminar/31724