BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Medium Access using Queues - Shah\, D (MIT)
DTSTART:20100408T100000Z
DTEND:20100408T110000Z
UID:TALK24098@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Simple\, distributed and iterative algorithms\, popularly know
 n as message-passing\, have emerged as the architecture of choice for a va
 riety of networks. They have been surprisingly effective despite their sim
 plicity. In this talk\, I will try to argue in favor of such algorithms by
  discussing an example from wireless communication networks.\nSpecifically
 \, I will discuss the design of an efficient medium access algorithm for w
 ireless networks using queue-sizes. Here nodes wish to transmit without in
 terfering with each other while maximizing utilization of the wireless med
 ium. To minimize co-ordination cost\, solutions implemented in practice ar
 e based on `random access'.\nHowever\, they perform quite poorly as proved
  in theory and observed in practice. I will present an `adaptive' random a
 ccess algorithm that is provably efficient in both asynchronous and synchr
 onous setup.\nThis work draws insights from the classical variational prin
 ciple\, mixing times of Markov chains and reversibility.\nThe talk is base
 d on joint work with Jinwoo Shin\, MIT.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR