The University of Southampton
University of Southampton Institutional Repository

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

Throughput Analysis of General Network Coding Nodes Based on SW-ARQ Transmission
Throughput Analysis of General Network Coding Nodes Based on SW-ARQ Transmission
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.
978-1-4244-3573-9
Qin, Yang
878d3de3-2ab5-401f-a5fd-eaaed7188abf
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Qin, Yang
878d3de3-2ab5-401f-a5fd-eaaed7188abf
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7

Qin, Yang and Yang, Lie-Liang (2010) Throughput Analysis of General Network Coding Nodes Based on SW-ARQ Transmission. VTC2010-FALL Ottawa, Canada, Ottawa, Canada. 05 - 08 Sep 2010.

Record type: Conference or Workshop Item (Paper)

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 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.

Other
11-09-03.PDF - Other
Download (406kB)

More information

Published date: September 2010
Additional Information: Event Dates: 6-9 September 2010
Venue - Dates: VTC2010-FALL Ottawa, Canada, Ottawa, Canada, 2010-09-05 - 2010-09-08
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 271541
URI: http://eprints.soton.ac.uk/id/eprint/271541
ISBN: 978-1-4244-3573-9
PURE UUID: df7e0f1c-9319-4352-a7d7-e3dac96e8cd6
ORCID for Lie-Liang Yang: ORCID iD orcid.org/0000-0002-2032-9327

Catalogue record

Date deposited: 12 Sep 2010 17:34
Last modified: 07 Oct 2020 01:42

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×