Common Contracts

Modeling Service Level Agreements with Binary Decision Diagrams

September 25th, 2009

• Filed
  September 25th, 2009

Abstract. The vision of automated service composition for enabling service economies is challenged by many theoretical and technical limi- tations of current technologies. There is a need for complete, dependable service hierarchies created on-the-fly for critical business environments. Such automatically-constructed, complex and dynamic service hierar- chies imply a similarly automated process for establishing the contracts that specify the rules governing the consumption of services; and for binding them into respective contract hierarchies. Deducing these re- quired contracts is a computationally challenging task. This also applies to the optimization of such contract sets to maximize utility. We propose the application of (Shared) Reduced Ordered Binary Decision Diagrams, a suitable graph-based data structure well-known in the area of Elec- tronic Design Automation. These diagrams can be used as a canonical representation of SLAs, thus allowing their efficient and unambiguous manageme