Scenario #1 My computer is behind NAT but I can see in my BitTorrent client that other people are indeed connecting to me and data is being uploaded from my...
... "Behind NAT with ports forwarded" == you will initiate and receive incoming connections "Behind NAT without ports forwarded" == you will only be able to ...
from http://larytet.sourceforge.net/btRatDesign.shtml#snubbing ... Every packet and every request has price because processing of every request carry some...
I apologize for my aparent falling off the earth act being an entrepreneur I work when I have to, and I can only dedicate some free time to this. Speed ratings...
... Thats ok, many of us are in this situation. Going to reply in bits, as its a long mail. ... I did some tests on Crypto++ and openssl in 32 and 64 bit mode...
... (file, nodeID) pairs are ok but assume a standard node ID ordering (which imposes severe restrictions on how you implement) and the file will be a hash...
... Apart from the performance issue (the nodes are very small and you almost immediately need another one, what is the problem? ... Thats why I suggested...
... I'm not completely convinced it's necessary to switch from SHA-1. It's been partially solved, but it's not THAT broken, especially not for BitTorrent's...
John Hoffman
theshadow@...
Mar 4, 2005 12:55 pm
6625
... But then its basically equivalent to your get info hash extension... Or any other scheme where the first thing you do is get a full hash tree... A pure...
Hi, I have been reading the BitTorrent spec I have a couple of questions: 1. Does a client choke all peers in which it is not interested, i.e., the only way to...
... Generally no. Peers will usually unchoke any and all peers. Though there's nothing in the actual spec requiring this - as long as you can talk the...
Hi guys, Can somebody tell me who keeps the track of the pieces.I mean who has the data about which peer possess which piece/s. I first thought the tracker...
The tracker gives the peers a list of other peers. The peers then send each other 'have' and 'want' messages. (And, as an optimisation, a bitfield saying which...
This is just something that popped into my head and I thought I shared it with this mailing list to see what everyone else thinks of it. The idea is: There is...
Wouter Smeenk
woutersmeenk@...
Mar 6, 2005 6:46 pm
6639
... From: "John Hoffman" <theshadow@...> Subject: Re: [BitTorrent] Merkle, URLs, etc ... It is unlikely that there will be any good new 160 bit...
... view. ... seems you are reading the paper, IMO optimistic unchoking is what you want. peers select random peers for optimistic unchoking, so new comers can...
... The majority seems to disagree with you and think binary Merkle trees will work fine. There are certainly places where they are far from ideal, but...
Elliott Mitchell
ehem@...
Mar 7, 2005 12:33 am
6642
... Well, please remember that, when it comes to BitTorrent not only is it not 2^80 but 2^160 security, but BitTorrent has a fixed block size where many of...
John Hoffman
theshadow@...
Mar 7, 2005 12:53 am
6643
... From: "John Hoffman" <theshadow@...> Subject: Re: [BitTorrent] Merkle, URLs, etc ... That's all well and good, but cryptanalysts still are...
... From: "Elliott Mitchell" <ehem@...> Subject: Re: [BitTorrent] Have maps (was Merkle, URLs, etc) ... I have never argued that binary Merkle trees would...
... From: "Wouter Smeenk" <woutersmeenk@...> Subject: [BitTorrent] BT Like Datastore ... This problem has actually been substantially studied by Matt...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
