On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals

DOI10.1016/S0167-6377(01)00110-9MaRDI QIDQ1611999zbMATH OpenFDO

Authors Nam K. Kim, Seok Ho Chang, Kyung C. Chae

Publication date 28 August 2002

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6377(01)00110-9

zbMATH Keywords

discrete-time batch Markovian arrival processdiscrete-time queues

Mathematics Subject Classification ID

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

Review text

The paper deals with finite- and infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the late arrival system with delayed access as well as the early arrival system. Using simple arguments such as the balance equation, ``rate in equals rate out, relationships among the stationary queue lengths at arrival, at departure, and at random epochs are derived. Such relationships hold for a broad class of discrete-time queues with D-BMAP arrivals.

Recommendations

• On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals
• scientific article; zbMATH DE number 2064354
• The relation between limiting queue size distributions at arrival and departure epochs in a bulk queue
• On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
• RELATIONSHIP BETWEEN QUEUE-LENGTH AND WAITING TIME DISRIBUTIONS IN A PRIORITY QUEUE WITH BATCH ARRIVALS

Cites work

• An arrival time approach to \(M/G/1\)-type queues with generalized vacations
• scientific article; zbMATH DE number 444952 (Why is no real title available?)
• scientific article; zbMATH DE number 3858110 (Why is no real title available?)
• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 4119378 (Why is no real title available?)
• On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals
• Performance evaluation of computer and communication systems. Joint tutorial papers of performance '93 and Sigmetrics '93
• Statistical multiplexing of VBR sources: A matrix-analytic approach
• The complete analysis of the discrete time finite DBMAP/G/1/N queue
• Waiting times in discrete-time cyclic-service systems

Cited in

(11)

• Performance analysis of a GI/D-MSP/1/ queueing system under different service phase initiations
• A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application
• Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
• Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
• Waiting time and queue length analysis of Markov-modulated fluid priority queues
• Modelling and analysis of GI/BMSP/1 queueing system
• scientific article; zbMATH DE number 2064354 (Why is no real title available?)
• Performance models for wireless channels
• Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process
• Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server's vacation
• Equivalences of Batch-Service Queues and Multi-Server Queues and Their Complete Simple Solutions in Terms of Roots

This page was built for publication: On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals

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