The Effect of Finite Memory on Throughput of Wireline Packet Networks
- 1 September 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 60-65
Abstract
In this paper, we study the effects of finite memory on the (unicast) throughput of wired erasure networks. We identify the problem of calculation of the throughput of line networks 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 buffer with the exponent scaling linear with the number of hops in the line network. We then present bounds on the achievable throughput of such networks that can be easily computed. Finally, present the results of our simulations and bounds and discuss extension to general wired networks.Keywords
This publication has 9 references indexed in Scilit:
- An Analysis of Finite-Memory Random Linear Coding on Packet Streams2006
- Minimum-cost multicast over coded packet networksIEEE Transactions on Information Theory, 2006
- Achieving minimum-cost multicast: a decentralized approach based on network coding2005
- Digital fountains: a survey and look forward2005
- Coding schemes for line networks2005
- LT codes2003
- Capacity-achieving sequences for the erasure channelIEEE Transactions on Information Theory, 2002
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Capacity-Achieving Sequences2001