Time-Cost Tradeoffs for Composed Services

N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Time and cost are crucial criteria in Service Level Agreements. Frequently, the time when and how long a service can be provided or used and the cost for utilizing a service are related and hence users are confronted with a trade-off between time and cost. Besides the fundamental direct and indirect proportional relationship between time and cost, composed services might also have more complex non-monotonic relationships. We introduce a novel way of expressing the trade-offs between time and cost in form of TC-Maps as a set of piece-wise linear functions. For calculating the duration, cost and their relation for service compositions, we introduce specific operations used in a bottom-up procedure resulting in an overall TC-Map. The proposed structure allows us to derive the minimum cost of a composed service given a duration limit, or for analyzing possible durations for a provided budget. TC-Maps offer the basis for optimizing the utilization of composed services according to user preferences, resources and objectives.

Cite

CITATION STYLE

APA

Hollauf, F. S., Franceschetti, M., & Eder, J. (2022). Time-Cost Tradeoffs for Composed Services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13295 LNCS, pp. 533–548). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-07472-1_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free