A discrete-time batch transmission channel with random serving capacity under batch-size-dependent service:

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS
S. Pradhan
{"title":"A discrete-time batch transmission channel with random serving capacity under batch-size-dependent service:","authors":"S. Pradhan","doi":"10.1080/23799927.2020.1792998","DOIUrl":null,"url":null,"abstract":"Discrete-time queues have increasingly diverse spectrum of applications in the modern packet-basedcommunication systems. Due to the wide range of applicability of such queues, we analyze a discrete-time queue with group-arrival and batch-service, where transmission time depends on the batch-size. The arrival occurs according tothe batch Bernoulli process and service is provided according to the random serving capacity rule. First, we obtain the bivariate probability generating function of the joint distribution of queue and server content at post transmission epoch. After the determination of unknown probabilities, the complete joint distribution has been extracted. We also acquire the probability distribution at random and pre-arrival epochs. An approximation of the tail distribution is also discussed so that it will be useful to improve the cell loss ratio. Some assorted numerical examples are incorporated to validate the analytic procedure and results.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2020.1792998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 3

Abstract

Discrete-time queues have increasingly diverse spectrum of applications in the modern packet-basedcommunication systems. Due to the wide range of applicability of such queues, we analyze a discrete-time queue with group-arrival and batch-service, where transmission time depends on the batch-size. The arrival occurs according tothe batch Bernoulli process and service is provided according to the random serving capacity rule. First, we obtain the bivariate probability generating function of the joint distribution of queue and server content at post transmission epoch. After the determination of unknown probabilities, the complete joint distribution has been extracted. We also acquire the probability distribution at random and pre-arrival epochs. An approximation of the tail distribution is also discussed so that it will be useful to improve the cell loss ratio. Some assorted numerical examples are incorporated to validate the analytic procedure and results.
基于批大小的服务下具有随机服务容量的离散批传输信道:
离散时间队列在现代分组通信系统中有着越来越广泛的应用。由于这类队列具有广泛的适用性,我们分析了具有群到达和批服务的离散时间队列,其中传输时间取决于批大小。按批伯努利过程到达,按随机服务容量规则提供服务。首先,我们得到了传输后时刻队列和服务器内容联合分布的二元概率生成函数。在确定未知概率后,提取出完整的联合分布。我们还得到了随机时刻和到达前时刻的概率分布。本文还讨论了尾部分布的近似值,以便于提高电池损失率。结合一些数值算例对分析过程和结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
×
引用
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学术官方微信