Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis

TL;DR

This paper analyzes the performance of random linear network coding in time-division duplex channels with Poisson arrivals, modeling it as a queue and identifying optimal bulk sizes to minimize queue length.

Contribution

It provides a full characterization of the queueing behavior for this coding scheme using moment generating functions, including numerical analysis of queue metrics.

Findings

Optimal bulk size range minimizes queue length

Derived explicit queue length expressions

Numerical results demonstrate impact of bulk size range

Abstract

We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network coding is provided for time division duplexing channels [1] by means of the moment generating function. We present numerical results for the mean number of packets in the queue and consider the effect of the range of allowable bulk sizes. We show that there exists an optimal choice of this range that minimizes the mean number of data packets in the queue.