1. Election AlgorithmsCS-4513 D-term 20081 Election Algorithms CS-4513 Distributed Computing Systems (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz, Galvin, & Gagne, Distributed Systems: Principles & Paradigms, 2 nd ed. By Tanenbaum and Van Steen, and Modern Operating Systems, 2 nd ed., by Tanenbaum)

2. Election AlgorithmsCS-4513 D-term 20082 Election Algorithms If we are using one process as a coordinator for a shared resource … …how do we select that one process? Often, there is no owner or master that is automatically considered as coordinator E.g., Grapevine, there is no owner for a Registry By contrast:–DNS has a master for every domain

3. Election AlgorithmsCS-4513 D-term 20083 Solution – an Election All nodes currently involved get together to choose a coordinator If the coordinator crashes or becomes isolated, elect a new coordinator If a previously crashed or isolated node, comes on line, a new election may have to be held.

4. Election AlgorithmsCS-4513 D-term 20084 Election Algorithms Wired systems Bully algorithm Ring algorithm Wireless systems Very large-scale systems

5. Election AlgorithmsCS-4513 D-term 20085 Bully Algorithm Assume All processes know about each other Processes numbered uniquely Suppose P notices no coordinator Sends election message to all higher numbered processes If none response, P takes over as coordinator If any responds, P yields …

6. Election AlgorithmsCS-4513 D-term 20086 Bully Algorithm (continued) … Suppose Q receives election message Replies OK to sender, saying it will take over Sends a new election message to higher numbered processes Repeat until only one process left standing Announces victory by sending message saying that it is coordinator

7. Election AlgorithmsCS-4513 D-term 20087 Bully Algorithm (continued)

8. Election AlgorithmsCS-4513 D-term 20088 Bully Algorithm (continued) … Suppose R comes back on line Sends a new election message to higher numbered processes Repeat until only one process left standing Announces victory by sending message saying that it is coordinator (if not already coordinator) Existing (lower numbered) coordinator yields Hence the term “bully”

9. Election AlgorithmsCS-4513 D-term 20089 Alternative – Ring Algorithm All processed organized in ring Independent of process number Suppose P notices no coordinator Sends election message to successor with own process number in body of message (If successor is down, skip to next process, etc.) Suppose Q receives an election message Adds own process number to list in message body …

10. Election AlgorithmsCS-4513 D-term 200810 Alternative – Ring Algorithm Suppose P receives an election message with its own process number in body Changes message to coordinator message, preserving body All processes recognize highest numbered process as new coordinator If multiple messages circulate … …they will all contain same list of processes (eventually) If process comes back on-line Calls new election

11. Election AlgorithmsCS-4513 D-term 200811 Ring Algorithm (continued) Coordinator=6

12. Election AlgorithmsCS-4513 D-term 200812 Ring Algorithm (continued) [2,3,4] [2,3,4,5] [5,6,0,1]

13. Election AlgorithmsCS-4513 D-term 200813 Ring Algorithm (continued) [5,6,0,1,2,3,4] [2,3,4,5] [1,2,3,4,5,6,0] [5,6,0,1,2] [2,3,4,5,6] [2,3,4,5,6,0] [5,6,0,1,2,3]

14. Election AlgorithmsCS-4513 D-term 200814 Ring Algorithm (concluded) [5,6,0,1,2,3,4] [1,2,3,4,5,6,0] Coordinator=6

15. Election AlgorithmsCS-4513 D-term 200815 Ring Algorithm (concluded) Suppose P receives an election message with its own process number in body Changes message to coordinator message, preserving body All processes recognize highest numbered process as new coordinator If multiple messages circulate … …they will all contain same list of processes (eventually) If process comes back on-line Calls new election

16. Election AlgorithmsCS-4513 D-term 200816 Questions?

17. Election AlgorithmsCS-4513 D-term 200817 Wireless Networks Different assumptions Message passing is less reliable Network topology constantly changing Expanding ring of broadcast Election messages Decision rules for when to yield Not very well developed. Topic of current research

18. Election AlgorithmsCS-4513 D-term 200818 Very Large Scale Networks Sometimes more than one node should be selected Nodes organized as peers and super-peers Elections held within each peer group Super-peers coordinate among themselves

19. Election AlgorithmsCS-4513 D-term 200819 Reading Assignment Tanenbaum & van Steen (2 nd ed.) §6.5.2 – Elections in Wireless Systems §6.5.3 – Elections in Large Scale Systems Potential topics for quiz or test!

20. Election AlgorithmsCS-4513 D-term 200820 Digression Domain Name Service

21. Election AlgorithmsCS-4513 D-term 200821 DNS Maps names of the form www.cs.wpi.edu to IP addresses Maps aliases to names Maps mailbox requests to names Maps service requests to names Maps IP addresses to names I.e., reverse mapping

22. Election AlgorithmsCS-4513 D-term 200822 DNS Naming Hierarchy

23. Election AlgorithmsCS-4513 D-term 200823 Resolving DNS names to IP addresses Two approaches:– –Iterative –Recursive

24. Election AlgorithmsCS-4513 D-term 200824 Iterative Resolution of Names

25. Election AlgorithmsCS-4513 D-term 200825 Recursive Resolution of Names

26. Election AlgorithmsCS-4513 D-term 200826 DNS Domain Registry Database Text file containing records Each record is {Name, Type, value(s)}

27. Election AlgorithmsCS-4513 D-term 200827 Example

28. Election AlgorithmsCS-4513 D-term 200828 DNS Implementation One master copy per domain or subdomain Edited manually by system administrator –Using text editor or GUI tool Multiple slave copies Automatically copied / updated periodically from master Stored in file on slave server, reloaded up restart Caching in DNS clients Lots and lots of caching Entries include TTL (time-to-live) specification

29. Election AlgorithmsCS-4513 D-term 200829 Implementation in Linux/Unix BIND — Berkeley Internet Name Domain http://www.bind9.net/ named — the Name Daemon –Implements local DNS service –Multiple databases Primary or secondary Secondary database points back to primary –Pointer to “higher level” service For resolving names not in own database

30. Election AlgorithmsCS-4513 D-term 200830 Example Want to find www.cs.wpi.edu My DNS contacts DNS server 68.87.71.226 A Comcast server specified in my DHCP lease Comcast DNS service Almost certainly has root (global) domain in cache Probably has many.edu entries in cache (very large) Possibly has.wpi.edu in cache (many local users) May have.cs.wpi.edu Consults cache or official server for IP address nslookup

31. Election AlgorithmsCS-4513 D-term 200831 Example (continued) C:\>nslookup cs.wpi.edu Server: cns.chelmsfdrdc2.ma.boston.comcast.net Address: 68.87.71.226 Non-authoritative answer: Name: cs.wpi.edu Address: 130.215.28.181

32. Election AlgorithmsCS-4513 D-term 200832 Some Special Cases Google Yahoo MSN Need to distribute names geographically Need to distribute different addresses for same name Special handling of replicated databases More (perhaps) later in term

33. Election AlgorithmsCS-4513 D-term 200833 Naming Privacy Problem:– corporations need to have own domains www.merl.com Some public hosts – mail server, web server, etc. Does not want to expose names of internal hosts to outside world E.g., proprietary stuff But wants to make them visible internally hotspur.merl.com

34. Election AlgorithmsCS-4513 D-term 200834 Solution Two name services for same domain name! Internal External External — visible to Internet (DMZ) Database contains only a few names Points to other internet DNS’s for resolution of internet names Internal — seen only by internal hosts Database contains all internal names Points to external version for resolution of internet names

35. Election AlgorithmsCS-4513 D-term 200835 Result Internal names can be resolved internally, not externally hotspur.merl.com Internal names and IP addresses are invisible on Internet All external names can be resolved internally Two levels of indirection

36. Election AlgorithmsCS-4513 D-term 200836 Questions?