Homework 3

PUNTOS TOTALES DE 14
1.Pregunta 1
Napster servers, as discussed in lecture, do not help in which of the following? (1 point)

Keeping track of meta-information about files, e.g., artist, song name, etc.

Uploading/downloading files after search

Keeping track of file pointers, i.e., (filename, peer address) pairs

Searching for files

1 punto

D FAIL
C FAIL
B

Napster servers, as discussed in lecture, do not store which of the following? (1 point)

Addresses of some of the peers (clients)

File pointers, i.e., (filename, peer address) pairs

Files

Meta-information about files, e.g., artist, song name, etc.)

1 punto
A FAIL

Which of the following Gnutella messages are flooded out and TTL restricted? (1 point)

QueryHit

Take

Query

Pull

Queryhit Incorrect
Query CORRECT
2.Pregunta 2
Which of the following Gnutella messages is reverse-routed? (1 point)

Query

Take

QueryHit

OK

1 punto

3.Pregunta 3
In BitTorrent, a new leecher is downloading a file with 5 blocks (B1 through B5). The leecher
has 3 neighbors X, Y, and Z. These neighbor peers have the following blocks: X: (B1, B2, B3,
B4). Y: (B1, B3, B4, B5). Z: (B1, B3, B5). Which of the following blocks does the leecher prefer
downloading first? (1 point)

B4

B5

B1

B2

1 punto

B2

In BitTorrent, a newly joined leecher X is trying to download a file with 6 blocks B1–B6. X has
3 neighbors: A, B, and C. These neighbors are storing the following blocks of the file: A: {B1,
B2, B4, B5}; B:{B2, B3, B4, B5, B6}; C:{B1, B2, B6}. Then X will prefer downloading which
block first? (1 point)

B2 INCORRECT

4.Pregunta 4
A Pastry DHT has a peer P with the following neighbors. P currently has to route a query to
key 101001011010. Which of the following neighbors is the best next-hop for this query? (1
point)
101011001110

111001011010

101001011000

Cannot tell because P’s node id is not given

1 punto

101001011000

A Pastry DHT has a peer P with the following neighbors. P currently has to route a query to
key 101011001111. Which of the following neighbors is the best next-hop for this query? (1
point)

101001011000 INCORRECT

101011001110

5.Pregunta 5
In a Pastry DHT that is locality-aware, the path of a query is very likely to: (1 point)

None of the above.

Take long network jumps in its early hops and short network jumps in later hops

Take short network jumps in its early hops and long network jumps in later hops.

Take random-sized network jumps throughout its path

1 punto

b) FAIL

d FAIL
a FAIL

In the Chord DHT when a peer P fails from the system, which of the following will
not happen? (1 point)

Some other peers will need to change their finger table entries.

The entire ring will have to be reorganized from scratch.

Some files will need to move (assuming replication).

Before the failure is detected, some queries passing through P may be dropped or rerouted.

1 punto

6.Pregunta 6
A Gnutella topology looks like a balanced ternary tree with 5 levels of nodes, i.e., peers. Thus,
there is 1 root at Level 1, which has 3 children at Level 2, which each have 3 children at Level
3, which in turn each have 3 children at Level 4, which in turn each have 3 children at Level 5
– thus, there are a total of 121 nodes.

If the root node (Level 1) sends a Query message with TTL=3, then what are the number of
nodes receiving the Query message, not including the originating node? Enter your answer
as a numeric value in the text box below. (1 point)

1 punto
All nodes
Level 5 3x3x3x3
Level 4 +3x3x3
Level 3 +3x3
Level 2 +3
Level 1+1=27x4+12+1=121
Nodes up to level 4: 3+3x3+3x3x3=39

7.Pregunta 7
A Gnutella topology looks like a balanced ternary tree with 4 levels of nodes, i.e., peers, as
shown in the picture below. Thus, there is 1 root at Level 1, which has 3 children at Level 2,
which each have 3 children at Level 3, which in turn each have 3 children at Level 4 – thus,
there are a total of 40 nodes.

If one of the leaf nodes (Level 4 nodes in the tree) sends a Query message with TTL=3, then
what are the number of nodes receiving the Query message, not including the originating
node? Enter your answer as a numeric value in the text box below. (1 point)
1 punto

1 hop. Level 3
2 hops Level 3 (1) +level 4 (2) +level 2 (1). Total: 4
3 hops level 3(1) + level 4 (2) + level 2 (1) + level 1 (1) + level 3 (2)= 1+2+1+1+2= 7

A Gnutella topology looks like a balanced ternary tree with 5 levels of nodes, i.e., peers. Thus,
there is 1 root at Level 1, which has 3 children at Level 2, which each have 3 children at Level
3, which in turn each have 3 children at Level 4, which in turn each have 3 children at Level 5
– thus, there are a total of 121 nodes.

If a leaf (Level 5) node sends a Query message with TTL=2, then what are the number of
nodes receiving this message, not including the originating node? Enter your answer as a
numeric value in the text box below. (1 point)

1 hop level 4 above

2 hops level 4 above, level 3 above and level 5 peers= 1 + 1 + 2 = 4

8.Pregunta 8
A Gnutella topology looks like a balanced ternary tree with 4 levels of nodes, i.e., peers, as
shown in the picture below. Thus, there is 1 root at Level 1, which has 3 children at Level 2,
which each have 3 children at Level 3, which in turn each have 3 children at Level 4 – thus,
there are a total of 40 nodes.
If a child of the root (i.e., a Level 2 node in the tree) sends a Query message with TTL=3, then
what are the number of nodes receiving the Query message, not including the originating
node? Enter your answer as a numeric value in the text box below. (1 point)

1 punto

Level 1 1
Level 2 +2
Level 3 + 3x3
Level 4 + 1x3x3
Total : 21

A Gnutella topology looks like a balanced ternary tree with 5 levels of nodes, i.e., peers. Thus,
there is 1 root at Level 1, which has 3 children at Level 2, which each have 3 children at Level
3, which in turn each have 3 children at Level 4, which in turn each have 3 children at Level 5
– thus, there are a total of 121 nodes.

If a child of the root (i.e., a Level 2 node) sends a Query message with TTL=5, then what are
the number of nodes receiving the Query message, not including the originating node? Enter
your answer as a numeric value in the text box below. (1 point)

21 INCORRECT
9.Pregunta 9
A Gnutella topology looks like a balanced ternary tree with 5 levels of nodes, i.e., peers. Thus,
there is one root at Level 1, which has 3 children at Level 2, which each have 3 children at
Level 3, which in turn each have 3 children at Level 4, which in turn each have 3 children at
Level 5 – thus, there are a total of 121 nodes.

What is the minimum TTL required for any node’s Query to reach every other node? Enter
your answer as a numeric value in the text box below. (1 point)

1 punto

A Gnutella topology looks like a balanced ternary tree with 4 levels of nodes, i.e., peers, as
shown in the picture below. Thus, there is one root at Level 1, which has 3 children at Level 2,
which each have 3 children at Level 3, which in turn each have 3 children at Level 4 – thus,
there are a total of 40 nodes.

If the originating node of the Query is a leaf (Level 4 node), what is the minimum TTL to
ensure all nodes in the system receive the Query? Enter your answer as a numeric value in
the text box below. (1 point)

10.Pregunta 10
In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system:
45, 32, 132, 234, 99, 199. What node id is the file with id 120 stored at (assuming only one
replica)? Enter your answer as a numeric value in the text box below. (1 point)

1 punto

132

In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system:
1, 12, 123, 234, 345, 456, 501.

What node id is the file with id 120 stored at (assuming only one replica)? Enter your answer
as a numeric value in the text box below. (1 point)

123

11.Pregunta 11
In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system:
1, 12, 123, 234, 345, 456, 501. Which of the following nodes is not present as a finger table
entry or successor of 234? (1 point)

501

456

345

1 punto
501 FAIL

234+1 => 345

234+2 => 345
234+4 => 345
234+16 =>345
+32
+64
+128=362=> 456
+256=490 => 501
+512=746 =>1

1) CORRECT

In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system:
45, 32, 132, 234, 99, 199.

What is the successor of node 199? Enter your answer as a numeric value in the text box
below. (1 point)

234

12.Pregunta 12
In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system:
45, 32, 132, 234, 99, 199. What is the comma-separated list of 8 finger table entries at node
45?

Use the text box below to enter your answer as a sequence of numeric values with each
numeric value separated by a comma. Please ensure you enter one number for each finger
table id i (you do not need to enter i, but only the node id's). (1 point)
1 punto
45+1=46=>99
45+2=47=>99
45+4=49=>99
45+8=53=>99
45+16=61=>99
45+32=77=>99
45+64=109=>132
45+128=173=>199
99,99,99,99,99,99,132,199

13.Pregunta 13
In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system:
45, 32, 132, 234, 99, 199. When all finger tables and successors have converged, what is the
comma-separated list of nodes traversed by a query originating from node 45 intended for
the key 12 (include both originating node and final node)?

Use the text box below to enter your answer as a sequence of numeric values with each
numeric value separated by a comma. Please ensure you enter the node ids in the order
traversed, and include both starting and ending nodes in the sequence. (1 point)

1 punto

Finger table 199:

200 => 234
201 => 234
203 =>234
207 => 234
215 => 234
231 => 234
263 >255 => 45

2^8-1=255

45 – 199 1 hop
45, 199, 234, 45 FAIL
45, 199, 45 FAIL
45, 199, 32, 45
Maybe 45 or empty FAIL

14.Pregunta 14
In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system:
1, 12, 123, 234, 345, 456, 501. The successor of node 501 is: (1 point)

Nothing – 501 does not have a successor since it is the end of the ring

456
1

12

123

1 punto

In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system:
1, 12, 123, 234, 345, 456, 501. If node 234 fails, which of the following nodes will not update
any of their finger table entries or successors? (1 point)

12

456

123

501

456 INCORRECT

In a Chord ring using m = 8, nodes with the following peer ids (or node ids) join the system:
45, 32, 132, 234, 99, 199. If node 45 fails, then what is the comma-separated list of all the
nodes whose finger tables need to be updated?

Use the text box below to enter your answer as a sequence of numeric values with each
numeric value separated by a comma. Please ensure you list nodes in increasing order of id.
(1 point)

32, 234, 199 INCORRECT

In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system:
1, 12, 123, 234, 345, 456, 501.

Node 234 initiates a search (query) for key 10. What is the comma-separated list of all nodes
traversed by this query, including the final destination (including both originating node and
final node)?
Use the text box below to enter your answer as a sequence of numeric values with each
numeric value separated by a comma. Please ensure you enter the node ids in the order
traversed, and include both starting and ending nodes in the sequence. (1 point)

234,501,1,10 INCORRECT
234,501,1,12

In a Chord ring using m = 9, nodes with the following peer ids (or node ids) join the system:
1, 12, 123, 234, 345, 456, 501. The successor of node 501 is: (1 point)

12

Nothing – 501 does not have a successor since it is the end of the ring

456

123

1 punto
1