Merging of TOSCA Cloud Topology Templates - IAAS

More documents

Recommendations

Info

3 Related Work tive algorithm with pruning if its recursion tree reaches a specified size, a process heuristic algorithm that is a deviation of the exhaustive algorithm with consideration of the relative position of nodes and finally a variation of the A-Star heuristic search algorithm. Although the proposed algorithms in [13] cannot be directly used in this thesis, it can be noted that generating a mapping between nodes of two graphs is a problem of high time complexity and either heuristic measures or restricting assumptions have to be applied to decrease problem space. Pottinger and Bernstein [38] examine the generic merging of two models such as UML, ontology models or database schemata. They also use the notion of correspondences between two models. The correspondences are assumed to be given and their generation is not further discussed in their work. The contributed merge operator returns a “duplicate-free union” of the two mapped input models. Arising conflicts consisting of so-called representation, metamodel and fundamental conflicts are identified and resolution strategies are provided. The introduced approach provides Generic Merge Requirements such as element preservation, equality preservation and relationship preservation that are adopted in this work. Küster et al. [24] contribute an approach to merging of business process models in absence of a change log. A copied and altered version of the original process model is to be merged with the original one. Differences between the models have to be detected as there is no change log that describes the carried out changes. The differences are resolved requiring some manual aid by a domain expert. Their work makes also use of the concept of correspondences and enriches them with the technique of Single-Entry-Single-Exit fragments (SESE fragments). As Topology Templates do not contain block-structured SESE fragments as a business process this approach is not suitable for this work, however, the notion of correspondences is picked up. Merging of Petri Nets Sun et al. [46] describe an approach for merging process models described by Petri nets. They introduce the concept of Merge points, i.e. place nodes in in both Petri nets that are mapped on each other. However, a method to find matching places in a Petri net and thus construct a mapping is not provided. Subsequently so-called merge patterns are applied to merge both process models. Therefore a domain expert must provide input how the places and transitions between two merge points, i.e. a starting and an ending Merge point have two be merged. Possible patterns the expert can choose from are Sequential, Parallel, Conditional and Iterative merge. The discussed approach is not suitable for our work as it only works for block-structured workflows and not for general graphs. Moreover too much additional manual input is required. Graph Transformations Segura et al. [45] introduce a completely different approach to the merging problem than those discussed before. The application domain is the merging of Feature Models in the context of Software Product Lines. Feature Models represent the features of the software products in a Software Product Line as a tree-like structure. The authors use Graph Transformations to merge two Feature Models. They present a catalogue of 30 merge rules consisting of two input patterns (subgraphs) and a corresponding output pattern. The input patterns 24
3 Related Work are called left-hand side and the output patterns right-hand side. The rules are implemented in the Attributed Graph Grammar System (AGG), a free Java tool for Graph Transformations. Graph Transformations are also used by Gala et al. [16] to merge the navigation histories of web site users to utilize them for Web Mining. Web sites and the interactions and navigations with the websites are modeled as so-called semistructured temporal graphs and merged to a summarizing graph structure using Graph Transformations. A web site’s objects are represented by the nodes of the graph, the navigational links by edges. The navigation of a user during a session is also a semistructured temporal graph that forms a sequence of nodes through the web site graph. Each node in a web site and the navigation graph is annotated with a temporal element (hence the label temporal) indicating either the temporal validity of a web site object in case of the web site graph or the visiting and retention time of the navigation graph. The authors define one Graph Transformation rule merging each node with the same object id unifying their temporal elements. The corresponding edges are collapsed to the merged node. Both Graph Transformation approaches are not directly comparable to our approach, but they are either limited to special graph structures such as trees in case of [45] or narrowly specialized for a particular application domain like [16]. However, the notion of left-hand side and right-hand side can also be used in context of this work to refer to the elements being involved in the matching and merging. 25
Page 1: Institute of Architecture of Applic
Page 5 and 6: Contents Contents 1 Introduction...
Page 7 and 8: List of Figures List of Figures Fig
Page 9 and 10: List of Listings List of Listings L
Page 11 and 12: List of Tables List of Tables Table
Page 13: List of Abbreviations SaaS SAX SESE
Page 16 and 17: 1 Introduction Not in the scope of
Page 18 and 19: 1 Introduction Chapter 6 - Concept
Page 20 and 21: 2 Fundamentals arcs = (, ) and =
Page 22 and 23: 2 Fundamentals bination with a publ
Page 24 and 25: 2 Fundamentals Syntax of the XML co
Page 26 and 27: 2 Fundamentals Additional Relations
Page 28 and 29: 2 Fundamentals However, the TOSCA P
Page 30 and 31: 2 Fundamentals 2.4 Frameworks The f
Page 32 and 33: 2 Fundamentals Framework class usin
Page 34 and 35: 2 Fundamentals Code example for a c
Page 36 and 37: 3 Related Work 3 Related Work The f
Page 40 and 41: 4 Assumptions and Requirements for
Page 46 and 47: 5 Concept for Matching of Topology
Page 88 and 89:
5 Concept for Matching of Topology
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
6 Concept for Merging of Topology T
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
7 Architecture & Design of an Exten
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
8 Implementation of the Framework (
Page 148 and 149:
8 Implementation of the Framework F
Page 150 and 151:
8 Implementation of the Framework a
Page 152 and 153:
8 Implementation of the Framework 8
Page 154 and 155:
9 Evaluation of the Algorithms and
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
10 Conclusion and Future Work 10 Co
Page 164 and 165:
Bibliography Bibliography [1] Amazo
Page 166 and 167:
Bibliography [28] S. Melnik, H. Gar
Page 168:
Erklärung Hiermit erkläre ich, da
show all

Merging of TOSCA Cloud Topology Templates - IAAS

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?