Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks

Details Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks

2011-12-13

arxiv.org/abs/1112.2810v1

Computer Science

Information Theory

5 pages, 5 figures, ITW2011

Scientific paper

In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing theoretical models. We model the performance of the network using Markov chains by a careful derivation of the buffer occupancy states and their transition rules. We verify by simulations that the proposed framework results in an accurate measure of the network throughput offered by RLNC. Further, we introduce a class of acyclic networks for which the number of state variables is significantly reduced.

Affiliated with

Also associated with

No associations

Rating

Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Modeling of the Performance of Random Linear Network Coding in Finite-buffer Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-485982