n log n algorithm for leader election using probe messages

1. O(n log n ) Algorithm for Asynchronous leader
election

2. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
10,0,1
reply
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
22,0,1
10,0,1
22,0,1
11,0,111,0,1
66,0,166,0,1
50,0,150,0,1
44,0,144,0,1

3. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
10,0,1
reply
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
22,0,1
10,0,1
22,0,1
11,0,111,0,1
66,0,166,0,1
50,0,150,0,1
44,0,144,0,1

4. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
10,0,1
reply
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
22,0,1
10,0,1
22,0,1
11,0,1
66,0,1
66,0,1
50,0,1
50,0,1
44,0,1
44,0,1

5. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
22,0,1
22,0,1
11,0,1
66,0,1
66,0,1
50,0,1
50,0,1
44,0,1
44,0,1
22,0
22,0

6. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
11,0,1
66,0,1
66,0,1
50,0,1
50,0,1
44,0,1
44,0,1

7. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
66,0,1
66,0,1
50,0,1
50,0,1
44,0,1
44,0,1
66,0
66,0

8. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
50,0,1
50,0,1
44,0,1
44,0,1
44,0

9. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
44,0,1
44,0,1

10. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe

11. O(n log n ) Algorithm for Asynchronous leader
election
10
22
11
66
44
50
Id, phase
number
K- Neighbourhood. Processors at distance K ,
K = 0,1,2,3…
Hop (d) or distance : Distance at which we will ping
processor
id, phase , distance probe
66,0,1
66,0,1

13. O(n log n ) Algorithm for Asynchronous leader
election

14. • https://www.youtube.com/watch?v=Ej4q4Bx4-go