Topics – Peer-to-peer Computing, Mutual Exclusion, Authentication

CS 610 Advanced Concepts in Operating Systems March 14, 2024 Computer Science Department Professor Jayantha Herath General Procedures Total for this is 50 points Answer all the questions All answers should be in this booklet Read each problem before starting to answer it. Your answers should be brief and complete. Your name: 1. Consider a Chord system with 32 nodes, specifically nodes at positions 5, 10, 12, 20, and 25. Using the function 𝐹𝑇𝑝 [𝑖] = succ(𝑝 + 2𝑖−1 )mod 32 Where 𝐹𝑇𝑝 [𝑖] represents the i-th entry of node p’s finger table, construct the finger tables for these nodes. The i-th entry should point to the first node that succeeds p. Identify the successor and predecessor for the key 14, starting from node 5. If node 17 were to join the network, how would its finger table appear? What modifications would this cause to the other finger tables? 2. Discuss the centralized, token ring, and tree algorithms that distributed systems use to achieve Mutual Exclusion. Provide illustrative examples to demonstrate how these algorithms operate. Compare these algorithms in terms of their efficiency, complexity, and robustness. 3. Provide an in-depth explanation of the Kerberos system. Use diagrams and crypto expressions to demonstrate the process of message passing within the system. Ensure to include illustrative examples to emphasize key stages in the process.