Dynamic control policy for the discrete-time queue

Q3 Business, Management and Accounting
Tsung-Yin Wang, Fu-Min Chang
{"title":"Dynamic control policy for the discrete-time queue","authors":"Tsung-Yin Wang, Fu-Min Chang","doi":"10.1504/IJSOI.2016.080074","DOIUrl":null,"url":null,"abstract":"In queueing system, when the server is idle, one of control policy for determining the timing of server activated is when a fixed number N of customers accumulates for service in the system. However, on some practical situations such as watching video file online, the threshold value N may vary depending on different situations. For such situation, this paper studies a random N-policy Geo/G/1 queue, where N is determined as each new cycle begins. We derive some system characteristics, such as system size, idle period, busy period and sojourn time, by using the probability generating function and supplementary variable technique. We also prove that the system size of a continuous-time random N-policy M/G/1 queue can be approximated by the presented discrete-time model.","PeriodicalId":35046,"journal":{"name":"International Journal of Services Operations and Informatics","volume":"8 1","pages":"79"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJSOI.2016.080074","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Services Operations and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSOI.2016.080074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 1

Abstract

In queueing system, when the server is idle, one of control policy for determining the timing of server activated is when a fixed number N of customers accumulates for service in the system. However, on some practical situations such as watching video file online, the threshold value N may vary depending on different situations. For such situation, this paper studies a random N-policy Geo/G/1 queue, where N is determined as each new cycle begins. We derive some system characteristics, such as system size, idle period, busy period and sojourn time, by using the probability generating function and supplementary variable technique. We also prove that the system size of a continuous-time random N-policy M/G/1 queue can be approximated by the presented discrete-time model.
离散时间队列的动态控制策略
在排队系统中,当服务器处于空闲状态时,确定服务器激活时间的控制策略之一是当系统中有固定数量的N个客户需要服务时。但是在一些实际情况下,例如在线观看视频文件,阈值N可能会根据不同的情况而有所不同。针对这种情况,本文研究了一个随机N策略的Geo/G/1队列,其中N在每个新周期开始时确定。利用概率生成函数和补充变量技术,导出了系统大小、空闲时间段、繁忙时间段和停留时间等系统特性。我们还证明了连续时间随机n策略M/G/1队列的系统大小可以用所提出的离散时间模型来近似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Services Operations and Informatics
International Journal of Services Operations and Informatics Business, Management and Accounting-Management Information Systems
CiteScore
1.60
自引率
0.00%
发文量
9
期刊介绍: The advances in distributed computing and networks make it possible to link people, heterogeneous service providers and physically isolated services efficiently and cost-effectively. As the economic dynamics and the complexity of service operations continue to increase, it becomes a critical challenge to leverage information technology in achieving world-class quality and productivity in the production and delivery of physical goods and services. The IJSOI, a fully refereed journal, provides the primary forum for both academic and industry researchers and practitioners to propose and foster discussion on state-of-the-art research and development in the areas of service operations and the role of informatics towards improving their efficiency and competitiveness.
×
引用
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学术官方微信