The delay characteristics of network coding nodes and Butterfly network are investigated. First, the probability mass function (PMF) of delay and the average delay of general network coding nodes having multiple input links and one output link are analysed. It can be shown that the PMF and average delay can be readily evaluated from the recursive equations derived. Then, the delay performance of the Butterfly network is investigated. Specifically, the authors consider four different scenarios in the context of the packets transmitted over the Butterfly network. The PMFs of delay as well as the average delays of these four scenarios are analysed and, correspondingly, a range of formulae are obtained. Finally, the delay performance of network coding nodes and Butterfly network is investigated based on the numerical results evaluated from the formulae derived. The authors studies demonstrate that network coding nodes embedded in a network generate a big impact on the network's delay performance. Usually, in a network including some network coding nodes, the longest path with some network coding nodes may be chosen for approximately estimating the network's average delay.

The steady-state performance of general network coding node is investigated, when data are transmitted in packets based on the stop-and-wait automatic repeat request error-control scheme. The general network coding node considered has H number of incoming links that provide packets for forming the coded packets transmitted by one outgoing link. Each of the incoming and outgoing links is assumed to have some buffers for temporarily storing the data packets. The state transition of the general network coding node is modelled by a finite state machine, and its steady-state performance is derived based on the properties of discrete-time Markov chain. Specifically, the throughput, blocking probability and the distribution of contents are analysed, when the general network coding node is operated in the steady state. The performance of the general network coding node is investigated either by simulations or by evaluation of the formulas derived in this study. The performance results show that the analytical formulas obtained can be well justified by the simulation results. Furthermore, it can be shown that the packet error rate, the capacity of buffer and the number of incoming links may impose significant impact on the performance of general network coding node.

This paper analyzes the steady-state throughput of network coding nodes when data is transmitted based on the stop-and-wait automatic repeat request (SW-ARQ) scheme. The state transition of network coding nodes employing SW-ARQ is analyzed, which shows that the operations of network coding nodes can be modeled by a finite state machine. Therefore, the throughput expressions of network coding nodes can be derived based on the properties of finite state machines. Furthermore, the throughput performance of network coding nodes is investigated either by simulations or by evaluation of the expressions obtained. It can be shown that the simulation results converge closely to the numerical results and justify the effectiveness of our analytical expressions obtained.

This contribution analyzes the steady-state throughput of general network coding nodes, when data is transmitted based on stop-and-wait automatic repeat request (SW-ARQ) scheme. The state transition of network coding nodes employing SW-ARQ is analyzed, which shows that the operations of network coding nodes can be modelled by a finite state machine. Therefore, the throughput expressions of general network coding nodes can be derived based on the properties of finite state machines. Furthermore, the throughput performance of network coding nodes is investigated either by simulations or by evaluation of the expressions obtained. It can be shown that the simulation results converge closely to the numerical results and justify the effectiveness of our analytical expressions obtained.

The steady-state throughput of general network coding node is investigated, when data is transmitted in packets based on the stop-and-wait automatic repeat request (SW-ARQ) error-control scheme. The general network coding node has H number of incoming links that provide packets for forming the coded packets transmitted by one outgoing link. Each of the incoming and outgoing links is assumed to have some buffers for storing the temporary data packets. The state transition of the general network coding node is modelled by a finite state machine, and its steady-state throughput is derived based on the properties of discrete-time Markov chain. Furthermore, the throughput performance of the general network coding node is investigated either by simulations or by evaluation of the expressions derived in this paper. Our performance results show that the analytical expressions obtained can be well justified by the simulation results. Furthermore, it can be shown that the packet error rate, the amount of buffer and the number of incoming links may impose significant impact on the achievable throughput of the general network coding nodes.