A Eulerian Approach to the Analysis of Rendez-Vous Algorithms