多址系统中交互队列的延迟分析方法

E. Modiano, A. Ephremides
{"title":"多址系统中交互队列的延迟分析方法","authors":"E. Modiano, A. Ephremides","doi":"10.1109/INFCOM.1993.253331","DOIUrl":null,"url":null,"abstract":"An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A method for delay analysis of interacting queues in multiple access systems\",\"authors\":\"E. Modiano, A. Ephremides\",\"doi\":\"10.1109/INFCOM.1993.253331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

建立了一个用于分析交互队列的近似模型。该近似通过两个马尔可夫链来模拟n维无限马尔可夫链,一个是一维无限马尔可夫链,另一个是n维有限马尔可夫链。每条链的转移概率用另一条链的统计量表示。两个链一起迭代求解,得到一个近似于原来的n维无限链。该模型用于分析多访问协议中经常出现的依赖队列系统。本文展示了该模型如何用于分析ALOHA多址协议以及先前提出的网状网络广播算法。计算结果与仿真结果吻合较好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A method for delay analysis of interacting queues in multiple access systems
An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Translation of QoS parameters into ATM performance parameters in B-ISDN Traffic control scheme for interconnection of FDDI networks through ATM network An approximate analysis of broadcasting in multichannel metropolitan area networks Blocking evaluation for networks with reward maximization routing Characterization of a CBR connection over a channel with known bounded delay variation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1