Mathematical modelling plays a vital role in the understanding of computer and communication networks. It provides insights into the following questions : allocation of network resources, analysis and effects of competitive and/or cooperative agents, Internet protocols, wireless network protocols, network dynamics, queuing systems performance optimization, and network traffic and topology. These models shed light onto fundamental performance limits and trade-offs, and aid in algorithmic and mechanism design. In particular, the problems arising within that context involve game theoretic analyses that rely on traditional combinatorial and linear programming techniques. As the network infrastructure keeps changing and new applications are emerging, the mathematical models themselves must be adapted constantly. The workshop will explore recent developments in the field and especially the relationship between combinatorial optimization and the models used in distributed network design.

PARTICIPANTS

Elliot Anshelevich (Princeton)
Joseph Cheriyan
(Waterloo)
Anupam Gupta
(Carnegie Mellon University)
Jason Hartline (Microsoft Research)
Nicole Immorlica (Microsoft Research)
Kamal Jain (Microsoft Research)
Ramesh Johari (Stanford University)
Anna Karlin (University of Washington)
Jochen Konnemann (University of Waterloo)
Kate Larson (University of Waterloo)
Mohammad Mahdian (Microsoft Research)
Yishay Mansour (Tel Aviv University)
Peter Marbach (University of Toronto)
Sean Meyn (University of Illinois)
Vahab Mirrokni (Microsoft Research)
Seffi Noar
(Technion)
Tim Roughgarden (Stanford University)
Andreas Schulz (MIT)
Bruce Shepherd (Bell Labs, Lucent Technologies)
Nahum Shimkin (Technion)
Nicolás E. Stier Moses (Columbia Business School)
Eva Tardos (Cornell University) *
Gordon Wilfong (Bell Labs, Lucent Technologies)

(*) To be confirmed