APPLICATION LAYER
PEER TO PEER PARADIGM
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Rarest Piece First
|
|
|
Strict Priority
|
|
|
Random First Piece
|
|
|
End Game Mode
|
Detailed explanation-1: -Without an initial seed, or at least leechers which collectively have all pieces, a swarm cannot be successful in that no peer will ever have the full content. In order to get fair reciprocation between participating peers a peer selection algorithm, known as the choking algorithm, is used.
Detailed explanation-2: -Typically, BitTorrent uses TCP as its transport protocol for exchanging pieces, and it uses HTTP for tracker comms. The well known TCP port for BitTorrent traffic is 6881-6889 (and 6969 for the tracker port). The DHT extension (peer-to-peer tracker) uses various UDP ports negotiated by the peers.
Detailed explanation-3: -Spreading the seed Rarest-first piece selection strategy ensures only “new” pieces (that are with no other leechers) are downloaded from the seeder. We get a quick distribution of pieces in the network and a reduced load on the seeder.