This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Assume that the goal is to transport K packets using these channels, each of which introduces a random delay captured X(i), i=1,…,K. Here, X(i) are i.i.d, exponentially distributed variables with mean m. Find the message reconstruction time for this communication scheme. Next, assume that the packets are viewed as symbols over a sufficiently large alphabet size, and that the K-set of packets is encodes into N packets using a Reed-Solomon code. Assume also that there now exist N available i.i.d. channels, with delays Y(i), i=1,…,K. If the delays are assumed to be exponentially distributed, find the value of their mean that will lead to the same message reconstruction delay as obtained in the first case....
View Full Document
This note was uploaded on 02/08/2012 for the course ECE 556 taught by Professor Milenkovic,o during the Fall '08 term at University of Illinois, Urbana Champaign.
- Fall '08