• DocumentCode
    1940919
  • Title

    Improved Performance Models and Algorithms

  • Author

    Bogárdi-Mészöly, Ágnes ; Levendovszky, Tihamér ; Rövid, András

  • Author_Institution
    Dept. of Autom. & Appl. Inf., Budapest Univ. of Technol. & Econ., Budapest, Hungary
  • fYear
    2008
  • fDate
    27-29 Nov. 2008
  • Firstpage
    157
  • Lastpage
    162
  • Abstract
    Web-based software systems access some resources while executing the requests of the clients, typically several requests arrive at the same time, thus, competitive situation is established for the resources. In case of modeling such situation queueing model-based approaches are widely recognized. In our work, novel models and algorithms have been proposed to model the queue limit performance factor. In addition, the computational complexity and the limit analysis of the proposed models and algorithms have been provided. Moreover, the practical application of the results has been shown.
  • Keywords
    Internet; computational complexity; queueing theory; resource allocation; Web-based software system; competitive situation queueing model; computational complexity; model limit analysis; resource access; Algebra; Algorithm design and analysis; Application software; Automation; Computational complexity; Economic forecasting; Queueing analysis; Software systems; Stochastic processes; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Cybernetics, 2008. ICCC 2008. IEEE International Conference on
  • Conference_Location
    Stara Lesna
  • Print_ISBN
    978-1-4244-2874-8
  • Electronic_ISBN
    978-1-4244-2875-5
  • Type

    conf

  • DOI
    10.1109/ICCCYB.2008.4721397
  • Filename
    4721397