Keynote Speaker
We are proud to announce the following keynote speaker.
Bruce Hajek
Department of Electrical and Computer Engineering
University of Illinois, UrbanaChampaign, USA
Bruce Hajek is a Professor of Electrical and Computer Engineering and Research Professor in the Coordinated Science Laboratory at the University of Illinois at UrbanaChampaign, where he has been on the faculty since 1979. He received a BS in Mathematics and MS in Electrical Engineering from the University of Illinois and the Ph. D. in Electrical Engineering from the University of California at Berkeley. Prof. Hajek's research interests include communication networks, wireless communications, information theory, stochastic analysis, and optimization. He served as EditorinChief for the IEEE Transactions on Information Theory, and as President of the IEEE Information Theory Society. He received the Institute of Electrical and Electronics Engineers (IEEE) Kobayashi Award for Computer Communication and is a member of the US National Academy of Engineering.
Bruce Hajek's homepage.
Title: Equilibrium in Allocation Games, and What it Takes to Get There
Abstract: Game theory has recently been proposed for modeling and solving various allocation problems arising in communication networks and other distributed systems. Relevant issues are (1) the notion of equilibrium or solution used (such as Nash equilibrium or BayesNash equilbrium), (2) assumptions and/or requirements regarding information exchange, (3) computational complexity of implementation, and (4) the social benefit (efficiency) of the resulting allocation, and how the benefit is allocated among the participants. This talk will focus primarily on the information needs, and in particular, how the information requirements tend to increase with the generality of user valuation functions. (Based in part on recent work with Sichao Yang.)
Invited plenary speakers
There will be two invited plenary speakers:
JeanYves Le Boudec
Ecole Polytechnique federale de Lausanne (EPFL)
Switzerland
JeanYves Le Boudec is full professor at EPFL and fellow of the IEEE. He graduated from Ecole Normale Superieure de SaintCloud, Paris, where he obtained the Agregation in Mathematics in 1980 (rank 4) and received his doctorate in 1984 from the University of Rennes, France. From 1984 to 1987 he was with INSA/IRISA, Rennes. In 1987 he joined Bell Northern Research, Ottawa, Canada, as a member of scientific staff in the Network and Product Traffic Design Department. In 1988, he joined the IBM Zurich Research Laboratory where he was manager of the Customer Premises Network Department. In 1994 he joined EPFL as associate professor.
His interests are in the performance and architecture of communication systems. In 1984, he developed analytical models of multiprocessor, multiple bus computers. In 1990 he invented the concept called "MAC emulation" which later became the ATM forum LAN emulation project, and developed the first ATM control point based on OSPF. He also launched public domain software for the interworking of ATM and TCP/IP under Linux. He proposed in 1998 the first solution to the failure propagation that arises from common infrastructures in the Internet. He contributed to network calculus, a recent set of developments that forms a foundation to many traffic control concepts in the internet, and coauthored a book on this topic. He earned the Infocom 2005 Best Paper award with Milan Vojnovic of Microsoft Research for elucidating the perfect simulation and stationarity of mobility models.
He is or has been on the program committee or editorial board of many conferences and journals, including Sigcomm, Sigmetrics, Infocom, Performance Evaluation and ACM/IEEE Transactions on Networking.
JeanYves Le Boudec's homepage.
Title: A Generic Mean Field Convergence Result for Systems of Interacting Objects
Abstract: We consider a model for interacting objects, where the evolution of
each object is given by a finite state Markov chain, whose
transition matrix depends on the present and the past of the
distribution of states of all objects. This is a general model of
wide applicability; we mention as examples: TCP connections, HTTP
flows, robot swarms, reputation systems. We show that when the
number of objects is large, the occupancy measure of the system
converges to a deterministic dynamical system (the ``mean field")
with dimension the number of states of an individual object. We also
prove a fast simulation result, which allows to simulate the
evolution of a few particular objects imbedded in a large system. We
illustrate how this can be used to model the determination of
reputation in large populations, with various liar strategies.
Laurent Massoulié
Thomson Research Paris
France
Title: Epidemic Dissemination and Efficient Broadcasting in PeertoPeer Systems
Abstract: In this talk we will discuss several epidemic dissemination strategies for broadcasting
information in real time to members of a peertopeer system.
In the context of access bandwidth constraints, a delayoptimal scheme that achieves a streaming rate of (11/e) times
the optimal rate will be described. For access as well as network bandwidth constraints, rate optimal schemes will be
described. A byproduct of the latter optimality result is a novel, analytic proof of a theorem of Jack Edmonds (1973)
characterizing the optimal broadcast rate in an arbitrary network.
