Merging of TOSCA Cloud Topology Templates - IAAS

More documents

Recommendations

Info

5 Concept for Matching of Topology Templates 5 Concept for Matching of Topology Templates The overall approach of this master’s thesis consists of two high-level steps namely matching and merging. This chapter deals with the matching of TOSCA elements to find correspondences between them. Section 5.1 discusses the different cases and situations that can be found when matching the Node Templates of two Topology Templates. For each case an algorithm respectively a subroutine of an overall algorithm is presented and explained. Section 5.2 introduces the matching of Relationship Templates while Section 5.3 extends the concepts of matching Node and Relationship Templates by considering their position in Group Templates. Moreover, the finding of correspondences between Group Templates is also part of this section. Altogether Chapter 5 forms the conceptual basis for the matching functionality of the TOSCAMerge framework. 5.1 Matching of Node Templates The matching of two Topology Templates is needed to identify correspondences between the Node Templates. According to assumption 4 we assume that only 1:1 correspondences are expected in the matching process. This is necessary as it is not in the scope of this work to conduct inexact matchings that only state the possibility of a correspondence. The exclusion of 1:n, n:1 and m:n mapping characteristics also avoids the necessity to compare every possible subset of Node Templates of one Topology Template with every possible subset of Node Templates of another Topology Template. Instead of 2 × 2 comparisons and (2 × 2 ) time complexity, at most × comparisons are needed yielding a time complexity of ( × ) ≅ ( ) with the number of Node Templates in the first Topology Template and the number of Node Templates in the second Topology Template. That implies that in principle the Topology Templates are matched by comparing every Node Template in the first one (left one or left-hand side) with every Node Template in the second one (right one or right-hand side). This basic pattern will be extended during the following discussion of the different cases. To clarify the concept of correspondences used in this thesis the following definition is provided: Definition 5.1 (Correspondence): In general a correspondence is an overlay edge indicating that one node corresponds to another node und therefore the two nodes can be merged. Overlay means that a correspondence is added on top of the existing graph structure. Although a correspondence can be seen as a directed edge between two nodes, as the beforehand comparison starts from one node to all the others and the Correspondence is the result of a successful matching, in the following illustrations the Correspondences are not depicted as arcs. The reason is that for the matching cases it does not matter from which node the matching started, therefore, the arrowheads are omitted for simplification. 32
5 Concept for Matching of Topology Templates 5.1.1 Analysis of the Basic Case and its Derivations Basic Case for Node Templates The basic case is illustrated in Fig. 5.1. A Correspondence between two Node Templates is established if and only if their Node Types are identical. For the sake of simplicity in the basic case, it is assumed that all Relationship Templates have HostedOn semantics and no PropertyDefaults that could contradict each other. Later this assumption will be dismissed and different Relationship Template semantics will be included in the matching concept. In the example at hand both Topology Templates have identical MySQL Database and Debian- Linux operating system Node Templates. The Relationship Templates have a HostedOn semantics indicating that each database is hosted, i.e. installed on an operating system. Since the Node Types are identical in each case, a so called Node Template Correspondence can be established. Definition 5.2 (Node Template Correspondence): A Node Template Correspondence is a Correspondence as generically defined in Definition 4.1 with the constraint that it is only established between two matching Node Templates. Fig. 5.1: Example of a general matching case 33
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 40 and 41: 4 Assumptions and Requirements for
Page 48 and 49: 5 Concept for Matching of Topology
Page 96 and 97:
5 Concept for Matching of Topology
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?