2000 character limit reached
Jackson network in a random environment: strong approximation (2010.14582v1)
Published 27 Oct 2020 in math.PR
Abstract: We consider a Jackson network with regenerative input flows in which every server is subject to a random environment influence generating breakdowns and repairs. They occur in accordance with two independent sequences of i.i.d. random variables. We establish a theorem on the strong approximation of the vector of queue lengths by a reflected Brownian motion in positive orthant.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.