HI ,plz can you help me to find the answer for these question . 1) Under what ci

Question

HI ,plz can you help me to find the answer for these question .

1) Under what circumstances might and RPC-based program be less efficient than a

carefully optimized message-based program?

2) If the caller machine (client) in an RPC crashes while waiting for a reply, we say that the computation which was initiated on the callee machine is an "orphan". Properly terminating orphan computations is called the orphan elimination problem. What sort of issues makes orphan elimination difficult in RPC systems?

3) describe key exchange between two user using public keys and explain why it is vulnerable to meet-in-the-middle attack?

4) In a chord system, if a node is inserted, is it necessary to update all the finger tables instantly?

thanx.

Explanation / Answer

1)
Message based program allows to send all data in single payload and able to finish in one call. So there is no need to wait. In this
situation it is better.

2)
orphan has to be filled by our own when Rpc is added. we have to look into log file and delete explicitly orphans. So number of Rpc
entered..every time we have to check which increases cost. sometimes locating them also may get difficult.

3)
yeah public key algorithm is vulnerable in meet in the middle attack if you used plaintext which is known one. So at that moment we
can able to know plain text even we may not know public key

4)
not always...if we insert node is inserted at correct place no need to update..otherwise if node is added to node3..but node3 already knows
it must connect node4 previously. In such situations it must update the finger tables.

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.