Hi, I have this question I am trying to solve, Any Comments!!!! This question is about peer to peer networks. Suppose that I am trying to collect a movie which consists of n blocks And is scattered among some peers where each peer contains 1 block of movie. The total number of peers is much more than n. We contact the peers one at a time. We check with them if they have a block we require. If they do we take the block from them and store it but it is possible that the peer has the block which we already have with us. In this case we move to the next peer. We move from 1 peer to the next until we collect the whole movie.If the probability of a peer storing a given block of the movie is 1/n. Determine the expected number of peers that you need to contact that allows you to collect all the blocks in the movie? Thanks Any Hints would be helpful :)
2007-02-05 17:09:27 · 4 answers · asked by simi 1 in Computers & Internet ➔ Computer Networking
That's actually not that hard. Think about it. Come up with an example number of blocks.
If you had 8 blocks, for example, then the probability is 1/8 that a peer has it. So at the most, you would expect to visit 8 peers before you found one block that you needed. Since you have 8 blocks to get, you would have to do this 8 times which results in 8^2 = 64. The answer when plugging in the number 8 is 64. If you plugged in the number 4, the answer would be 16.
I'm sure you can figure out the pattern here to come up with the answer using n.
2007-02-05 17:20:59 · answer #1 · answered by SirCharles 6 · 0⤊ 0⤋
blocks just download the movies
2007-02-06 01:31:38 · answer #2 · answered by me and you 6 · 0⤊ 0⤋
that's easy.
I just let it run overnight and in the morning it is usually done.
2007-02-06 01:20:16 · answer #3 · answered by Çlïgér4™ ♂ 6 · 0⤊ 0⤋
Do your own homework, honey.
2007-02-06 01:13:30 · answer #4 · answered by Anonymous · 0⤊ 0⤋