Abstract
In this thesis, we consider a multicasting model that uses incremental FEC (Forward Error Correction). In this model, there is one sender and $\rd^n$ receivers. The sender uses an ideal $(n, n(1-\pone), n\pone)$ FEC code to code a group of $n (1-\pone)$ data packets with additional $n \pone$ redundant packets so that any set of $n(1- \pone)$ packets received by a receiver can be used to recover the original $n(1-\pone)$ data packets. Packets to the receivers are lost independently with probability $\ptwo$. For this model, we prove several strong laws of large numbers for the asymptotic throughput as $n \to \infty$. The asymptotic throughput is characterized by the unique solution of an equation in terms of $\pone$, $\ptwo$ and $\rd$. These strong laws not only provide theoretical justification for several important observations made in the literature, but also provide insights that might have impact on future design of multicasting protocols.