Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student submitted PDF version of thesis.Includes bibliographical references (p. 143-149).Network coding has emerged as a new approach to operating communication networks, with a promise of improved efficiency in the form of higher throughput, especially in lossy conditions. In order to realize this promise in practice, the interfacing of network coding with existing network protocols must be understood well. Most current protocols make use of feedback in the form of acknowledgments (ACKs) for reliability, rate control and/or delay control. In this work, we propose a way to incorporate network coding within such a feedback-based framework, and study the various benefits of using feedback in a network coded system. More specifically, we propose a mechanism that provides a clean interface between network coding and TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the TCP congestion window. At the heart of our scheme is a new interpretation of ACKs - the receiver acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Such ACKs enable a TCP-compatible sliding-window implementation of network coding. Thus, with feedback, network coding can be performed in a completely online manner, without the need for batches or generations. Our scheme has the nice feature that packet losses on the link can be essentially masked from the congestion control algorithm by adding enough redundancy in the encoding process.(cont.) This results in a novel and effective approach for congestion control over networks involving lossy links such as wireless links. Our scheme also allows intermediate nodes to perform re-encoding of the data packets. This in turn leads to a natural way of running TCP flows over networks that use multipath opportunistic routing along with network coding. We use the new type of ACKs to develop queue management algorithms for coded networks, which allow the queue size at nodes to track the true backlog in information with respect to the destination. We also propose feedback-based adaptive coding techniques that are aimed at reducing the decoding delay at the receivers. Different notions of decoding delay are considered, including an order-sensitive notion which assumes that packets are useful only when delivered in order. We study the asymptotic behavior of the expected queue size and delay, in the limit of heavy traffic.by Jay Kumar Sundararajan.Ph.D
