Using factorization in analyzing D-BMAP/G/1 queues

DOI10.1155/JAMSA.2005.119MaRDI QIDQ2495089zbMATH OpenOpenAlexFDO

Authors H. W. Lee, Se Won Lee, Jongwoo Jeon

Publication date 30 June 2006

Published in Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/52922

zbMATH Keywords

batch queuediscrete-time queuefactorization propertygenerating functionMarkovian arrival processmean queue-sizeN-policysetup periodsteady-state analysis

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

A queueing model with discrete-time batch Markovian arrival process (D-BMAP) is considered. If there are no customers to serve the server waits until the queue reaches the first threshold (builup period), and then a setup period is started. The server begins to serve customeres (busy period) if the queue size is greater than or equal to the second (higher) threshold. It is shown (the factorization property) that only generation function (GF) of the (steady-state) queue size at arbitrary slot boundary during an idle period is required to derive GFs of the queue size at an arbitrary slot and the queue size at a departure instant. Based on the factorization property, the queue-size distribution (and the mean queue size) is derived effectively by avoiding many complicated classical procedures.

Recommendations

• A factorization property for \(BMAP/G/1\) vacation queues under variable service speed
• A new approach to the queue length and waiting time of \(BMAP/G/1\) queues.
• scientific article; zbMATH DE number 2064354
• A workload factorization for BMAP/G/1 vacation queues under variable service speed
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

Cited in

(4)

• A new approach to the queue length and waiting time of \(BMAP/G/1\) queues.
• Analysis of \(D\)-\(BMAP/G/1\) queueing system under \(N\)-policy and its cost optimization
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• A factorization property for \(BMAP/G/1\) vacation queues under variable service speed

This page was built for publication: Using factorization in analyzing D-BMAP/G/1 queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495089)