• DocumentCode
    2869443
  • Title

    SLA Based Profit Optimization in Multi-tier Systems

  • Author

    Ardagna, Danilo ; Trubian, Marco ; Zhang, Li

  • Author_Institution
    Politecnico di Milano
  • fYear
    2005
  • fDate
    27-29 July 2005
  • Firstpage
    263
  • Lastpage
    266
  • Abstract
    Nowadays, large service centers provide computational capacity to many customers by sharing a pool of IT resources. The service providers and their customers negotiate utility based service level agreement (SLA) to determine the costs and penalties on the base of the achieved performance level. The system is often based on a multi-tier architecture to service requests. The service provider would like to maximize the SLA revenues, while minimizing its operating costs. The system we consider is based on a centralized network dispatcher which controls the allocation of applications to servers, the request volumes at various servers and the scheduling policy at each server. The dispatcher can also decide to turn ON or OFF servers depending on the system load. This paper designs a resource allocation scheduler for such multi-tier environments so as to maximize the profits associated with multiple class SLAs. The overall problem is NP-hard. We develop heuristic solutions by implementing a local-search algorithm. Results are presented to demonstrate the benefits of our approach
  • Keywords
    cost reduction; optimisation; profitability; resource allocation; scheduling; NP-hard problem; SLA based profit optimization; centralized network dispatcher; local-search algorithm; multitier systems; resource allocation scheduler; service provider; utility based service level agreement; Centralized control; Computer architecture; Control systems; Costs; Internet; Load management; Network servers; Quality of service; Resource management; Scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Computing and Applications, Fourth IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7695-2326-9
  • Type

    conf

  • DOI
    10.1109/NCA.2005.48
  • Filename
    1565967