๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations

โœ Scribed by U.C. Gupta; S.K. Samanta; R.K. Sharma; M.L. Chaudhry

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
514 KB
Volume
64
Category
Article
ISSN
0166-5316

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A single-server G-queue in discrete-time
A single-server G-queue in discrete-time with geometrical arrival and service process
โœ Ivan Atencia; Pilar Moreno ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 189 KB

Negative arrivals are used as a control mechanism in many telecommunication and computer networks. This paper analyses a discrete-time single-server queue with geometrical arrivals of both positive and negative customers. We consider both the cases where negative customers remove positive customers

Computing queue length and waiting timed
Computing queue length and waiting timedistributions in finite-buffer discrete-time multiserver queues with late and early arrivals
โœ U.C. Gupta; S.K. Samanta; R.K. Sharma ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 993 KB

This paper presents modelling and analysis of discrete-time multiserver finite-buffer queue with general interaxrival and geometric service time. Using the supplementary variable technique, and considering the remaining interarrival time as a supplementary variable, two variants of this model, namel