bittorrent

问题 Closest question to this I think. One obvious method of structuring a routing table is to simply maintain a literal table. Map(XOR,Node) Kademlia discusses the use of 'Buckets' which are organised by the most significant bit of the XOR. What is the actual purpose of 'buckets'? Why mess around with 'longest prefix' when we can simply hold the 'actual' XOR as a key in a map? Obviously the map could potentially be 2^160 large, but we could use some heuristics to limit the size of the map, rather

问题 I'm reading Bittorrent Request parameter that need to be sent to announce URL over here Question 1: left params: left: The number of bytes this client still has to download in base ten ASCII. Clarification: The number of bytes needed to download to be 100% complete and get all the included files in the torrent. also BEEP-3 states The number of bytes this peer still has to download, encoded in base ten ascii. Note that this can't be computed from downloaded and the file length since it might

问题 This has seriously perplexed me. The original Kademlia offers that 160bit hex like a sha1 should be used for obvious reasons: When searching for peers relating to an infohash, you simple search nodeIDs as they should be equivalent to the same system as the sha1 infohash. But reading this: http://www.bittorrent.org/beps/bep_0005.html the id's are abcdefghi0123456789 which is: 1) Half the size 2) Uses more characters then standard hex encoding. So what am I missing? Why are node id's like this?

问题 http://p4p.arenabg.com:1337/announce?info_hash=%1a%b2%ceMb%a9%a4n%91%a3%a3%09%7b%ce%bdbH%97%8d%40 When I send an announce I get the response: When parsing the entire response, as ascii, it works, however the peer is still encoded: 112 7 55 110 88 35 104 15 73 31 26 97 85 21 75 11 26 97 79 116 48 49 26 97 103 55 47 9 35 39 2 105 62 122 72 85 41 52 3 2 94 65 84 36 6 49 61 118 73 84 127 116 79 68 86 85 44 120 26 97 81 114 116 4 26 97 2 105 12 92 69 33 41 47 124 15 16 6 82 3 96 118 127 78 85 26

问题 Working with Rasterbar libtorrent I dont want the downloaded data to sit on my hard drive rather a pipe or variable or something Soft so I can redirect it to somewhere else, Mysql, or even trash if it is not what I want, is there anyway of doing this in preferably python binding if not in C++ using Libtorrent? EDIT:--> I like to point out this is a libtorrent question not a Linux file handling or Python file handling question. I need to tell libtorrent to instead of save the file

问题 I am making a torrent client. I decode the torrent file and send this request to the tracker: http://tracker.mininova.org/announce?uploaded=0&downloaded=0&compact=0&event=started&peer_id=12345678987654321234&port=6881&info_hash=%18%28n%23K%ECt%B7%93S%C5%F1-%F3%1C%18k%CEX%A4&left=0 and this is what I received: {'min interval': 1800, 'peers': '', 'interval': 1800, 'complete': 37, 'incomplete': 0} Why is the peer list empty? There are 37 peers that are seeders, shouldn't I get some peer

问题 I'm currently trying to implement a minimal torrent client, in nodeJS. I'm reading through this specification: https://wiki.theory.org/index.php/BitTorrentSpecification I've got 2 magnet URIs: magnet:?xt=urn:btih:633ab5b0cc27218bca2f9fec9b68ae4f7cbf0c5f&dn=dmb2017-05-31.dpa4021.flac16 xt=urn:btih:633ab5b0cc27218bca2f9fec9b68ae4f7cbf0c5f dn=dmb2017-05-31.dpa4021.flac16 magnet:?xt=urn:btih:9f9165d9a281a9b8e782cd5176bbcc8256fd1871&dn=Ubuntu+16.04.1+LTS+Desktop+64-bit&tr=udp%3A%2F%2Ftracker

问题 Suppose I have 2+ clients (developed by me) ALL using libtorrent ( http://www.rasterbar.com/products/libtorrent/manual.html#queuing ) Can I prioritize download of a file from other clients effectively so that they download the file's pieces/chunks (whatever is torrent terminology here) from beginning of the file towards its end and not quite in random order? (of course I'm allowing some "multiplexing" / "intertwining" pieces for reasons of availability and performance, but the goal here is to

问题 Do you know of any easy to use, neat API for Python or Perl to interact with BitTorrent Trackers? E.g., I take a torrent file, enumerate all trackers in the file and ask the tracker for the statistics of the peers related with the downloaded file? BitTorrent Tracker specification is not too complicated, but I don't want to reinvent the wheel :) Note that I don't want to download the data, just to grab some stats (Net::BitTorrent far more than I need) 回答1: Just plain command line isn't enough?

问题 I've been throwing a little bit of spare time at writing a BitTorrent client, mostly out of curiosity but partly out of a desire to improve my c# skills. I've been using the theory wiki as my guide. I've built up a library of classes for handling BEncoding, which I'm quite confident in; basically because the sanity check is to regenerate the original .torrent file from my internal representation immediately after parsing, then hash and compare. The next stage is to get tracker announces