{"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}
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.