Study of Throughput and Latency in Finite-buffer Coded Networks

Details Study of Throughput and Latency in Finite-buffer Coded Networks Study of Throughput and Latency in Finite-buffer Coded Networks

2010-12-13

arxiv.org/abs/1012.2622v1

Computer Science

Information Theory

5 pages, 4 figures, Asilomar 2010

Scientific paper

Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due to blocking due to full buffers. In this paper, a block-by-block random linear network coding scheme with feedback on the links is selected for reliability and more importantly guaranteed decoding of each block. We propose a novel method that iteratively estimates the performance parameters of the network and more importantly reduces the computational complexity compared to the exact analysis. The proposed framework yields an accurate estimate of the distribution of buffer occupancies at the intermediate nodes using which we obtain analytical expressions for network throughput and delay distribution of a block of packets.

Affiliated with

Also associated with

No associations

Rating

Study of Throughput and Latency in Finite-buffer Coded 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 Study of Throughput and Latency in Finite-buffer Coded Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Study of Throughput and Latency in Finite-buffer Coded Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26522