Asymmetric Blind Rendezvous Algorithms

Abstract

In this chapter, we present asymmetric algorithms for the blind rendezvous problem. In the settings, we fix Alg as:

(6.1)

where $Time \in \{Syn, Asyn\}$, $Port \in \{Port-S, Port-AS\}$, and $ID \in \{Non-Anon, Anon\}$. Although there are eight different rendezvous settings when Alg is fixed as asymmetric and Label fixed as non-oblivious, in designing asymmetric algorithms, users’ ID do not matter much. This is because the users’ IDs are typically used to break symmetry in distributed computing, but we already assume the users can be distinguishable and they execute different algorithms. Therefore, we present how to design efficient algorithms for the four rendezvous settings (synchronous and port-symmetric, asynchronous and port-symmetric, synchronous and port-asymmetric, asynchronous and port-asymmetric), no matter the choice of ID from $\{Non-Anon, Anon\}$. In Sect. 6.1, we present two different types of rendezvous algorithms for the synchronous and port-symmetric rendezvous setting, and these algorithms are extended for the asynchronous and port-symmetric rendezvous setting in Sect. 6.2. In Sects. 6.3 and 6.4, we introduce efficient algorithms for the synchronous, port-asymmetric and asynchronous, port-asymmetric rendezvous settings. Finally, we summarize the chapter in Sect. 6.5.