Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Aggregated bounding Markov processes applied to the analysis of tandem queues
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks
Capacity of wireless erasure networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore the asymptotic rate is determined by the worst link of the line network. In this paper we investigate the delay for transmitting a batch of packets, which is a function of all the erasure probabilities and the number of packets in the batch. We show a monotonicity result on the delay function and derive simple expressions which characterize the expected delay behavior of line networks. Further, we use a martingale bounded differences argument to show that the actual delay is tightly concentrated around its expectation.