处理器共享排队规则和设置控制下的缓冲区保留保持时间分析

H. Heffes, B. Sengupta
{"title":"处理器共享排队规则和设置控制下的缓冲区保留保持时间分析","authors":"H. Heffes, B. Sengupta","doi":"10.1109/ITS.1990.175590","DOIUrl":null,"url":null,"abstract":"The authors model the buffer reservation (allocation) holding time as the sojourn time in an M/M/1/K processor sharing queue, where K corresponds to the limit on the number of active virtual circuits sharing a congested trunk's bandwidth. They evaluate the exact results for the M/M/1/K processor sharing sojourn time distribution and show that it is of phase-type. Numerical results demonstrate the amount of smoothing induced by the limit K, as well as the robustness of the overload performance. For the case of general holding time distributions, in the absence of contention from other virtual circuits, i.e. the M/G/1/K processor sharing queue, the authors present an approximate method for evaluating the coefficient of variation of the sojourn time distribution, and compare these results with simulations.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Analysis of buffer reservation holding times under a processor sharing queueing discipline and setup control\",\"authors\":\"H. Heffes, B. Sengupta\",\"doi\":\"10.1109/ITS.1990.175590\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors model the buffer reservation (allocation) holding time as the sojourn time in an M/M/1/K processor sharing queue, where K corresponds to the limit on the number of active virtual circuits sharing a congested trunk's bandwidth. They evaluate the exact results for the M/M/1/K processor sharing sojourn time distribution and show that it is of phase-type. Numerical results demonstrate the amount of smoothing induced by the limit K, as well as the robustness of the overload performance. For the case of general holding time distributions, in the absence of contention from other virtual circuits, i.e. the M/G/1/K processor sharing queue, the authors present an approximate method for evaluating the coefficient of variation of the sojourn time distribution, and compare these results with simulations.<<ETX>>\",\"PeriodicalId\":405932,\"journal\":{\"name\":\"SBT/IEEE International Symposium on Telecommunications\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SBT/IEEE International Symposium on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.1990.175590\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SBT/IEEE International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.1990.175590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

将缓冲区预留(分配)保持时间建模为M/M/1/K处理器共享队列中的逗留时间,其中K对应于共享拥塞中继带宽的活动虚拟电路数量的限制。他们评估了M/M/1/K处理器共享逗留时间分布的精确结果,并表明它是相位型的。数值结果证明了极限K引起的平滑量,以及过载性能的鲁棒性。对于一般保持时间分布的情况,在没有其他虚拟电路的竞争情况下,即M/G/1/K处理器共享队列,作者提出了一种评估逗留时间分布变异系数的近似方法,并将这些结果与仿真结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of buffer reservation holding times under a processor sharing queueing discipline and setup control
The authors model the buffer reservation (allocation) holding time as the sojourn time in an M/M/1/K processor sharing queue, where K corresponds to the limit on the number of active virtual circuits sharing a congested trunk's bandwidth. They evaluate the exact results for the M/M/1/K processor sharing sojourn time distribution and show that it is of phase-type. Numerical results demonstrate the amount of smoothing induced by the limit K, as well as the robustness of the overload performance. For the case of general holding time distributions, in the absence of contention from other virtual circuits, i.e. the M/G/1/K processor sharing queue, the authors present an approximate method for evaluating the coefficient of variation of the sojourn time distribution, and compare these results with simulations.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信