随机环境下的Jackson网络:强近似

arXiv: Probability Pub Date : 2020-10-27 DOI:10.47910/femj202015

E. Bashtova, E. Lenena

{"title":"随机环境下的Jackson网络:强近似","authors":"E. Bashtova, E. Lenena","doi":"10.47910/femj202015","DOIUrl":null,"url":null,"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.","PeriodicalId":8470,"journal":{"name":"arXiv: Probability","volume":"44 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Jackson network in a random environment: strong approximation\",\"authors\":\"E. Bashtova, E. Lenena\",\"doi\":\"10.47910/femj202015\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":8470,\"journal\":{\"name\":\"arXiv: Probability\",\"volume\":\"44 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Probability\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47910/femj202015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47910/femj202015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们考虑一个具有再生输入流的Jackson网络，其中每个服务器都受到随机环境影响而产生故障和维修。它们按照两个独立的i.i.d随机变量序列发生。建立了正正交上反射布朗运动对队列长度向量的强逼近定理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Jackson network in a random environment: strong approximation

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv: Probability

自引率

0.00%

发文量