Skip to main content
Article thumbnail
Location of Repository

Study of Throughput and Delay in Finite-Buffer Line Networks

By Badri N. Vellambi, Nima Torabkhani and Faramarz Fekri

Abstract

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.Comment: 5 pages, 8 figures, ITA 201

Topics: Computer Science - Information Theory
Year: 2011
OAI identifier: oai:arXiv.org:1103.1403
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1103.1403 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.