Algorithmic analysis of the MAP/PH/1 retrial queue (Q997932)

From MaRDI portal





scientific article; zbMATH DE number 5178057
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithmic analysis of the MAP/PH/1 retrial queue
    scientific article; zbMATH DE number 5178057

      Statements

      Algorithmic analysis of the MAP/PH/1 retrial queue (English)
      0 references
      0 references
      8 August 2007
      0 references
      A retrial queue with Markovian arrival process (MAP) of primary customers, with phase-type (PH) service time distribution and with exponential retrial times is considered. Structure of MAP is discussed. Steady-state analysis of the queue-size is studied and solution is obtained using matrix-geometric approach. An effective algorithm to calculate steady-state solution is presented in detail. Analytical expression and an effective algorithm for computing of the probability of the maximum orbit size is given. Some illustrative numerical examples are also included.
      0 references
      Markovian arrival process
      0 references
      retrial queue
      0 references
      busy period
      0 references
      maximal queue-size
      0 references
      phase type service-time distribution
      0 references
      computational algorithm
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers