Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Throughput Analysis of General Network Coding Nodes Based on SW-ARQ Transmission
 

Summary: Throughput Analysis of General Network Coding Nodes
Based on SW-ARQ Transmission
Yang Qin and Lie-Liang Yang
School of ECS, University of Southampton, SO17 1BJ, United Kingdom
Tel: 0044-(0)23-8059 3364, Email:lly@ecs.soton.ac.uk, http://www-mobile.ecs.soton.ac.uk
Abstract-- 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 pro-
vide 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

  

Source: Anderson, Jim - School of Mathematics, University of Southampton

 

Collections: Mathematics