Week 07: Assignment 07
1. Select the disadvantages of the Napster peer to peer network.
Centralized server is a source of congestion
Distributed storage
Centralized server is a single point of failure
No security
Explanation:
All except Distributed storage are the disadvantages
2. In Chord a supernode stores a directory listing a subset of nearby (<filename,peer pointer>), similar to Napster
servers. The statement is,
True
False
Explanation:
In FastTrack, a supernode stores a directory listing a subset of nearby
(filename,peer pointer), similar to Napster servers
3. _____ systems use _____ organization of the _____ for flexibly sharing resources (e.g., files and multimedia
documents) stored across network-wide computers.
Chord, Network-level, local network
DHT, Physical-level, network overlay
Peer-to-peer (P2P) network, Transport-level, network overlay
Peer-to-peer (P2P) network, Application-level, network overlay
Explanation:
Peer-to-peer (P2P) network systems use Application-level
organization of the network overlay for flexibly sharing resources (e.g., files and
multimedia documents) stored across network-wide computers.
4. In a Gnutella P2P network with N nodes, how many number of messages would a lookup operation require?
N
N/2
log(N)
log(logN)
Explanation:
In a Gnutella P2P network with N nodes, N number of messages for a
lookup will be required.
5. Users specify a ___________function that processes a key/value pair to generate a set of intermediate key/value
pairs, and a ____________ function that merges all intermediate values associated with the same intermediate key.
Reduce, Map
Map, Reduce
Chunk, Grep
None of the mentioned
Explanation:
Users specify a map function that processes a key/value pair to
generate a set of intermediate key/value pairs, and a reduce function that merges all
intermediate values associated with the same intermediate key.
6. The Map phase is subdivided into M pieces and the reduce phase into R pieces. There are practical bounds on how
large M and R can be, since the master must make X scheduling decisions and keeps Y state in memory.
X: O(M*R), Y: O(M * R)
X: O(M + R), Y: O(M + R)
X: O(M + R), Y: O(M * R)
X: O(M * R), Y: O(M + R)
Explanation:
The Map phase is subdivided into M pieces and the reduce phase into
R pieces. Ideally, M and R should be much larger than the number of worker
machines. Having each worker perform many different tasks improves dynamic load
balancing, and also speeds up recovery when a worker fails: the many map tasks it
has completed can be spread out across all the other worker machines. There are
practical bounds on how large M and R can be, since the master must make O(M +
R) scheduling decisions and keeps O(M * R) state in memory.
7. Select the characteristic of P2P network.
Fault Tolerance
Dealing with instability
Low Latency
Self-Adaptation
Explanation:
All except Low Latency are the the characteristic of P2P network
8. Peer-to-peer (P2P) network systems use ___________________organization of the network overlay for flexibly
sharing resources (e.g., files and multimedia documents) stored across network-wide computers.
Physical-level
Network-level
Transport-level
Application-level
Explanation:
Peer-to-peer (P2P) network systems use Application-level
organization of the network overlay for flexibly sharing resources
stored across network-wide computers.
9. Which of these P2P system uses a 1 hop Lookup DHT (Distributed Hash Table)?
CAN
Kelips
CHORD
Gnutella
Explanation:
Kelips uses a 1 hop Lookup DHT
10. Select the correct statement with regard to BitTorrent.
Prefer early download of blocks that are least replicated among neighbors
Centralized serve
Some peers designated as super nodes
Clients act as servers too, called servents
Explanation:
The correct statement is
Prefer early download of blocks that are least replicated among neighbors
