The node selection strategy and chunk selection strategy determine to which node the client connects to next, and what chunk to exchange with it. Each node keeps a record of each chunk's download start and finish time. Based on these records, we created a `movie' of the download process. The movie is composed of one picture per second in the LAN and one picture per 10 seconds in the WAN. The y-axis represents the machines, and the x-axis represents chunks. The color red (dark grey on B/W prints) represents a missing chunk, and green (light grey) represents an already obtained chunk. At the beggining, all machines have all the chunks missing, so the initial graph is all red. As the download progresses, more and more chunks become green. The order in which the chunks are exchanged is determined by the selection strategies above. Each chunk selection strategy has a distinctive fingerprint. In the Round Robin chunk selection strategy, the source sends chunks to clients in order, from first to last. The movie corresponding to this strategy looks like a wave which expands from the first chunk to the last. In the Random strategy, the source sends chunks to clients at random, In the movie here, vertical green lines gradually appear in random positions. These represent chunks that were obtained by all nodes. The optimal situation is to have maximal difference among nodes, so when they connect each other they can exchange as many chunks as possible. The opposite case is that all nodes have the same chunks, so they are not able to progress in the download without contacting the source again.