Throughput analysis of Maxemchuk's integrated voice/data local area network protocol

R. Kohli, A.C. Mingo, K. Vastola
{"title":"Throughput analysis of Maxemchuk's integrated voice/data local area network protocol","authors":"R. Kohli, A.C. Mingo, K. Vastola","doi":"10.1109/CNS.1988.5016","DOIUrl":null,"url":null,"abstract":"The authors deal with the analysis of a protocol allowing mixed voice and data transmission by different users on a common channel. The protocol is able to bound the delay of voice packets in a local area network environment. The protocol is modelled as continuous-time Markov Chain. First, the throughput of this protocol is evaluated given that a known number of voice users are utilizing the channel. Secondly, the throughput is averaged over the different number of users possible to yield the overall throughput of the system. To do this, the probability distribution for the number of voice users on the channel is evaluated. The throughput is evaluated and discussed in some detail. Limitations of the model and related work are also discussed.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.5016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The authors deal with the analysis of a protocol allowing mixed voice and data transmission by different users on a common channel. The protocol is able to bound the delay of voice packets in a local area network environment. The protocol is modelled as continuous-time Markov Chain. First, the throughput of this protocol is evaluated given that a known number of voice users are utilizing the channel. Secondly, the throughput is averaged over the different number of users possible to yield the overall throughput of the system. To do this, the probability distribution for the number of voice users on the channel is evaluated. The throughput is evaluated and discussed in some detail. Limitations of the model and related work are also discussed.<>
Maxemchuk集成语音/数据局域网协议的吞吐量分析
作者分析了一种允许不同用户在公共信道上混合传输语音和数据的协议。该协议能够在局域网环境下对语音报文的时延进行绑定。该协议被建模为连续时间马尔可夫链。首先,在已知数量的语音用户正在使用该信道的情况下,评估该协议的吞吐量。其次,将吞吐量平均到可能产生系统总吞吐量的不同用户数量上。为此,评估信道上语音用户数量的概率分布。对吞吐量进行了详细的评估和讨论。本文还讨论了模型的局限性和相关工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信