Steady-state throughput analysis of network coding nodes employing stop-and-wait automatic repeat request

Authors:
Yang Qin;Lie-Liang Yang
Affiliations:
Faculty of Physical and Applied Science, School of Electronics and Computer Science, University of Southampton, Southampton, UK;Faculty of Physical and Applied Science, School of Electronics and Computer Science, University of Southampton, Southampton, UK
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 9
Cited 0

Data networks

Data networks
Approximate Analysis of Fork/Join Synchronization in Parallel Queues

IEEE Transactions on Computers
Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking

Journal of the ACM (JACM)
Computer Networks

Computer Networks
Error Control Coding, Second Edition

Error Control Coding, Second Edition
On broadcast stability of queue-based dynamic network coding over erasure channels

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Information flow decomposition for network coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.