Publication | Closed Access
Jackson networks in nonautonomous random environments
11
Citations
27
References
2016
Year
Network ScienceService CapacitiesEngineeringRandom GraphSurvivable NetworkStochastic NetworkNetwork CalculusNetwork AnalysisRandom DirectionProbability TheoryComputer ScienceRandom EnvironmentStochastic GeometryProbabilistic Graph TheoryJackson NetworksQueueing TheoryQueueing Systems
Abstract We investigate queueing networks in a random environment. The impact of the evolving environment on the network is by changing service capacities (upgrading and/or degrading, breakdown, repair) when the environment changes its state. On the other side, customers departing from the network may enforce the environment to jump immediately. This means that the environment is nonautonomous and therefore results in a rather complex two-way interaction, especially if the environment is not itself Markov. To react to the changes of the capacities we implement randomised versions of the well-known deterministic rerouteing schemes 'skipping' (jump-over protocol) and `reflection' (repeated service, random direction). Our main result is an explicit expression for the joint stationary distribution of the queue-lengths vector and the environment which is of product form.
| Year | Citations | |
|---|---|---|
Page 1
Page 1