BMAP/G/1/\(\infty \) system with last come first served probabilistic priority
type: Item
instance of: scholarly article
title: BMAP/G/1/\(\infty \) system with last come first served probabilistic priority
zbMATH Open document ID: 1180.90075
DOI: 10.1134/S0005117909050142
author: T. A. Milovanova
published in: Automation and Remote Control
publication date: 2010-01-13T00:00:00Z
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 5657001
MaRDI profile type: Publication
cites work: P433-444
cites work: The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
cites work: The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
cites work: On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
cites work: Q4516083
cites work: Q3967337
cites work: An invariant-discipline queueing system
cites work: Q4830100
Recommended article: The \(\text{BMAP}/\text{G}/1\) queueing system with alternating operation mode
Recommended article: Q4830100
Recommended article: Q4782532
Recommended article: The queueing system BDG D∞∗∗
Recommended article: The BMAP/G/1 queue with level-dependent arrivals -- An overview
Recommended article: On finite buffer \(BMAP/G/1\) queue with queue length dependent service
Recommended article: The BMAP\(/PH/1\) retrial queueing system operating in random environment
Recommended article: A \(\text{MAP}_2/ \text{G}_2/1/r\) queue system with absolute priority
Recommended article: BMAP/G/1 Queue UnderD-Policy: Queue Length Analysis
description: scientific article; zbMATH DE number 5657001