1. Consider a Chord system with identifiers in the range [0, 31]. Suppose there are ten nodes...
Question:
1.Consider a Chord system with identifiers in the range [0, 31]. Suppose there are ten nodes with identifiers 0, 6, 8, 14, 16, 17, 22, 23, 26, and 30.
(1) Assume there are 12 keys: 1, 2, 7, 9, 11, 12, 13, 20, 21, 23, 27, and 28. For each node in the network, identify the keys that each node is responsible for.
(2) A query for key 27 is initiated at node 0. Write down the sequence of nodes the query will be forwarded to, and the finger tables of these nodes.
2. Consider the Chord system in above question, and assume that a node with identifier 10 joined the system. After node 10 has been added to the network, for each node in the network identify the keys that it is responsible for and the finger table of node 10.
3.Consider the P2P network shown in Figure 8.14. The upload/download capacities of the four nodes are summarized in Table 8.6.
(1) If node 1 is the streaming source and the other nodes are peers, what is the maximum stream rate? Write down the set of trees that can be used to achieve the streaming rate.
(2) Repeat (1) when node 2 becomes the streaming source and node 1 becomes a peer.