Adaptive Distributed b-Matching in Overlays with Preferences
An important function of overlay networks is the facilitation of connection, interaction and resource sharing between peers. The peers may maintain some private notion of how a “desirable” peer should look like and they share their bounded resources with peers that they prefer better than others. Recent research proposed that this problem can be modeled and studied analytically as a many-to-many matching problem with preferences. The solutions suggested by the latter proposal guarantee both algorithmic convergence and stabilization, however they address static networks with specific properties, where no node joining or leaving is considered. In this paper we present an adaptive, distributed algorithm for the many-to-many matching problem with preferences that works over any network, provides a guaranteed approximation for the total satisfaction in the network and guarantees convergence. In addition, we provide a detailed experimental study of the algorithm that focuses on the levels of achieved satisfaction as well as convergence and reconvergence speed. Finally, we improve, both for static and dynamic networks, the previous known approximation ratio.
KeywordsNetwork Size Match Problem Overlay Network Preference Change Preference List
Unable to display preview. Download preview PDF.
- 3.Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 131–140. ACM (2009)Google Scholar
- 8.Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 980–989. ACM (2006)Google Scholar
- 9.Hoepman, J.H.: Simple distributed weighted matchings. CoRR cs.DC/0410047 (2004)Google Scholar
- 10.Lotker, Z., Patt-Shamir, B., Rosen, A.: Distributed approximate matching. In: PODC 2007: Proceedings of the Twenty-sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 167–174. ACM (2007)Google Scholar
- 13.Lotker, Z., Patt-Shamir, B., Pettie, S.: Improved distributed approximate matching. In: SPAA 2008: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, pp. 129–136. ACM (2008)Google Scholar
- 18.Georgiadis, G., Papatriantafilou, M.: Overlays with preferences: Approximation algorithms for matching with preference lists. In: Proceedings of 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010). IEEE Computer Society Press (April 2010)Google Scholar
- 20.Georgiadis, G., Papatriantafilou, M.: Adaptive distributed b-matching in overlays with preferences. Technical report, Chalmers University of Technology (March 2012)Google Scholar
- 22.Jelasity, M., Montresor, A., Jesi, G.P., Voulgaris, S.: The Peersim simulator, http://peersim.sf.net