A Polynomial Factorization Approach for the Discrete Time GIX/>G/1/K Queue

Pinai Linwong* (), Nei Kato* () and Yoshiaki Nemoto* ()
Additional contact information
Pinai Linwong*: Tohoku University
Nei Kato*: Tohoku University
Yoshiaki Nemoto*: Tohoku University

Methodology and Computing in Applied Probability, 2004, vol. 6, issue 3, 277-291

Abstract: Abstract This paper proposes a polynomial factorization approach for queue length distribution of discrete time GI X /G/1 and GI X /G/1/K queues. They are analyzed by using a two-component state model at the arrival and departure instants of customers. The equilibrium state-transition equations of state probabilities are solved by a polynomial factorization method. Finally, the queue length distributions are then obtained as linear combinations of geometric series, whose parameters are evaluated from roots of a characteristic polynomial.

Keywords: discrete time GI X /G/1/K; root finding algorithm; queue length distribution (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:MCAP.0000026560.42106.7a Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:6:y:2004:i:3:d:10.1023_b:mcap.0000026560.42106.7a

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1023/B:MCAP.0000026560.42106.7a

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().