Merging of TOSCA Cloud Topology Templates - IAAS

More documents

Recommendations

Info

4 Assumptions and Requirements for Matching and Merging 4 Assumptions and Requirements for Matching and Merging As already pointed out in chapter 2.4, this master’s thesis will follow the high-level approach of graph and schema merging. The fundamental steps are graph matching to find a set of correspondences, called a mapping, and then utilize these correspondences to unify the source and the target elements. Section 4.1 states all the assumptions that are made with regard to merging and matching. Section 4.2 discusses the requirements for the concepts of matching and merging and the algorithms implementing them. 4.1 Assumptions The following section discusses the assumptions made for this thesis. The assumptions delineate the scope of the thesis and exclude elements that would go beyond it. Assumption 1: Matching and merging of two Topology Templates This master’s thesis only considers the matching and merging of two Topology Templates. The consideration of more than two Topology Templates at once is beyond the scope. Assumption 2: Equality of TOSCA elements is indicated by their qualified name Node Types are considered equal if their id attributes have identical values and their namespaces are identical. Assumption 3: Only exact matching of Node Templates and Relationship Templates. This work only considers exact matches between Node Templates. Therefore, similarity scoring techniques such as edit distance on the Node Type or Node Template ids or names to rate the similarity in an interval between 0 and 1 are not used. The similarity used in this thesis only has the discrete values 1 and 0 indicating full correspondence or none at all. The same holds true for Relationship and Group Templates. Assumption 4: Only 1:1 correspondences between the Node Templates of a Topology Template One underlying assumption is that there exist only 1:1 correspondences between the Node Templates of two Topology Templates. Fig. 4.1 shows a valid example of a mapping between a database Node Templates and Linux operating system (OS) using only 1:1 correspondences. 26
4 Assumptions and Requirements for Matching and Merging Valid example : 1:1 correspondences Topology Template Topology Template Database Database HostedOn HostedOn Linux OS Linux OS Fig. 4.1: Valid example of 1:1 correspondences between Node Templates Fig. 4.2 in contrast shows an example of a n:1 correspondence. The TOSCA specification does not imply any kind of modeling style and granularity of Node Templates. In an extreme case one could consider a Topology Template consisting only of one Node Template representing the whole service structure as valid in the sense of the specification. However, the aggregation of Node Templates that can be viewed as separate entities camouflages the structure of a service and impedes the comparison of Node Templates with the same semantics. Topology Template Invalid example : n:1 correspondence Topology Template Database Database and Linux OS hosted on Linux OS Fig. 4.2: Invalid example of a n:1 correspondence between Node Templates 27
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 38 and 39: 3 Related Work tive algorithm with
Page 42 and 43: 4 Assumptions and Requirements for
Page 44 and 45: 4 Assumptions and Requirements for
Page 46 and 47: 5 Concept for Matching of Topology
Page 90 and 91:
5 Concept for Matching of Topology
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?