Transient departure process in M/G/1/K-type queue with threshold server's waking up

W. Kempa, Dariusz Kurzyk
{"title":"Transient departure process in M/G/1/K-type queue with threshold server's waking up","authors":"W. Kempa, Dariusz Kurzyk","doi":"10.1109/SOFTCOM.2015.7314127","DOIUrl":null,"url":null,"abstract":"Time-dependent behavior of departure process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.","PeriodicalId":264787,"journal":{"name":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOFTCOM.2015.7314127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Time-dependent behavior of departure process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.
具有阈值服务器唤醒的M/G/1/ k型队列中的瞬态离开过程
分析了具有阈值服务器唤醒的有限缓冲M/G/1/ k型排队系统出发过程的时间依赖行为。在每个空闲时间之后,将与第N个到达事件同时初始化一个新的繁忙周期,其中阈值N是固定的。通过应用不同理论技术的混合方法:嵌入式马尔可夫链思想、Volterra型积分方程、连续全概率定律、更新理论和线性代数,导出了在固定时间t前完成处理的包数的概率分布的混合双重变换(拉普拉斯变换的概率生成函数)的封闭形式公式。所考虑的排队系统可用于基于节点(传感器)无线电发送/接收“排队”唤醒机制的无线传感器网络(WSN)的运行建模。本文还附有一个假想网络流量的数值示例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信