Note on batch arrival LCFS and related symmetric queues

DOI10.1016/0167-6377(93)90017-BzbMath0795.60091MaRDI QIDQ1317021

Masakiyo Miyazawa, Genji Yamazaki

Publication date: 12 September 1994

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

zbMATH Keywords

stationary distributioninsensitivitybatch arrivalsgeneralized semi- Markov process

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline
• Relationships in stationary jump processes with countable state space and their applications to queues
• Sample-path analysis of processes with imbedded point processes
• The GI/G/1 queue with last-come-first-served
• Invariance relations in single server queues with LCFS service discipline
• Insensitivity of blocking probabilities in a circuit-switching network
• INVARIANCE RELATIONS OF GI/G/1 QUEUEING SYSTEMS WITH PREEMPTIVE-RESUME LAST-COME-FIRST-SERVED QUEUE DISCIPLINE
• ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE
• Two remarks on insensitive stochastic models
• The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline
• An LCFS finite buffer model with finite source batch input
• Product-form distributions for an M/G/k group-arrival group-departure loss system
• On the system queue length distributions of LCFS-P queues with arbitrary acceptance and restarting policies
• Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds
• Insensitivity and product-form decomposability of reallocatable GSMP

This page was built for publication: Note on batch arrival LCFS and related symmetric queues