不同服务时间分布下M/G/1/N系统缓冲区大小基于成本的优化

Derek Doran, L. Lipsky, Stephen Thompson
{"title":"不同服务时间分布下M/G/1/N系统缓冲区大小基于成本的优化","authors":"Derek Doran, L. Lipsky, Stephen Thompson","doi":"10.1109/NCA.2010.11","DOIUrl":null,"url":null,"abstract":"An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer loss versus customer delays, by varying buffer size and processor speed. We find optimal (and near optimal) configurations for a wide variety of service-time distributions. The model can provide insight into when it is better to invest in increased processor speed than to supply more buffer space. It is seen that different distributions may need very different hardware for optimal performance, and that it may actually be better to reject customers.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Cost-Based Optimization of Buffer Size in M/G/1/N Systems under Different Service-Time Distributions\",\"authors\":\"Derek Doran, L. Lipsky, Stephen Thompson\",\"doi\":\"10.1109/NCA.2010.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer loss versus customer delays, by varying buffer size and processor speed. We find optimal (and near optimal) configurations for a wide variety of service-time distributions. The model can provide insight into when it is better to invest in increased processor speed than to supply more buffer space. It is seen that different distributions may need very different hardware for optimal performance, and that it may actually be better to reject customers.\",\"PeriodicalId\":276374,\"journal\":{\"name\":\"2010 Ninth IEEE International Symposium on Network Computing and Applications\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Ninth IEEE International Symposium on Network Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2010.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Ninth IEEE International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2010.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

提出了M/G/1/N排队系统的成本分析模型。它通过改变缓冲区大小和处理器速度来考虑客户损失和客户延迟的成本。我们为各种服务时间分布找到了最优(和接近最优)的配置。该模型可以帮助您了解在什么情况下投资于提高处理器速度比提供更多缓冲区空间更好。可以看到,不同的发行版可能需要非常不同的硬件来获得最佳性能,实际上拒绝客户可能会更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cost-Based Optimization of Buffer Size in M/G/1/N Systems under Different Service-Time Distributions
An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer loss versus customer delays, by varying buffer size and processor speed. We find optimal (and near optimal) configurations for a wide variety of service-time distributions. The model can provide insight into when it is better to invest in increased processor speed than to supply more buffer space. It is seen that different distributions may need very different hardware for optimal performance, and that it may actually be better to reject customers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信