Mapping service-level agreements in distributed applications

In previous column, we discussed how to build distributed systems from quality-of-service (QoS)-aware software components. We also described a design by which individual components can engage in QoS negotiation and perform admission control so that new incoming requests don't violate committed...

Full description

Saved in:
Bibliographic Details
Published in:IEEE internet computing 2004-09, Vol.8 (5), p.100-102
Main Author: Menasce, D.A.
Format: Article
Language:English
Subjects:
Admission control
Application software
components
Computer programs
Cost engineering
Cost function
Design engineering
Equations
Internet
Iterative methods
Mapping
Negotiations
QOS
service-level agreements
Software
Software performance
Software quality
Software systems
Upper bound
Virtual manufacturing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In previous column, we discussed how to build distributed systems from quality-of-service (QoS)-aware software components. We also described a design by which individual components can engage in QoS negotiation and perform admission control so that new incoming requests don't violate committed QoS requirements. But what happens in a distributed application made up of several QoS-aware components and if the application has a global service-level agreement (SLA) for maximum end-to-end execution time. The problem we discuss in this paper is how to determine which SLAs should be negotiated at the component level so that the global SLA is satisfied at the minimum possible cost.
ISSN:1089-7801
1941-0131
DOI:10.1109/MIC.2004.47