distributed system

1. How does the Byzantine generals problem relate to concurrency in distributed systems? 14
2. How is mutual exclusion implemented in NFS?

3. What is the job of the recovery manager in distributed transaction models?
4. Name three challenges of mobile computing in today’s highly connected network

5. Describe atomicity in transactions and how it is important?
6. In what ways has network transparency and the evolution of the modern day internetwork directly conflicted with security models and the protection of computing assets?
7. Explain the concept of mutual exclusion as it applies to distributed systems
8. Explain what techniques have enabled multimedia services to deliver high density content on small form wireless devices?
9. Name three negative effects of the atomic transaction model
10. Explain the challenges (2) of maintaining time in a distributed system
11. Discuss the differences between a logical and regular clocks and under what conditions might you implement a logical clock?
12. What value does a unified naming service bring to distributed systems?
13. Explain what three features of DNS have sustained the massive growth of the internet (efficiency aspects)?
14. How can the IAAS (Infrastructure as a Service) implementations of compute resources in AWS benefit distributed systems with respect to process invocation, file access and relational database access? What are some points of contention about deployment in AWS?
15. Explain the steps required to implement the mousetrap extra credit problem “Connect the Chain” beyond the 4 leg mousetrap basic setup (I am looking for what resources would be required, where and what things must change in the mousetrap to accomplish this)

16. Explain the differences between symmetric and asymmetric keys

Secret Key (Symmetric) Algorithms-method for encrypted transmissions where the same key Is used on both ends of the transmission – while effective does not lend itself well to general use due to the distance between endpoints and the method to acquire the keys

Public Key (Asymmetric) Algorithms – method for encrypted transmissions where different (Public/Private) keys are used at the endpoints – key sizes allow for stronger (not guessable by reason of number of possible values) at a slight cost of performant

17. What are the primary differences between standby and active replication models as it applies to distributed systems?
18. What is the purpose of the replication agent in both standby and active high availability strategies?
19. What are the main differences between singular and two phase atomic commit protocols?
20. What is the virtual filesystem