BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Network Coding for the Multiple Access Channel - Danail Traskov\, 
 TU Munich
DTSTART:20090904T090000Z
DTEND:20090904T100000Z
UID:TALK19679@talks.cam.ac.uk
CONTACT:Rachel Fogg
DESCRIPTION:Consider network coded multicast traffic over a wireless netwo
 rk in the bandwidth limited regime. We formulate the joint medium access a
 nd subgraph optimization problem by means of a graphical conflict model.  
 \nThe nature of network coded flows is not captured by classical link- bas
 ed scheduling and therefore requires a novel approach based on conflicting
  hyperarcs. By means of simulations\, we evaluate the performance of our a
 lgorithm and conclude that it significantly outperforms existing schedulin
 g techniques. Next\, we study coding across different sessions. If we rest
 rict coding to "COPE"-type\, instantaneously decodable network coding\, we
  provide an online-algorithm for jointly optimal scheduling and network co
 ding and characterize its stability region.\n\nDanail Traskov received the
  BS degree from Technical University Darmstadt in 2004 and the MS degree f
 rom the University of Illinois at Urbana-Champaign in 2006\, both in Elect
 rical Engineering. He is currently a PhD candidate at Technical University
  Munich working in the area of network coding with particular emphasis on 
 wireless networks. He has interned at Bell Labs from May-July 2006 working
  with Prof. Gerhard Kramer\, and has visited the Massachusetts Institute o
 f Technology for the summers of 2007 and 2008 working with Prof. Muriel Me
 dard.
LOCATION:LR5\, Engineering\, Department of
END:VEVENT
END:VCALENDAR