Please help for the solutions with much details

Homework 3

14 questions

1
point 1. 

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

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

Files

Addresses of some of the peers (clients)

Addresses of other Napster servers

1
point 2. 

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

Pull

Query

Push

OK

1
point 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)

B1

B2

B4

B5

1
point 4. 

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)

101001011010

101011001110

101001011000

101101011010

1
point 5. 

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

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

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

Some files will need to move (assuming replication).

The entire ring will have to be reorganized from scratch.

1

point 6. 

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 the root node (Level 1) sends a Query message with TTL=2, 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

point 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

point 8. 

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)

1

point 9. 

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)

1

point 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

point 11. 

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)

1

point 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
point 13. 

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)

456

501

123

12

1

point 14. 

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)

Homework 314 questions1.Napster servers, as discussed in lecture,do notstore which ofthe following? (1 point)1pointFilesFile pointers, i.e., ( lename, peer address) pairsAddresses of other Napster serversAddresses of some of the peers (clients)Homework 3 | Courserahttps://www.coursera.org/learn/cloud-computing/...1 of 1009/27/2016 03:34 PM

• 1495095928-Program Six.docx

SuperTutor

(15)

Status NEW Posted 18 May 2017 08:05 AM My Price 9.00

-----------

Attachments

file 1495095932-Solutions file 2.docx preview (51 words )

H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------

Not Rated(0)

• Buy Answer