Throughput and Latency in Finite-Buffer Line Networks
- 23 May 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 57 (6) , 3622-3643
Abstract
This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly. Using simple strategies, bounds on the throughput capacity are derived. The work then presents two iterative schemes to approximate the steady-state distribution of node occupancies by decoupling the chain to smaller queueing blocks. These approximate solutions are used to understand the effect of buffer sizes on throughput capacity and the distribution of packet delay. Using the exact modeling for line networks, it is shown that the throughput capacity is unaltered in the absence of hop-by-hop feedback provided packet-level network coding is allowed. Finally, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput capacity and delay distribution and captures the vital trends and tradeoffs in these networks.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- The Effect of Finite Memory on Throughput of Wireline Packet Networks2007
- An Analysis of Finite-Memory Random Linear Coding on Packet Streams2006
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Introduction to Stochastic Networks1999
- On Decomposition Methods for Tandem Queueing Networks with BlockingOperations Research, 1993
- Performance bounds on multiserver exponential tandem queues with finite buffersEuropean Journal of Operational Research, 1992
- Approximate Analysis of Queues in Series with Phase-Type Service Times and BlockingOperations Research, 1989
- An Approximation Method for Tandem Queues with BlockingOperations Research, 1988
- Approximate analysis of exponential tandem queues with blockingEuropean Journal of Operational Research, 1982
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956