Analysis of a Randomized Dynamic Timetable Handshake Algorithm
Résumé
In this paper we introduce and study a handshake algorithm based on random delays. This algorithm can also be considered as a probabilistic distributed algorithm to find a (maximal) matching. Each process of the network generates a random time, chosen uniformly in the real interval [0,1] for each of its neighboring processes. The generated number is supposed to be a possible time for a handshake, if both processes are available at that time. Initially the number of potentially possible times proposed by the processes is twice the number of links between them. Whenever the clock reaches the smallest generated item, there will be a handshake between the process that proposes this time and the requested process and they cancel all other data from their timetable, informing their other neighboring processes, which in turn remove the times proposed by the two processes. The process continues in the remaining processes equipped with the updated timetable until the unit time 1 has expired. This algorithm is substantially more efficient than previous ones known to us, in that the expected number of handshakes per round is larger.