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

Discrete-time queues with generally distributed service times and renewal-type server interruptions

โœ Scribed by Dieter Fiems; Bart Steyaert; Herwig Bruneel

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
172 KB
Volume
55
Category
Article
ISSN
0166-5316

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Workload distribution of discrete-time p
Workload distribution of discrete-time parallel queues with two servers
โœ P. Patrick Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB

We study discrete-time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a

Multiserver bulk service discrete-time q
Multiserver bulk service discrete-time queue with finite buffer and renewal input
โœ V. Goswami; G.B. Mund ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 932 KB

This paper analyzes a discrete-time finite-buffer multi-server bulk-service queueing system in which the interarrival-and service-times are, respectively, arbitrarily and geometrically distributed. Using the supplementary variable and the imbedded Markovchain techniques, the queue is analyzed for th

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