A discrete-time GI^X/Geo^Y/1 queue with early arrival system

DOI10.1007/S40819-019-0724-XMaRDI QIDQ2334713zbMATH OpenOpenAlexFDO

Authors U. C. Gupta, F. P. Barbhuiya, Arunava Maity

Publication date 7 November 2019

Published in International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.10192

zbMATH Keywords

batch arrivaldiscrete-time queueearly arrival systemrenewal process

Mathematics Subject Classification ID

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

Abstract: A discrete-time batch service queue with batch renewal input and random serving capacity rule under the late arrival delayed access system (LAS-DA), has recently appeared in the literature [2]. In this paper, we consider the same model under the early arrival system (EAS), since it is more applicable in telecommunication systems where an arriving batch of packets needs to be transmitted in the same slot in which it has arrived. In doing so, we derive the steady-state queue length distributions at various epochs and show that in limiting case the result gets converted to the continuous-time queue [1]. We discuss a few numerical results as well.

Recommendations

• Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
• Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
• Modeling and analysis of discrete-time multiserver queues with batch arrivals: \(GI^{X}/geom/m\)
• Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues
• Discrete-time batch service \(GI/Geo/1/N\) queue with accessible and non-accessible batches

Cites work

• A difference equation approach for analysing a batch service queue with the batch renewal arrival process
• A Simple and Complete Solution to the Stationary Queue-Length Probabilities of a Bulk-Arrival Bulk-Service Queue
• Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
• Delay analysis of a two-class batch-service queue with class-dependent variable server capacity
• Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
• On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
• On the Stationary Distribution of theGI^X/M^Y/1 Queueing System
• Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
• System occupancy of a two-class batch-service queue with class-dependent variable server capacity

Cited in

(4)

• Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
• Modelling and analysis of a discrete-time \(GI^X / Geom /1/K\) queue with \(N\) threshold policy
• Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
• A note on \(Geo^X / G / 1\) queueing system

This page was built for publication: A discrete-time \(\mathrm{GI}^X/\mathrm{Geo}^Y/1\) queue with early arrival system

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