On the equivalence of flows in queuing networks

J. Walrand, P. Varaiya
{"title":"On the equivalence of flows in queuing networks","authors":"J. Walrand, P. Varaiya","doi":"10.1109/CDC.1980.271869","DOIUrl":null,"url":null,"abstract":"The following surprising result has recently been proved: the arrival and departure processes at a node in a Jackson network of M/M/1 nodes have the same interarrival time distribution, under equilibrium [1]. This result, which has been generalized to the case of M/M/1 node in a quasireversible network [2], led the authors of [1] to conjecture the equivalence in law of those processes. It will be shown that this equivalence does not hold in general. The necessary and sufficient conditions for the equivalence of the flows in a closed network of two M/M/s queues will be given (see [3], [4]). The technique used is the martingale approach to the analysis of networks of queues and it will be briefly discussed (see [5]-[6]).","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1980.271869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The following surprising result has recently been proved: the arrival and departure processes at a node in a Jackson network of M/M/1 nodes have the same interarrival time distribution, under equilibrium [1]. This result, which has been generalized to the case of M/M/1 node in a quasireversible network [2], led the authors of [1] to conjecture the equivalence in law of those processes. It will be shown that this equivalence does not hold in general. The necessary and sufficient conditions for the equivalence of the flows in a closed network of two M/M/s queues will be given (see [3], [4]). The technique used is the martingale approach to the analysis of networks of queues and it will be briefly discussed (see [5]-[6]).
排队网络中流的等价性
最近证明了以下令人惊讶的结果:在均衡[1]下,M/M/1个节点的Jackson网络中节点的到达和离开过程具有相同的到达间隔时间分布。这一结果推广到准可逆网络[2]中M/M/1节点的情况,使得[1]的作者推测这些过程在定律上是等价的。我们将证明,这种等价并不普遍成立。给出了两个M/M/s队列的封闭网络中流等价的充分必要条件(见[3],[4])。所使用的技术是分析队列网络的鞅方法,将对其进行简要讨论(参见[5]-[6])。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信