Jackson network in a random environment: strong approximation

DOI10.47910/FEMJ202015zbMath1454.60139arXiv2010.14582MaRDI QIDQ5151307

E. E. Bashtova, E. O. Lenena

Publication date: 17 February 2021

Published in: Dal'nevostochnyi Matematicheskii Zhurnal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.14582

zbMATH Keywords

strong approximationJackson networkunreliable systems

Mathematics Subject Classification ID

Processes in random environments (60K37) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

Accuracy of Estimation of the Vector of Queue Lengths for Open Jackson Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Coupling method for asymptotic analysis of queues with regenerative input and unreliable server
• Invariance principles for renewal processes
• Reflected Brownian motion on an orthant
• Regenerative stochastic processes
• Open Queueing Networks in Heavy Traffic
• AN M/G/1 RETRIAL QUEUE WITH UNRELIABLE SERVER FOR STREAMING MULTIMEDIA APPLICATIONS
• Heavy Traffic Limit Theorems for Queues: A Survey
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results
• On the M/G/1 retrial queue subjected to breakdowns
• Rate of Convergence to Stationary Distribution for Unreliable Jackson-Type Queueing Network with Dynamic Routing
• The heavy traffic approximation for single server queues in series

This page was built for publication: Jackson network in a random environment: strong approximation