Discrete-time batch service GI/Geo/1/N queue with accessible and non-accessible batches

DOI10.1504/IJMOR.2010.030818MaRDI QIDQ961469zbMATH OpenFDO

Authors B. E. Eshmatov

Publication date 30 March 2010

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJMOR.2010.030818

zbMATH Keywords

accessible batchesasynchronous transfer modediscrete-time queuesfinite buffersnon-accessible batchessingle-server queuessupplementary variables

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Review text

Summary: Discrete-time queues are extensively used in modelling the asynchronous transfer mode environment at cell level. In this paper, we consider a discrete-time single-server finite-buffer queue with general inter-arrival and geometric service times where the services are performed in accessible or non-accessible batches of maximum size b with a minimum threshold value a. We provide a recursive method, using the supplementary variable technique and treating the remaining inter-arrival time as the supplementary variable, to develop the steady-state queue/system length distributions at pre-arrival and arbitrary epochs under the early arrival system. The method is depicted analytically for geometrical and deterministic inter-arrival time distributions, respectively. Various performance measures and outside observer's observation epochs are also discussed. Finally, some computational results have been presented.

Recommendations

• Discrete-time bulk-service queues with accessible and non-accessible batches
• scientific article; zbMATH DE number 5601217
• A discrete time bulk service queue with accessible batch: \(Geo/ NB^{(L,K)}/1\)
• Discrete-time renewal input multiple vacation queue with accessible and non-accessible batches
• Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues

Cited in

(6)

• A discrete time bulk service queue with accessible batch: \(Geo/ NB^{(L,K)}/1\)
• A discrete-time \(\mathrm{GI}^X/\mathrm{Geo}^Y/1\) queue with early arrival system
• scientific article; zbMATH DE number 5601217 (Why is no real title available?)
• Discrete-time renewal input multiple vacation queue with accessible and non-accessible batches
• Analysis of a finite buffer general input queue with Markovian service process and accessible and non-accessible batch service
• Discrete-time bulk-service queues with accessible and non-accessible batches

This page was built for publication: Discrete-time batch service \(GI/Geo/1/N\) queue with accessible and non-accessible batches

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