Input queuing of an internally nonblocking packet switch with two priority classes

J. Chen, R. Guérin
{"title":"Input queuing of an internally nonblocking packet switch with two priority classes","authors":"J. Chen, R. Guérin","doi":"10.1109/INFCOM.1989.101497","DOIUrl":null,"url":null,"abstract":"An N*N nonblocking packet switch with two priority classes which can be used to support traffics with different requirements is analyzed. Real-time traffic such as voice is assigned high priority to satisfy its strict delay requirement, while data traffic uses a lower priority and utilizes the remaining system capacity. The switch operation is slotted, and at each time slot packets arrivals at the inputs have Bernoulli distributions with different probabilities for high-priority and low-priority classes. Packets of both priority classes can be queued when waiting for service; the service discipline is FCFS (first-come first-served) within each priority class. The authors provide explicit expressions for blocking probabilities and average delays. They also study system stability and show that the maximum throughput can in fact be higher than with no priority.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","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.101497","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

An N*N nonblocking packet switch with two priority classes which can be used to support traffics with different requirements is analyzed. Real-time traffic such as voice is assigned high priority to satisfy its strict delay requirement, while data traffic uses a lower priority and utilizes the remaining system capacity. The switch operation is slotted, and at each time slot packets arrivals at the inputs have Bernoulli distributions with different probabilities for high-priority and low-priority classes. Packets of both priority classes can be queued when waiting for service; the service discipline is FCFS (first-come first-served) within each priority class. The authors provide explicit expressions for blocking probabilities and average delays. They also study system stability and show that the maximum throughput can in fact be higher than with no priority.<>
具有两个优先级的内部非阻塞分组交换机的输入排队
分析了一种具有两种优先级的N*N非阻塞分组交换机,该交换机可用于支持不同需求的流量。实时业务(如语音)优先级高,以满足其严格的延迟要求;数据业务优先级低,占用系统剩余容量。交换操作是分槽的,并且在每个时间到达输入的分槽数据包具有不同概率的伯努利分布,对于高优先级和低优先级类别。两种优先级的数据包在等待服务时都可以排队;每个优先级类的服务原则是FCFS(先到先得)。给出了阻塞概率和平均延迟的显式表达式。他们还研究了系统稳定性,并表明最大吞吐量实际上可以高于没有优先级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信