document.write( "Question 726443: I have very basic knowledge on probability. I am reading a paper and came across finding the probability of receiving a message in a computer network.\r
\n" ); document.write( "\n" ); document.write( "The problem: What is the number of packets that have to be transmitted in order to successfully transfer a message in a computer network without an attacker/jammer\r
\n" ); document.write( "\n" ); document.write( "Parameters
\n" ); document.write( "Total number of channels in the network is c
\n" ); document.write( "Sender: Sends on c_n <= c channels
\n" ); document.write( " Listens on c_n <= c channels
\n" ); document.write( "Question: Show that the probability that a packet is received is given by the following formula (on this one I have no idea what is happening)
\n" ); document.write( "p_m=1-∏_(i=0)^(c_m)(1-min{c_n/(c-i),1}) >= 1-(1-c_n/c)^(c_m ) (1)
\n" ); document.write( "A packet consists of l fragments. A message is said to have been transmitted if all the l packets have been received by the receiver.
\n" ); document.write( "Let Y be the number of times that the sender is required to retransmit (some packets may be lost on the way or jammed by an attacker, so they have to be transmitted a number of times) the sequence of packets in order to successfully transfer the message.
\n" ); document.write( "Question: The probability that a message is still incomplete after i (re)transmissions is then
\n" ); document.write( "P[Y≥i+1]=p[Y>i]=1-(1-(1-p_m )^i )^l (2)
\n" ); document.write( "Here is attempt
\n" ); document.write( "The probability that a packet is received
\n" ); document.write( " p_m
\n" ); document.write( "The probability that a packet is not received
\n" ); document.write( "1-p_m
\n" ); document.write( "The probability that he sent it i times
\n" ); document.write( "(1-p_m )^i
\n" ); document.write( "The probability that he did not send it i times
\n" ); document.write( "1-(1-p_m )^i
\n" ); document.write( "The probability that he did not send l fragments
\n" ); document.write( "(1-(1-p_m )^i )^l
\n" ); document.write( "The probability that he did send l fragments in i times but that they might still be in transit
\n" ); document.write( "1-(1-(1-p_m )^i )^l
\n" ); document.write( "Question: Hence the expected number of packets that have to be transmitted in order to successfully transfer a message is N_*=N(p_m)
\n" ); document.write( "N(p_m )≔∑_(i=0)^∞ (P[Y=i]il)
\n" ); document.write( "=∑_(i=0)^∞ ((P[Y≥i]-P[Y>i])il) (3)
\n" ); document.write( "=∑_(i=0)^∞((1-(1-(1-p_m )^i )^l )l) (4)
\n" ); document.write( "What do you call the property P[Y=i]=(P[Y>=i]-P[Y>i])?
\n" ); document.write( "What has happened to (3) to get (4). I know they have used (2)?\r
\n" ); document.write( "\n" ); document.write( "Thanks in advance.
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #444595 by lynnlo(4176)\"\" \"About 
You can put this solution on YOUR website!
THIS IS TOO MUCH WORK,FOR YOU TO WANT SOMEONE TO DO \"ALL\"OF IT FOR YOU \n" ); document.write( "
\n" );