TY - GEN
T1 - DCMA
T2 - 7th Web Information Systems and Applications Conference, WISA 2010, 5th Workshop on Semantic Web and Ontology, SWON 2010, 4th Workshop on Electronic Government Technology and Application, EGTA 2010
AU - Wang, Botao
AU - Tan, Xianting
AU - Kisturegawa, Masaru
AU - Wang, Guoren
AU - Wang, Li
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/78049496560
U2 - 10.1109/WISA.2010.30
DO - 10.1109/WISA.2010.30
M3 - Conference contribution
AN - SCOPUS:78049496560
SN - 9780769541938
T3 - Proc. - 7th Web Information Systems and Applications Conference, WISA 2010, Workshop on Semantic Web and Ontology, SWON 2010, Workshop on Electronic Government Technology and Application, EGTA 2010
SP - 160
EP - 165
BT - Proc. - 7th Web Information Systems and Applications Conference, WISA 2010, Workshop on Semantic Web and Ontology, SWON 2010, Workshop on Electronic Government Technology and Application, EGTA 2010
Y2 - 20 August 2010 through 22 August 2010
ER -