Call/WhatsApp/Text: +44 20 3289 5183

Question: Define a precedence relation by which two events that occur during a distributed computation may be ordered

21 Oct 2022,1:09 AM

 

Question 1

  1. Define a precedence relation by which two events that occur during a distributed computation may be ordered. [6 marks]
  2. Describe the wave algorithm for trees. Indicate the diffusion part of the algorithm.                 [10 marks]
  3. Suppose that four processes, namely p, q, r, and s, form a tree with p as the root and execute the wave algorithm. The figure below depicts the tree. At some time, say, T during an execution of the algorithm, the only message that is in transit in the entire system is the token sent by p to r. (The figure also portrays this situation at time T.)

 

 

 

    1. Assume that no process has decided at time T. Describe an execution that could have taken place until time T and, ignoring the diffusion part of the algorithm, show how the execution continues until two processes decide.

[14 marks]

    1. Investigate whether any process could have decided before time T, given that the token from p to r is the only message in transit at time T. Ignore the diffusion part in your investigation.      [14 marks]

Hint: A possible line of investigation is to consider that the token from p to r takes a long transmission time, much longer than the time the token from r may take to reach p.

 
  1. Your colleague, Mr Paul Errorprone, claims that processes p and q decide in his answer to part i) of c). Explain to Paul that his answer cannot be correct.                       [6 marks]

 

Question 2

  1. What are the assumptions normally made on the Trusted Third Party (TTP) of a fair-exchange protocol? How are the fair-exchange protocols classified based on the manner they use the TTP? [10 marks]
  2. Presented below are the five steps of a protocol P which a player A uses to send a digital item M to another player B and to obtain a non-repudiation of receipt (NRR) from B. Show that P cannot be fair and fix all its flaws so that P becomes fair.                           [18 marks]

 

A ® TTP:   (A, B);

(* A informs TTP of its fair-exchange partner*)

TTP ® A:

(A, B, TTP,

K, EOO);

A ® B:

MA = {eK(M),

SigA(H(eK(M))};

B ® TTP:

SigB(H(MA));

 

TTP ® B:

(A, B, TTP,

K, EOO);

TTP ® A:

SigB(H(MA));

 

Notations used bear their conventional meaning:

  • SigA(F) is the unique and verifiable signature of A for message F;
  • eK(F) is the encryption of F with key K;
  • H is a one-way and collision-resistant hash function; and,
  • EOO (Evidence Of Origin) is SigTTP(A, B, TTP, K).

 

 

 

 

Page 3 of 4

 
  1. Consider a transaction involving objects hosted in two servers, S1 and S2. At the end of the transaction, two-phase commit protocol is executed with the client C acting as the coordinator. Suppose that C crashes before it completes its execution of the protocol and that S1 and S2 do not crash.
    1. Describe an execution in which S2 decides on commit and S1 remains blocked (i.e., remains undecided) until C recovers from its crash.                   [8 marks]
    2. Describe an execution in which S2 decides without entering the second phase and S1 remains blocked until C recovers from its crash.                   [6 marks]
  2. It was discussed in the lectures that an execution of the two- phase commit protocol is guaranteed to terminate only if there exists a moment when all crashed nodes have recovered and nodes do not crash thereafter. Justify this termination requirement by producing an execution in which the coordinator and one server never stop crashing, i.e., keep crashing after each recovery, and the server never decides.                     [8 marks]

Expert answer

 

A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time.

 

A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time.A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time. A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time.

 

A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time. A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time.

 

A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time. A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time.

Stuck Looking For A Model Original Answer To This Or Any Other
Question?


Related Questions

What Clients Say About Us

WhatsApp us