---------------------------------------------------------------------------
   
	Title:  Network coding for online and dynamic networking problems

                   Tracey Ho
   Center for the Mathematics of Information
       California Institute of Technology

Abstract: Most analytical work in network coding has considered fixed rate
sources and fixed link capacities. However, in networks with bursty traffic
and varying channels, achieving optimal throughput involves routing and
network coding as well as packet and link scheduling, which may depend on
the channel states and buffer occupancies. We present an approach that
achieves asymptotic optimality for multiple multicast sessions with the
constraint of intra-session network coding, which is much less complex than
existing approaches without network coding, and is further able to optimally
allocate rates across correlated sources. We also consider the more complex
case of network coding across sessions, in an online setting.  We present
methods for sequentially phasing in sessions that take advantage of network
coding to reuse congested links.

This is joint work with Harish Viswanathan, Niranjan Ratnakar and Ralf
Koetter.

----------------------------------------------------------------------------