Performance of a network coding queuing model with deterministic service

Performance analysis of Network Coding (NC) is becoming an increasingly important issue in today´s data communication systems. This is because of its success in achieving the min-cut capacity of multicast networks, leading to throughput improvement at the destination nodes. The implementation of NC requires a thorough investigation of its impact on relevant queuing systems. In this paper, we analyze the behavior of an M/D/1 queuing system under a synchronous NC-based scenario; an intermediate node represented by a First-In-First-Out (FIFO) queue and a single server is configured so that it receives merged and coded packets from two streams. The probability density function (pdf) for the coded packets is derived. Analytical results show that the derived pdf of the coded packets follows a random general distribution, and extensive simulations are presented to verify the constructed distribution. Furthermore, measurements of the mean waiting time and server utilization for merged and coded packets in the FIFO queue are compared.