Personally, I don't get these "X is enough, no need for Y" claims for software<br> (X = bittorrent as is, Y = coding in this case). If you can have X _and_ Y, that's clearly better than X. Someone else is going to implement Y, and they'll do it just once, so it's no skin off of anyone's back. The two cases mentioned below (even though they are not
<br> in steady state) seem like ample justification for coding.<br><br>Bob<br><br><div><span class="gmail_quote">On 5/4/06, <b class="gmail_sendername">Daniel Stutzbach</b> <<a href="mailto:agthorr@cs.uoregon.edu">agthorr@cs.uoregon.edu
</a>> wrote:</span><blockquote class="gmail_quote" style="margin-top: 0; margin-right: 0; margin-bottom: 0; margin-left: 0; margin-left: 0.80ex; border-left-color: #cccccc; border-left-width: 1px; border-left-style: solid; padding-left: 1ex">
On Thu, May 04, 2006 at 11:04:40AM +0200, Arnaud Legout wrote:<br>> We identified that when the performance of a torrent is not optimal,<br>> then it is in a transient phase. That means that the seed has not yet<br>
> sent a copy of each piece. If you use network coding of whatever coding<br>> you can imagine, we will not improve that fact that information is missing<br>> in the torrent and that is this missing information that causes the
<br>> decrease in performance.<br><br>Coding may be able to recover the missing information more quickly<br>when the system is in a transient phase. I can think of two scenarios<br>where this may occur:<br><br>1) Early in the life of the torrent when the seed has uploaded each
<br> piece only once or twice. However, due to the fact that many users<br> abort their downloads, some of these uploaded pieces will be<br> missing and the seed does not know which pieces were reproduced<br> into the rest of the system and which were not. Coding
<br> may allow the system to get out of the transient phase more rapidly<br> since the seed does not risk uploading redundant information.<br><br>2) Late in the life of the torrent when all the seeds have departed.<br>
Coding improves the probability that the set of remaining<br> peers have enough information among themselves to reproduce the<br> whole file (and become new seeds), thus extending the life of the<br> torrent.<br>
<br>--<br>Daniel Stutzbach Computer Science Ph.D Student<br><a href="http://www.barsoom.org/~agthorr">http://www.barsoom.org/~agthorr</a> University of Oregon<br>_______________________________________________
<br>p2p-hackers mailing list<br><a href="mailto:p2p-hackers@zgp.org">p2p-hackers@zgp.org</a><br><a href="http://zgp.org/mailman/listinfo/p2p-hackers">http://zgp.org/mailman/listinfo/p2p-hackers</a><br>_______________________________________________
<br>Here is a web page listing P2P Conferences:<br><a href="http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences">http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences</a><br></blockquote></div>
<br>