Winedale Workshop 2009

Winedale is a one-day event co-organized by Rice, Texas A&M and UT Austin. Winedale's mission is to facilitate interaction between the signals & systems communities at the three Universities, and to encourage joint research.

Winedale is itself a historic nineteenth-century facility sutuitated on 225 acres and owned by the UT Center for American History.

As the name suggests, these algorithms are built upon a gossip or rumor style unreliable, asynchronous information exchange protocols. Due to their immense simplicity and wide applicability, this class of algorithms has emerged as a canonical solution across disciplines : control, communication networks, distributed systems, economics, social science, etc. This has led to an exciting progress over years, and more so recently, to understand the applicability and limitations of such natural algorithms. In this tutorial, we will provide a survey of results on Gossip algorithms with a focus on networking applications.

Devavrat Shah is currently a Jamieson career development associate professor with the department of electrical engineering and computer science, MIT. He is a member of the Laboratory of Information and Decision Systems (LIDS). His research focus is on the theory of large, complex networks which includes network algorithms, stochastic networks, network information theory and algorithms for statistical inference.

Recently, there has been much progress in understanding the connection between optimization and control of queueing networks. In this talk, we will provide an overview of the basic theory and specialize it to two applications in wireless networks. One application is to a network whose traffic consists of a mixture of persistent and transient flows. We will use the connection between Lagrange multipliers and queues to derive a scheduling algorithm which achieves the maximum throughput in this network. The other application is to a network with a mixture of elastic and inelastic flows where the inelastic flow's packets have strict deadlines. Again, exploiting the connection between queueing networks and optimization, we will derive a scheduling algorithm that fairly allocates the network resources among the elastic flows while ensuring that the deadline constraints are met for the inelastic flows.

R. Srikant is currently a Fredric G. and Elizabeth H. Nearing Endowed Professor at the Department of Electrical and Computer Engineering , UIUC. He is a member of the Coordinated Science Laboratory (CSL). His research focus is on distributed algorithms for wireless networks and the Internet, stochastic processes, optimization, game theory, stochastic control and information theory.

Notes

Presentation Slides

2 weeks, 3 days ago

View the Presentation Slides here.  

Wireless Network
Wireline Network
Gossip Algorithms

Winedale Workshop Feedback

on 24/10/09 Please take this brief survey for this year's workshop.

Welcome!

on 27/8/09 Welcome to Winedale website - please register by Oct. 5