Abstract
Deployment patterns have been proposed as a mechanism to support the provisioning of SOA-based services. Deployment patterns represent the structure and constraints of composite solutions, including non-functional properties, such as performance, availability, and security, without binding to specific resource instances. In previous work [1], we have presented a formal mechanism for capturing such service deployment patterns using models. Our pattern models define abstract connectivity and configuration requirements which are then realized by an existing or planned infrastructure. Realization mapping is used to enforce policies, and is materialized at deployment time. In this paper we extend that work to address the problem of automatic pattern realization over a given infrastructure. We first formalize the problem and present three variations of increasing power and complexity. We then present a variation of a search-based graph isomorphism algorithm with extensions for our pattern model semantics. Next, we show that our worst-case exponential complexity algorithm performs well in practice, over a number of pattern and infrastructure combinations. We speculate that this is because deployment topologies represent heavily labeled and sparse graphs. We present a number of heuristics which we have compared experimentally, and have identified one which performs best across most scenarios. Our algorithm has been incorporated into a large deployment modeling platform, now part of the IBM Rational Software Architect (RSA) tool [2].
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Arnold, W., Eilam, T., Kalantar, M., Konstantinou, A., Totok, A.: Pattern based SOA deployment. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 1–12. Springer, Heidelberg (2007)
IBM: Rational Software Architect for WebSphere Software (RSA) V7.5 (September 2008)
Mehra, P.: Global deployment of data centers. IEEE Internet Computing 6(5) (September 2002)
Brown, A.B., Keller, A., Hellerstein, J.: A model of configuration complexity and its applications to a change management system. In: Integrated Management (2005)
Bossardt, M., Mühlemann, A., Zürcher, R., Plattner, B.: Pattern based service deployment for active networks. In: ANTA (2003)
Ludwig, H., Gimpel, H., Dan, A., Kearney, B.: Template based automated service provisioning supporting the agreement driven service life-cycle. In: Benatallah, B., Casati, F., Traverso, P. (eds.) ICSOC 2005. LNCS, vol. 3826, pp. 283–295. Springer, Heidelberg (2005)
Redlin, C., Carlson-Neumann, K.: WebSphere Process Server and WebSphere Enterprise Service Bus deployment patterns. Technical report, IBM (November 2006)
IBM: WebSphere Process Server (WPS) V6.1 (2007)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)
Messmer, B.T.: Efficient Graph Matching Algorithms. PhD thesis, University of Bern, Switzerland (November 1995)
IBM: Tivoli Provisioning Manager, TPM (2006)
El Maghraoui, K., Meghranjani, A., Eilam, T., Kalantar, M., Konstantinou, A.: Model driven provisioning: Bridging the gap between declarative object models and procedural provisioning tools. In: van Steen, M., Henning, M. (eds.) Middleware 2006. LNCS, vol. 4290, pp. 404–423. Springer, Heidelberg (2006)
Keller, A., Hellerstein, J., Wolf, J., Wu, K.L., Krishnan, V.: The CHAMPS system: change management with planning and scheduling. In: NOMS. IEEE Press, Los Alamitos (2004)
Corneil, D., Gotlieb, C.: An efficient algorithm for graph isomorphism. Journal of the ACM 17, 51–64 (1970)
Ullman, J.: An algorithm for subgraph isomorphism. Journal of the ACM 23(1), 31–42 (1976)
Gati, G.: Further annotated bibliography on the isomorphism disease. Journal of Graph Theory, 96–109 (1979)
Kitchen, L., Rosenfeld, A.: Discrete relaxation for matching relational structures. IEEE Transactions on Systems, Man, and Cybernetics 9(12), 869–874 (1979)
Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Hoffman, C.: Group-Theoretic Algorithms and Graph Isomorphism. Springer, Heidelberg (1982)
Kim, W., Kak, A.: 3-D object recognition using bipartite matching embedded in discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) 13, 224–251 (1991)
Tsai, W., Fu, K.: Error-correcting isomorphisms of attributed relational graphs for pattern recognition. IEEE Trans. on Sys., Man, and Cybernetics 9, 757–768 (1979)
De Jong, K., Spears, W.: Using genetic algorithms to solve NP-Complete problems. In: Schaffer, J.D. (ed.) Genetic Algorithms, pp. 124–132. Morgan Kaufmann, San Francisco (1989)
Abrams, S., Bloom, B., Keyser, P., Kimelman, D., Nelson, E., Neuberger, W., Roth, T., Simmonds, I., Tang, S., Vlissides, J.: Architectural thinking and modeling with the Architects’ Workbench. IBM Systems Journal 45(3) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arnold, W., Eilam, T., Kalantar, M., Konstantinou, A.V., Totok, A.A. (2008). Automatic Realization of SOA Deployment Patterns in Distributed Environments. In: Bouguettaya, A., Krueger, I., Margaria, T. (eds) Service-Oriented Computing – ICSOC 2008. ICSOC 2008. Lecture Notes in Computer Science, vol 5364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89652-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-89652-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89647-0
Online ISBN: 978-3-540-89652-4
eBook Packages: Computer ScienceComputer Science (R0)