Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Term rewriting and all that
The WSLA Framework: Specifying and Monitoring Service Level Agreements for Web Services
Journal of Network and Systems Management
Multicriteria Optimization
Modeling Service Level Agreements with Binary Decision Diagrams
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Service Level Checking in the Cloud Computing Context
CLOUD '10 Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing
Cloud Computing: Principles, Systems and Applications
Cloud Computing: Principles, Systems and Applications
QoS-aware SLA-based Advanced Reservation of Infrastructure as a Service
CLOUDCOM '11 Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and Science
Using lower bounds during dynamic BDD minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Evaluation of a utility computing model based on the federation of grid infrastructures
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
In cloud computing, an automated SLA is an electronic contract used to record the rights and obligations of service providers and customers for their services. SLA negotiation can be a time-consuming process, mainly due to the unpredictable rounds of negotiation and the complicated possible dependencies among SLAs. The operation of negotiating SLAs can be facilitated when SLAs are translated into Reduced Ordered Binary Decision Diagrams (ROBDDs). Nevertheless, an ROBDD may not be optimally structured upon production. In this paper, we show how to reduce the number of 1-paths and nodes of ROBDDs that model SLAs, using ROBDD optimization algorithms. In addition, we demonstrate the reduction of 1-paths via the application of Term Rewriting Systems with mutually exclusive features. Using the latter, ROBDDs can be generated accurately without redundant 1-paths. We apply the principles onto the negotiation of IaaS SLAs via simulation, and show that negotiation is accelerated by assessing fewer SLA proposals (1-paths), while memory consumption is also reduced.