Many tasks in networks require server processes to offer services, mostly by providing or manipulating distributed data. In order to avoid the serious consequences of the failure of such a process, it must be possible that another process takes over the role of the server. For this, it is necessary that the processes involved agree as to which of them should play this role. So there arises the problem of electing a leader, Election for which some algorithms are presented in this chapter that solve the problem for circular graphs, i.e., those graphs that have the form of a ring. Ring In conjunction with our ring construction from the previous chapter, the problem can in principle be solved for any graph.