一种新的广播总线局域网语音调度方案

Wai Chen, San-qi Li, M. Schwartz
{"title":"一种新的广播总线局域网语音调度方案","authors":"Wai Chen, San-qi Li, M. Schwartz","doi":"10.1109/INFCOM.1989.101486","DOIUrl":null,"url":null,"abstract":"Scheduling of voice traffic on broadcast-bus local area networks is considered. A voice scheduling scheme is proposed and evaluated. In this scheme, active voice calls are organized using a distributed global queue. Access scheduling overhead is reduced by voice packet arrival anticipation. To guarantee fairness and to reduce variance of the waiting time, the voice packet build-up during the overhead period is fairly shared among all calls by a round-robin service discipline. Three different voice packet service cases, namely nonexhaustive, exhaustive, and no-queueing, are evaluated. Simple closed-form approximation formulas have been proposed which show good agreement with simulation. The proposed scheme is shown to have performance approaching that of the centralized system.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A new voice scheduling scheme for broadcast bus local area networks\",\"authors\":\"Wai Chen, San-qi Li, M. Schwartz\",\"doi\":\"10.1109/INFCOM.1989.101486\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling of voice traffic on broadcast-bus local area networks is considered. A voice scheduling scheme is proposed and evaluated. In this scheme, active voice calls are organized using a distributed global queue. Access scheduling overhead is reduced by voice packet arrival anticipation. To guarantee fairness and to reduce variance of the waiting time, the voice packet build-up during the overhead period is fairly shared among all calls by a round-robin service discipline. Three different voice packet service cases, namely nonexhaustive, exhaustive, and no-queueing, are evaluated. Simple closed-form approximation formulas have been proposed which show good agreement with simulation. The proposed scheme is shown to have performance approaching that of the centralized system.<<ETX>>\",\"PeriodicalId\":275763,\"journal\":{\"name\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1989.101486\",\"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 '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

研究了广播总线局域网话音流量的调度问题。提出并评价了一种语音调度方案。在该方案中,使用分布式全局队列组织主动语音呼叫。通过语音分组到达预期减少了访问调度开销。为了保证公平性和减少等待时间的变化,在开销期间的语音分组积累在所有呼叫之间通过轮询服务原则公平地共享。评估了非穷举、穷举和不排队三种不同的语音分组业务情况。提出了简单的封闭近似公式,与仿真结果吻合较好。结果表明,该方案的性能接近集中式系统的性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new voice scheduling scheme for broadcast bus local area networks
Scheduling of voice traffic on broadcast-bus local area networks is considered. A voice scheduling scheme is proposed and evaluated. In this scheme, active voice calls are organized using a distributed global queue. Access scheduling overhead is reduced by voice packet arrival anticipation. To guarantee fairness and to reduce variance of the waiting time, the voice packet build-up during the overhead period is fairly shared among all calls by a round-robin service discipline. Three different voice packet service cases, namely nonexhaustive, exhaustive, and no-queueing, are evaluated. Simple closed-form approximation formulas have been proposed which show good agreement with simulation. The proposed scheme is shown to have performance approaching that of the centralized system.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信