2

I'm trying to understand the process inside BitTorrent and implement something similar. However, I still don't know the process of piece selection and transfer. How can each peer know that which peer has which file piece? Does each peer need to ask each other whether it has the requested piece or not all the time?

I have also heard about "rarest piece first" approach, which tries to get rarer piece before. How to get these information without wasting network traffic?

Thank you.

Udomo
  • 25
  • 4
  • 1
    You may find [this post](http://stackoverflow.com/questions/4318969/bittorrent-source-code) of interest. Looking at the source code of a bittorrent client may help. – Laurent S. Nov 14 '13 at 10:20

1 Answers1

4

This is done with two messages: bitfield and have.

  • After two peers perform a handshake, they can optionally send bitfields as their first messages, which compactly represent all of their completed blocks.

  • Once a peer successfully downloads and verifies a block, they broadcast a have message to all of their connected peers, letting them know which block they just completed.

Blender
  • 289,723
  • 53
  • 439
  • 496