Abstract
Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). In this work we propose a simple model of contracts for QoS and SLAs that also allows to study mechanisms for resource allocation and for joining different SLA requirements. Our language combines two basic programming paradigms: name-passing calculi and concurrent constraint programming (cc programming). Specifically, we extend cc programming by adding synchronous communication and by providing a treatment of names in terms of restriction and structural axioms closer to nominal calculi than to variables with existential quantification. In the resulting framework, SLA requirements are constraints that can be generated either by a single party or by the synchronisation of two agents. Moreover, restricting the scope of names allows for local stores of constraints, which may become global as a consequence of synchronisations. Our approach relies on a system of named constraints that equip classical constraints with a suitable algebraic structure providing a richer mechanism of constraint combination. We give reduction-preserving translations of both cc programming and the calculus of explicit fusions.
Keywords
- Service Level Agreement
- Constraint System
- Soft Constraint
- Parallel Composition
- Process Calculus
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research supported by the EU IST-FP6 16004 Integrated Project Sensoria.
Chapter PDF
References
Bacciu, A., Botta, A., Melgratti, H.: A fuzzy approach for negotiating quality of services. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2007. LNCS, vol. 4661, pp. 200–217. Springer, Heidelberg (2007)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)
Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Logic 7(3), 563–589 (2006)
Montanari, U., et al.: A Process Calculus for QoS-Aware Applications. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 33–48. Springer, Heidelberg (2005)
Diaz, J.F., Rueda, C., Valencia, F.: A calculus for concurrent processes with constraints. CLEI Electronic Journal 1(2) (1998)
Keller, A., Ludwig, H.: The WSLA framework: Specifying and monitoring service level agreements for web services. Jour. Net. and Sys. Manag. 11(1), 57–81 (2003)
Milner, R., Parrow, J., Walker, J.: A calculus of mobile processes, I and II. Inform. and Comput 100(1), 1–40, 41–77 (1992)
Montanari, U.: Networks of constraints: fundamental properties and application to picture processing. Information Science 7, 95–132 (1974)
Montanari, U., Pistore, M.: Structured coalgebras and minimal hd-automata for the pi-calculus. Theoret. Comput. Sci 340(3), 539–576 (2005)
Montanari, U., Rossi, F.: Constraint relaxation be perfect. Artif. Intell. 48(2), 143–170 (1991)
Niehren, J., Mueller, M.: Constraints for free in concurrent computation. In: Kanchanasut, K., Levy, J.-J. (eds.) ACSC 1995. LNCS, vol. 1023, Springer, Heidelberg (1995)
Nielsen, M., Palamidessi, C., Valencia, F.: On the expressive power of temporal concurrent constraint programming languages. In: Proc. PPDP’02, ACM Press, New York (2002)
Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc. LICS’98, IEEE Computer Society Press, Los Alamitos (1998)
Saraswat, V., Lincoln, P.: Higher-order linear concurrent constraint programming. Technical Report, Xerox Parc (1992)
Saraswat, V., Rinard, M.: Concurrent constraint programming. In: Proc. POPL’90, ACM Press, New York (1990)
Saraswat, V., Rinard, M., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Proc. POPL’91, ACM Press, New York (1991)
Skene, J., Lamanna, D., Emmerich, W.: Precise service level agreements. In: Proc. ICSE’04 (2004)
Victor, B., Parrow, J.: Constraints as processes. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, Springer, Heidelberg (1996)
Wischik, L., Gardner, P.: Explicit fusions. Theoret. Comput. Sci 340(3), 606–630 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Buscemi, M.G., Montanari, U. (2007). CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. In: De Nicola, R. (eds) Programming Languages and Systems. ESOP 2007. Lecture Notes in Computer Science, vol 4421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71316-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-71316-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71314-2
Online ISBN: 978-3-540-71316-6
eBook Packages: Computer ScienceComputer Science (R0)