Stationary probability distribution for states of G-networks with constrained sojourn time

DOI10.1134/S0005117917100095zbMath1387.90056OpenAlexW2763121473MaRDI QIDQ683461

Yu. V. Malinkovskii

Publication date: 6 February 2018

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117917100095

zbMATH Keywords

stationary distributionqueueing networknegative customersbounded sojourn timenonlinear traffic equation

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Traffic problems in operations research (90B20)

Related Items (2)

Queueing system with two input flows, preemptive priority, and stochastic dropping ⋮ Unnamed Item

Cites Work

• Jackson networks with single-line nodes and limited sojourn or waiting times
• \(G\)-networks: A versatile approach for work removal in queueing networks
• Stability of Product Form G-Networks
• Product-form queueing networks with negative and positive customers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stationary probability distribution for states of G-networks with constrained sojourn time