In BitTorrent, consider peer A is connected to peers B, C, D and E. A asks...

In BitTorrent, consider peer A is connected to peers B, C, D and E. A asks the other peers for list of chunks that they have. B, C, D and E have the following chunks that are missing to A: B – C1, C3 C – C1, C3, C5 D – C3, C4, C5 E – C2, C4 Which is the chunk that A requests first, and from which peer?

Expert Solution

Peers can be defined as the systems downloading the same data as the user. Now, simultaneously with downloading, uploading can also happen as the system uploads a part of the already downloaded data (we can notice it in the information tab as the upload speed).

From the given scenario we can conclude that peer A required five chunks of data. i.e. C1, C2, C3, C4 and C5.

The missing data chunks for peer B = C2, C3, C4 and C5.

The missing data chunks for peer C = C2, C4 and C5.

The missing data chunks for peer D = C1, C2 and C5.

The missing data chunks for peer E = C1, C3 and C5.

So, B will request peer E for C2.

C will request peer D for C4 (as C2 is already requested and the target is the best utilization of the bandwidth).

D will request peer B for C1.

E will request peer C for C1.

Now, in the beginning A has nothing to upload. So, it will request for the chunks which has less number of downloading request. So, it should request C3 first as no other peer has requested for it. Now, both the peers C and D have the chunk C3. So, A will request that specific peer to which the P2P connection is stronger.

So, A will request for C3 from either C or D.

Please comment in case of any doubt.
Please upvote if this helps.

venereology answered 2 years ago

Consider the cross: A/a; b/b; C/c; D/d; E/e x A/a; B/b; c/c; D/d; e/e a) what...

Consider the cross: A/a; b/b; C/c; D/d; E/e x A/a; B/b; c/c; D/d; e/e a) what proportion of the progeny will phenotypically resemble the first parent? b) what proportion of the progeny will genotypically resemble neither parent?

A system has five workstations (A, B, C, D, and E) connected in sequence, with process...

A system has five workstations (A, B, C, D, and E) connected in sequence, with process times of 5, 10, 4, 9, and 8 seconds per unit each, respectively. Each workstation contains a single machine. 1. which workstation is the bottleneck of the system: a. Workstation A b. Workstation B c. Workstation C d. Workstation D 2. the system process time of this process is: a. 5.1 seconds b. 10 seconds c. 15 seconds d. 36 seconds 3. assume Workstation B now contains two machines, each of which can...

Consider the following relational schema and set of functional dependencies. S(A,B,C,D,E,F,G) D → E E →...

Consider the following relational schema and set of functional dependencies. S(A,B,C,D,E,F,G) D → E E → B C → FG BE → AC Is the decomposition of S into S1(E,G,F) and S2(A,B,C,D,G) a lossless join decomposition? Choose one of the following queries as your answer: SELECT ’lossy’; SELECT ’lossless’;

Given the following knowledge base: a <- b^c. b <- d^e. b <- g^e. c <-...

Given the following knowledge base: a <- b^c. b <- d^e. b <- g^e. c <- e. d. e. ƒ <- a^g. Which of the following would be the trace of resolved atoms assuming a bottoms-up proof procedure? Select one: a. {a,b,c,e,g} b. {a,b,c,e,d} c. {g,e,b,e,c,a} d. None of these options Constraint Satisfaction Problem (CSP) is consists of a set of _________________. Select one: a. Variables, heuristics, and solutions b. Variables, domains, and backtracking c. Variables, domains, and constraints d....

Let A = {a, b, c, d} and B = {b, d, e}. Write out all...

Let A = {a, b, c, d} and B = {b, d, e}. Write out all of the elements of the following sets. (a) B ∩ ∅ (b) A ∪ B (c) (A ∩ B) × B (d) P(A\B) (e) {X ∈ P(A) | |X| ≤ 3}

Consider the relation R= {A, B, C, D, E, F, G, H} and the set of...

Consider the relation R= {A, B, C, D, E, F, G, H} and the set of functional dependencies: FD= {{B}—> {A}, {G}—> {D, H}, {C, H}—> {E}, {B, D}—> {F}, {D}—>{C}, {C}—> {G}} 1) Draw FD using the diagrammatic notation. 2) What are all candidate keys for R? 3) If delete {C}—>{G} and change {C, H}—> {E} to {C, H}—> {E, G}, what are all candidate keys for R

MIPS a) Consider the C statement: a = (b + d) + (b - c) +...

MIPS a) Consider the C statement: a = (b + d) + (b - c) + (c + d) Which of the following assembly instructions can be used to replicate all or part of this statement in MIPS, without changing or reducing the equation. Assume variables a, b, c, and d are assigned to registers $s0, $s1, $s2 and $s3 respectively. 1. sub $t0, $s2, $s3 2. sub $t0, $s0, $s3 3. sub $t1, $s1, $s2 4. sub $t2, $s1,...

Find the proof of the following ((a ∧ b) ∨ (c ∧ d)), (a → e),...

Find the proof of the following ((a ∧ b) ∨ (c ∧ d)), (a → e), (b → f), (c → f), (d → e) ⊢ e

Consider a finite population with five elements labeled A, B, C, D, and E. Ten possible...

Consider a finite population with five elements labeled A, B, C, D, and E. Ten possible simple random samples of size 2 can be selected. 1. List the 10 samples beginning with AB, AC, and so on. 2. Using simple random sampling, what is the probability that each sample of size 2 is selected? 3. Assume random number 1 corresponds to A, random number 2 corresponds to B, and so on. List the simple random sample of size 2 that...

Consider the following relation R(A, B, C, D, E, G) and the set of functional dependencies...

Consider the following relation R(A, B, C, D, E, G) and the set of functional dependencies F={ A → BCD, BC → DE, B→D, D → A} Note: Show the steps for each answer. (a) Compute B+ . (b) Prove (using Armstrong’s axioms) that AG is superkey. (c) Compute Fc. (d) Give a 3NF decomposition of the given schema based on a canonical cover. (e) Give a BCNF decomposition of the given schema based on F. Use the first functional...

Question