Please use this identifier to cite or link to this item:
|Title:||A SLA graph model for data services||Authors:||Stamou, Katerina
Kantere, Verena M.
Morin, Jean Henry
|Keywords:||Data management;Distributed service management;Property graph;Service level agreement||Category:||Electrical Engineering - Electronic Engineering - Information Engineering||Field:||Engineering and Technology||Issue Date:||11-Dec-2013||Publisher:||Association for Computing Machinery, Inc.||Source:||5th International Workshop on Cloud Data Management, 2013 - Co-located with the 22nd ACM International Conference on Information and Knowledge Management, San Francisco, United States||metadata.dc.doi:||10.1145/2516588.2516592||Abstract:||Cloud computing has given rise to on-demand service provisioning and massive outsourcing of IT infrastructures and applications to virtual, commoditized ones. Despite the broad Service Level Agreement (SLA) usage in scientific settings, their role in cloud markets is peripheral and misinterpreted. The paper introduces a SLA graph data model that supports automated SLA formalization and data management through a property digraph. The data model is described as a directed graph (digraph). We elaborate on node and edge properties that indicate dependencies in the SLA data management flow. We sketch a realistic scenario of cloud data service provisioning to extract attributes that characterize the data service. The SLA graph model and data service attributes are used to demonstrate the formalization of a SLA template that is managed as a property graph. The graph structure enables the manipulation of SLA information in a modular, extensible way that considers the data flow and all inclusive data dependencies.||URI:||http://ktisis.cut.ac.cy/handle/10488/9674||ISBN:||978-145032416-8||Rights:||© 2013 ACM.||Type:||Conference Papers|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
Page view(s) 5051
checked on Nov 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.