Study of Throughput and Delay in Finite-Buffer Line Networks

Details Study of Throughput and Delay in Finite-Buffer Line Networks Study of Throughput and Delay in Finite-Buffer Line Networks

2011-03-07

arxiv.org/abs/1103.1403v1

Computer Science

Information Theory

5 pages, 8 figures, ITA 2011

Scientific paper

In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such as throughput and delay to be equivalent to determining the stationary distribution of an irreducible Markov chain. We note that the number of states in the Markov chain grows exponentially in the size of the buffers with the exponent scaling linearly with the number of hops in a line network. We then propose a simplified iterative scheme to approximately identify the steady-state distribution of the chain by decoupling the chain to smaller chains. The approximate solution is then used to understand the effect of buffer sizes on throughput and distribution of packet delay. Further, we classify nodes based on congestion that yields an intelligent scheme for memory allocation using the proposed framework. Finally, by simulations we confirm that our framework yields an accurate prediction of the variation of the throughput and delay distribution.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81790