DCMA: Dynamic Cycle Matching Algorithm for Homogeneous Symmetric Pub/Sub System

In this paper we consider the problem of cycle matching for homogeneous symmetric publish/subscribe system. In this kind of applications, besides one-to-one swap, exchange can occur between more than two subscriptions, which is called cycle matching. The cycle matching provides more exchange candidates for users to choose, therefore improves the number of successful exchanges. As far as we know, there is only few work on cycle matching, which is focusing on finding cycle matchings with high quality based on a pre-built graph. There, how to find cycle matchings dynamically, which is essential for most of applications, is neglected. In this paper, we propose a dynamic cycle matching algorithm to find cycle matchings dynamically. We first present a cycle matching model, then propose the dynamic cycle matching algorithm. We prove that the algorithm can work correctly without duplication and loss of results. Our proposal is evaluated in a simulated environment. The results show that, our proposal has good scalability and maintenance performance.