具有反馈的多类队列的响应时间分布

Performance Pub Date : 1980-05-28 DOI:10.1145/800199.806167
S. Lam, A. Shankar
{"title":"具有反馈的多类队列的响应时间分布","authors":"S. Lam, A. Shankar","doi":"10.1145/800199.806167","DOIUrl":null,"url":null,"abstract":"A single server queue with feedback and multiple customer classes is analyzed. Arrival processes are independent Poisson processes. Each round of service is exponentially distributed. After receiving a round of service, a customer may depart or rejoin the end of the queue for more service. The number of rounds of service required by a customer is a random variable with a general distribution. Our main contribution is characterization of response time distributions for the customer classes. Our results generalize in some respects previous analyses of processor-sharing models. They also represent initial efforts to understand response time behavior along paths with loops in local balanced queueing networks.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"559 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1980-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Response time distributions for a multi-class queue with feedback\",\"authors\":\"S. Lam, A. Shankar\",\"doi\":\"10.1145/800199.806167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A single server queue with feedback and multiple customer classes is analyzed. Arrival processes are independent Poisson processes. Each round of service is exponentially distributed. After receiving a round of service, a customer may depart or rejoin the end of the queue for more service. The number of rounds of service required by a customer is a random variable with a general distribution. Our main contribution is characterization of response time distributions for the customer classes. Our results generalize in some respects previous analyses of processor-sharing models. They also represent initial efforts to understand response time behavior along paths with loops in local balanced queueing networks.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"559 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800199.806167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800199.806167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

分析了具有反馈和多个客户类的单个服务器队列。到达过程是独立的泊松过程。每轮服务呈指数分布。在接受一轮服务后,客户可以离开或重新加入队列的末端以获得更多服务。顾客需要服务的轮次是一个具有一般分布的随机变量。我们的主要贡献是描述客户类的响应时间分布。我们的结果在某些方面概括了以前对处理器共享模型的分析。它们还代表了理解局部平衡排队网络中具有环路的路径上的响应时间行为的初步努力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Response time distributions for a multi-class queue with feedback
A single server queue with feedback and multiple customer classes is analyzed. Arrival processes are independent Poisson processes. Each round of service is exponentially distributed. After receiving a round of service, a customer may depart or rejoin the end of the queue for more service. The number of rounds of service required by a customer is a random variable with a general distribution. Our main contribution is characterization of response time distributions for the customer classes. Our results generalize in some respects previous analyses of processor-sharing models. They also represent initial efforts to understand response time behavior along paths with loops in local balanced queueing networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信