The University of Southampton
University of Southampton Institutional Repository

Steady-State Throughput Analysis of Network Coding Nodes Employing Stop-and-Wait Automatic Repeat Request

Steady-State Throughput Analysis of Network Coding Nodes Employing Stop-and-Wait Automatic Repeat Request
Steady-State Throughput Analysis of Network Coding Nodes Employing Stop-and-Wait Automatic Repeat Request
This contribution 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.
Network coding, state machine, automatic repeat request, throughput.
1402-1411
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 (2012) Steady-State Throughput Analysis of Network Coding Nodes Employing Stop-and-Wait Automatic Repeat Request. IEEE/ACM Transactions on Networking, 20 (5), 1402-1411. (In Press)

Record type: Article

Abstract

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

Text
IEEE-ACM-2012-06111500.pdf - Other
Download (2MB)

More information

Accepted/In Press date: October 2012
Keywords: Network coding, state machine, automatic repeat request, throughput.
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 273006
URI: http://eprints.soton.ac.uk/id/eprint/273006
PURE UUID: 7e67c548-84fe-47e3-a41a-bf1159933ed1
ORCID for Lie-Liang Yang: ORCID iD orcid.org/0000-0002-2032-9327

Catalogue record

Date deposited: 16 Nov 2011 12:43
Last modified: 01 Oct 2020 01:33

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.

×