P2P Systems: Napster at 04:10

In Napster, which of the following ARE NOT stored

at a Napster server?
1. Files
2. Information about where files are located
3. Keywords of files
4. Addresses of some of the other Napster servers

ANSWERS: 1.

P2P Systems: Gnutella at 07:42

Which of the following fields ensures that a Gnutella
Query message does not circulate forever?
1. Descriptor ID
2. Payload descriptor
3. Hops
4. TTL

ANSWER: 4.

P2P Systems: Gnutella at 14:38

If the responding peer is behind a firewall, which of the
following statements ARE TRUE about Gnutella?
1. A Push message can be sent to it since it is already
connected to its peers.
2. A Push message cannot be sent to it.
3. A modified version of Gnutella could use the overlay
links themselves to transfer the file (though this may
be slow).
4. The file cannot be transferred at all.

ANSWER: 1, 3.

P2P Systems: Gnutella at 16:01

When a Gnutella peer receives a Ping message from one
of its neighbors, which of the following actions does it
perform? (select multiple correct answers)
1. It forwards it to appropriate neighbors after checking
TTL.
2. It creates a Pong message about itself and reverse
routes it.
3. If it was the original peer that initiated the Ping, it
uses received Pong responses to update its
membership lists.
4. It reverse routes any Pong messages it receives.
ANSWER: 1, 2, 3, 4.

P2P Systems: FastTrack and BitTorrent at 06:56

Why are random choices used in the BitTorrent Choking
policy?
1. To avoid the system from getting stuck where only a
few peers receive service
2. To ensure that all peers receive uniform download
speed
3. To ensure Tit for Tat bandwidth usage
4. None of the above.

ANSWER: 1.

P2P Systems: Chord at 13:02

What are the types of neighbors used in a Chord P2P
system (select all correct answers)?
1. Successors
2. Finger tables
3. Predecessors (if needed)

ANSWER: 1, 2, 3.

P2P Systems: Chord at 13:02

In a Chord P2P system with m=8, a peer with id 33 is
considering the following peers for its i=3rd finger table
entry: 40, 42, and 44. Which one is the best (correct)
choice?
1. 40
2. 42
3. 44
4. 41

ANSWER: 2.

P2P Systems: Chord at 16:07

In a Chord ring with m=7, three successive peers have ids 12,
19, 33 (there are other peers in the system too, but not in
between 12 and 33). If the number of files is large and a
uniform hash function is used, which of the following is true?
1. Peer 12 stores about the same number of files as peer 19.
2. Peer 33 stores about the same number of files as peer 19.
3. Peer 12 stores about double the number of files as peer 19.
4. Peer 33 stores about double the number of files as peer 19.

ANSWER: 4.

P2P Systems: Failures in Chord at 13:12

Churn leads to which of the following behaviors in
Chord (select all correct answers)?
1. Successors being continuously updated
2. Finger tables being continuously updated
3. Files being continuously copied to the correct
storing servers

ANSWERS: 1, 2, 3.

P2P Systems: Pastry at 05:21

A Pastry peer has two neighbors for prefixes of 101*
and 101110* respectively. Which of these is more
likely to respond to a message faster?
1. 101* neighbor
2. 101110* neighbor
3. They are equidistant.

ANSWER: 1.