Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (Q5462811)

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 2189015
Language Label Description Also known as
default for all languages
No label defined
    English
    Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique
    scientific article; zbMATH DE number 2189015

      Statements

      Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (English)
      0 references
      0 references
      0 references
      0 references
      27 July 2005
      0 references
      semi-Markov process
      0 references
      polynomial factorization
      0 references
      discrete time single server system
      0 references
      stationary workload analysis
      0 references
      interval arithmetic
      0 references
      result verification
      0 references
      queuing systems
      0 references
      0 references
      0 references
      The authors propose a method to obtain verified solutions for the distribution of the workload of renewal and semi-Markov servers in discrete time using polynomial factorization. The method is applicable for queuing systems and servers in production lines and telecommunication networks. Interval arithmetic is used to obtain verified results for the workload distributions.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references