computer science cloud homework questions

Anonymous
timer Asked: Nov 24th, 2016

Question description

Homework 3

14 questions

1.

Napster servers, as discussed in lecture, do not store which of

the following? (1 point)

1

point

Files

File pointers, i.e., (􀀞lename, peer address) pairs

Addresses of other Napster servers

Addresses of some of the peers (clients)

Homework 3 | Coursera https://www.coursera.org/learn/cloud-computing/...

1 of 10 09/27/2016 03:34 PM

2.

Which of the following Gnutella messages is reverse-routed? (1

point)

1

point

QueryHit

Ping

Giv

Pull

3.

In BitTorrent, a new leecher is downloading a 􀀞le 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 􀀞rst? (1 point)

1

point

B2

B5

B4

B1

Homework 3 | Coursera https://www.coursera.org/learn/cloud-computing/...

2 of 10 09/27/2016 03:34 PM

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)

1

point

101101011010

101001011000

101001011111

111001011010

5.

In a Pastry DHT that is locality-aware, the path of a query is

very likely to: (1 point)

1

point

Take equal-sized network jumps in its early hops and

in its later hops

Take short network jumps in its early hops and long

network jumps in later hops.

None of the above.

Take random-sized network jumps throughout its

path

1

point

Homework 3 | Coursera https://www.coursera.org/learn/cloud-computing/...

3 of 10 09/27/2016 03:34 PM

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)

Enter answer here

7.

1

point


Tutor Answer

(Top Tutor) Studypool Tutor
School: UIUC
Studypool has helped 1,244,100 students
flag Report DMCA
Similar Questions
Hot Questions
Related Tags
Study Guides

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors