The Community for Technology Leaders
2012 IEEE Fifth International Conference on Cloud Computing (2012)
Honolulu, HI, USA USA
June 24, 2012 to June 29, 2012
ISSN: 2159-6182
ISBN: 978-1-4673-2892-0
pp: 742-749
Enterprises often have no integrated and comprehensive view of their enterprise topology describing their entire IT infrastructure, software, on-premise and off-premise services, processes, and their interrelations. Especially due to acquisitions, mergers, reorganizations, and outsourcing there is no clear 'big picture' of the enterprise topology. Through this lack, management of applications becomes harder and duplication of components and information systems increases. Furthermore, the lack of insight makes changes in the enterprise topology like consolidation, migration, or outsourcing more complex and error prone which leads to high operational cost. In this paper we propose Enterprise Topology Graphs (ETG) as formal model to describe an enterprise topology. Based on established graph theory ETG bring formalization and provability to the cloud. They enable the application of proven graph algorithms to solve enterprise topology research problems in general and cloud research problems in particular. For example, we present a search algorithm which locates segments in large and possibly distributed enterprise topologies using structural queries. To illustrate the power of the ETG approach we show how it can be applied for IT consolidation to reduce operational costs, increase flexibility by simplifying changes in the enterprise topology, and improve the environmental impact of the enterprise IT.
Topology, Servers, Semantics, Complexity theory, Algorithm design and analysis, Graph theory, Runtime, IT consolidation, enterprise topology, enterprise topology graph, cloud, formalization, search

T. Binz, C. Fehling, F. Leymann, A. Nowak and D. Schumm, "Formalizing the Cloud through Enterprise Topology Graphs," 2012 IEEE Fifth International Conference on Cloud Computing(CLOUD), Honolulu, HI, USA USA, 2012, pp. 742-749.
171 ms
(Ver 3.3 (11022016))