Queueing networks with regenerating trajectories

MaRDI QIDQ580160zbMATH OpenFDO

Authors A. L. Tolmachev

Publication date 1986

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

message routingqueueing networksstationary distribution of the state probabilitiessubsequent stages

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

The author examines queueing networks with allowance for dependent durations of message servicing in subsequent stages of message routing in the networks. Under the assumption that a steady-state mode of network operation exists, the stationary distribution of the state probabilities of the network is obtained; it is of nonstandard multiplicative form. The traditional invariance of the stationary distribution is maintained for the network in question.

Recommendations

• scientific article; zbMATH DE number 4060487
• scientific article; zbMATH DE number 4131404
• Invariance of stationary probabilities of states for network of multiserver queues
• Regenerative closed queueing networks
• Markovian queueing networks in a random environment

Cited in

(12)

• Some limit theorems for regenerative queues
• Wide sense regenerative processes with applications to multi-channel queues and networks
• scientific article; zbMATH DE number 4147265 (Why is no real title available?)
• scientific article; zbMATH DE number 4153642 (Why is no real title available?)
• Extended regeneration: application to analysis of net traffics
• scientific article; zbMATH DE number 4048828 (Why is no real title available?)
• scientific article; zbMATH DE number 4100926 (Why is no real title available?)
• scientific article; zbMATH DE number 4102253 (Why is no real title available?)
• Time series transformations in clocked queueing networks
• Factorized time-dependent distributions for certain multiclass queueing networks and an application to enzymatic processing networks
• Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
• The model of queueing network with parallel routes

This page was built for publication: Queueing networks with regenerating trajectories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580160)