Computer Science – Information Theory
Scientific paper
2009-10-20
Computer Science
Information Theory
Scientific paper
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.
Dikaliotis Theodoros K.
Dimakis Alexandros G.
Effros Michelle
Ho Tracey
No associations
LandOfFree
On the Delay of Network Coding over 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 On the Delay of Network Coding over Line Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Delay of Network Coding over Line Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-143534