• DocumentCode
    597484
  • Title

    Arrival and delay curve estimation for SLA Calculus

  • Author

    Vastag, S.

  • Author_Institution
    Tech. Univ. Dortmund, Dortmund, Germany
  • fYear
    2012
  • fDate
    9-12 Dec. 2012
  • Firstpage
    1
  • Lastpage
    12
  • Abstract
    An algorithm and selection method to estimate Network Calculus arrival bounds for systems with concurrent arrivals is presented. Concurrent job arrivals are common for Service-Oriented Architectures. Their performance is described in Service Level Agreements including quantitative requirements for load and response times. SLA Calculus, a variant of Network Calculus, can be used for service performance modeling and validation with SLAs. Functions called curves are used to bound job arrivals as well as their delay. Due to the concurrent nature of job arrivals curve estimation methods used for successive packet arrivals in Network Calculus cannot be applied in SLA Calculus. We present a method to estimate unknown SLA Calculus arrival and delay bounds from input and output traces. This paper introduces an algorithm for the estimation of the curves. Optimal selection of a curve model based on several fitting criteria is performed using candidates from trace sets.
  • Keywords
    curve fitting; parallel processing; service-oriented architecture; SLA calculus arrival bounds; arrival curve estimation; concurrent job arrival; curve model; delay bounds; delay curve estimation; fitting criteria; job arrivals curve estimation method; network calculus arrival bounds; optimal selection; packet arrival; parallel arrival; quantitative requirement; service level agreement; service performance modeling; service performance validation; service-oriented architecture; Calculus; Contracts; Convolution; Delay; Estimation; Service oriented architecture; Time factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Simulation Conference (WSC), Proceedings of the 2012 Winter
  • Conference_Location
    Berlin
  • ISSN
    0891-7736
  • Print_ISBN
    978-1-4673-4779-2
  • Electronic_ISBN
    0891-7736
  • Type

    conf

  • DOI
    10.1109/WSC.2012.6465301
  • Filename
    6465301