FINDING NON-STATIONARY STATE PROBABILITIES OF G-NETWORK WITH SIGNALS AND CUSTOMERS BATCH REMOVAL

DOI10.1017/S0269964817000109zbMath1401.90060OpenAlexW2610311444MaRDI QIDQ4961781

Mikhail Matalytski

Publication date: 25 October 2018

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964817000109

zbMATH Keywords

signalsqueueing theorysuccessive approximationsapplied probabilitybatch removalG-networknon-stationary state probabilities

Mathematics Subject Classification ID

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

Related Items (4)

FINDING EXPECTED REVENUES IN G-NETWORK WITH MULTIPLE CLASSES OF POSITIVE AND NEGATIVE CUSTOMERS ⋮ ANALYSIS OF THE NETWORK WITH MULTIPLE CLASSES OF POSITIVE AND NEGATIVE CUSTOMERS AT A TRANSIENT REGIME ⋮ FINDING NONSTATIONARY STATE PROBABILITIES OF OPEN MARKOV NETWORKS WITH MULTIPLE CLASSES OF CUSTOMERS AND VARIOUS FEATURES ⋮ Calculating expected incomes in open Markov networks with requests of different classes and different peculiarities

Cites Work

• G-networks with multiple classes of negative and positive customers
• \(G\)-networks with multiple classes of signals and positive customers
• \(G\)-networks: A unifying model for neural and queueing networks
• Special issue: G-networks
• On G-network and resource allocation in multimedia systems
• Investigation of G-network with signals at transient behavior
• Gated, Exhaustive, Parallel Service
• Product-form queueing networks with negative and positive customers
• G-networks by triggered customer movement
• G-networks with resets

This page was built for publication: FINDING NON-STATIONARY STATE PROBABILITIES OF G-NETWORK WITH SIGNALS AND CUSTOMERS BATCH REMOVAL