In this work we analyze performance of network coding focusing on two specific network coding schemes: XOR and random linear network coding. We have simulated different topologies and traffic patterns in order to provide better understanding of network coding behavior and its possible bottlenecks. As a part of our performance evaluation we consider also computational complexity of coding and de...

ABSTRACT Single-rate multicasting may yield low utilization of the network resources when a subset of the receivers creates a bottleneck for the whole multicast group. Thus, practical multirate multicasting strategies are required to allow users with better channels to achieve maximum performance. While earlier studies have investigated such mechanisms using routing strategies over fixed trees,...

MATHEMATISCH-NATURWISSENSCHAFTLICHEN FAKULTÄTEN Doctor of Philosophy

We study the stopping times of gossip algorithms fornetwork coding. We analyze algebraic gossip (i.e., random linearcoding) and consider three gossip algorithms for informationspreading: Pull, Push, and Exchange. The stopping time ofalgebraic gossip is known to be linear for the complete graph, butthe question of determining a tight upper bound or lower boundsfor general...

xiii Chapter

In 2010, Silva, Kschischang and Kötter studied certain classes of finite field matrix channels in order to model random linear network coding where exactly t random errors are introduced. In this paper we introduce a generalisation of these matrix channels where the number of errors is not required to be constant. We show that a capacity-achieving input distribution can always be taken to have ...

| Networks derived from matroids have played a fundamental role in proving theoretical results about the limits of network coding. In this tutorial paper, we review many connections between matroids and network coding theory, with specific emphasis on network solvability, admissible network alphabet sizes, linear coding, and network capacity.