![](bga.png)
in turn, can delete a WS from a community or make
its operations temporarily unavailable. Thus, authors
propose a P2P approach to manage these changes.
However, their operations are described informally
compared to our management operations.
In (Maamar et al., 2009), Maamar et al. discuss
the dynamic nature of WS community and focus on
potential conflicts. They propose in (Subramanian
et al., 2007) an approach to engineer WSs commu-
nities in order to reconcile these potential conflicts.
This approach is based on the Community develop-
ment protocol which is interested in managing com-
munities in term of attracting and retaining WSs, cre-
ating and dismantling communities. Similarly to our
approach, communities are organized according to
WSs functionalities. However, this approach did not
propose a model and their operation descriptions are
rather informal.
7 CONCLUSIONS
In this paper, we proposed an approach for manag-
ing communities of WSs registries. We first defined
a model to facilitate the managing step. Then we
identified the main steps of registry and community
life-cycles. Afterwards, we specified managing op-
erations and algorithms based on the model that we
have proposed. Finally, we implemented a Commu-
nity Manager to test and validte these algorithms and
operations using graph simulation. Experiments show
that our algorithms and managing operations execute
well. The splitting operation has not been tested since
its pre-condition is not yet specified. Indeed, we used
different methods to detect the sparsity criterion in a
given community such as standard deviation of a stat-
ical series but each one represents an exception. As
part of our short term perspectives, we plan to specify
a pertinent pre-condition for splitting operation. Fur-
thermore, we foresee to implement these algorithms
on top of the platform P2P JXTA (JXTA, 2004) in or-
der to test the precision/time ratio of our approach.
REFERENCES
Benatallah, B., Sheng, Q. Z., and Dumas, M. (2003). The
self-serv environment for web services composition.
IEEE Internet Computing, 7:40–48.
Bondy, J. A. and Murty, U. S. R. (2007). Graph Theory.
Springer London.
Chabeb, Y., Tata, S., and Ozanne, A. (2010). Yasa-m: A se-
mantic web service matchmaker. In AINA 2010, April
20-23, Perth, Australia.
Ding, C. H. Q., He, X., Zha, H., Gu, M., and Simon, H. D.
(2001). A min-max cut algorithm for graph partition-
ing and data clustering. In ICDM ’01, pages 107–114,
Washington, DC, USA. IEEE Computer Society.
Jgrapht (2003). Jgrapht. http://www.jgrapht.org/.
http://www.jgrapht.org/.
JXTA (2004). Jxta. https://jxta.dev.java.net/.
Lausen, H. and Farrell, J. (2007). Semantic annota-
tions for WSDL and XML schema. W3C recom-
mendation, W3C. http://www.w3.org/TR/2007/REC-
sawsdl-20070828/.
Maamar, Z., Lahkim, M., Benslimane, D., Thiran, P., and
Sattanathan, S. (2007). Web services communities -
concepts & operations -. In WEBIST’2007.
Maamar, Z., Sattanathan, S., Thiran, P., Benslimane, D.,
and Bentahar, J. (2009). An approach to engineer
communities of web services - concepts, architecture,
operation, and deployment. IJEBR, 9(4).
McConnell, J. J. (2008). Analysis of algorithms: an active
learning approach. Jones and Bartlett publishers.
Medjahed, B. and Bouguettaya, A. (2005). A dynamic
foundational architecture for semantic web services.
Distributed and Parallel Databases, 17(2):179–206.
Paik, H.-Y., Benatallah, B., and Hamadi, R. (2002). Dy-
namic restructuring of e-catalog communities based
on user interaction patterns. World Wide Web,
5(4):325–366.
Paik, H.-Y., Benatallah, B., and Toumani, F. (2005). Toward
self-organizing service communities. IEEE Trans-
actions on Systems, Man, and Cybernetics, Part A,
35(3):408–419.
Sellami, M., Bouchaala, O., Gaaloul, W., and Tata, S.
(2010a). WSRD: A web services registry description.
In NOTERE’10, May 31- June 2, Tozeur, Tunisia.
Sellami, M., Gaaloul, W., and Tata, S. (2010b).
Functionality-driven clustering of web service reg-
istries. In SCC 2010, Miami, Florida, USA.
Sellami, M., Gaaloul, W., Tata, S., and Jmaiel, M. (2010c).
Using recommendation to limit search space in web
services discovery. In AINA, pages 974–981. IEEE
Computer Society.
Sivashanmugam, K., Verma, K., and Sheth, A. P. (2004).
Discovery of web services in a federated registry en-
vironment. In ICWS’04, San Diego, California, USA,
pages 270–278. IEEE Computer Society.
Subramanian, S., Thiran, P., Maamar, Z., and Benslimane,
D. (2007). Engineering communities of web services.
In Kotsis, G., Taniar, D., Pardede, E., and Ibrahim,
I. K., editors, iiWAS, volume 229 of books@ocg.at,
pages 57–66. Austrian Computer Society.
Xu, B. and Chen, D. (2007). Semantic web services dis-
covery in p2p environment. In ICPPW ’07, page 60.
IEEE Computer Society.
Zhang, H. and Shin, D.-G. (2005). Objective function based
fuzzy clustering. Technical report, University of Con-
necticut.
WEBIST 2011 - 7th International Conference on Web Information Systems and Technologies
70