Generalized truncated methods for an efficient solution of retrial systems (Q955946)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5372471
Language Label Description Also known as
default for all languages
No label defined
    English
    Generalized truncated methods for an efficient solution of retrial systems
    scientific article; zbMATH DE number 5372471

      Statements

      Generalized truncated methods for an efficient solution of retrial systems (English)
      0 references
      24 November 2008
      0 references
      Summary: We are concerned with the analytic solution of multiserver retrial queues including the impatience phenomenon. As there are not closed-form solutions to these systems, approximate methods are required. We propose two different generalized truncated methods to effectively solve this type of systems. The methods proposed are based on the homogenization of the state space beyond a given number of users in the retrial orbit. We compare the proposed methods with the most well-known methods appeared in the literature in a wide range of scenarios. We conclude that the proposed methods generally outperform previous proposals in terms of accuracy for the most common performance parameters used in retrial systems with a moderated growth in the computational cost.
      0 references

      Identifiers