Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems

IF 0.5 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS Problems of Information Transmission Pub Date : 2023-12-01 DOI:10.1134/s003294602304004x
{"title":"Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems","authors":"","doi":"10.1134/s003294602304004x","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>We propose an approach for generalization of formulas previously obtained by the authors for the first and second queue length moments in a queueing system with a nonordinary Poissonian arrival flow, single server, and constant service time to the case of a variable service time. The service time is assumed to be a random variable with a finite set of values. This model is adequate for a vast class of batch transmission systems, since the batch transmission time in real-world systems can take only finitely many values.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Transmission","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s003294602304004x","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

We propose an approach for generalization of formulas previously obtained by the authors for the first and second queue length moments in a queueing system with a nonordinary Poissonian arrival flow, single server, and constant service time to the case of a variable service time. The service time is assumed to be a random variable with a finite set of values. This model is adequate for a vast class of batch transmission systems, since the batch transmission time in real-world systems can take only finitely many values.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
电信系统中批量队列的非平凡泊松到达条件下队列长度矩公式的一般化
摘要 我们提出了一种方法,将作者以前获得的非平凡泊松到达流、单服务器和服务时间恒定的排队系统中的第一和第二排队长度矩公式推广到服务时间可变的情况。假设服务时间是一个具有有限值集的随机变量。这个模型适用于大量的批量传输系统,因为现实世界中的批量传输时间只能取有限多个值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Problems of Information Transmission
Problems of Information Transmission 工程技术-计算机:理论方法
CiteScore
2.00
自引率
25.00%
发文量
10
审稿时长
>12 weeks
期刊介绍: Problems of Information Transmission is of interest to researcher in all fields concerned with the research and development of communication systems. This quarterly journal features coverage of statistical information theory; coding theory and techniques; noisy channels; error detection and correction; signal detection, extraction, and analysis; analysis of communication networks; optimal processing and routing; the theory of random processes; and bionics.
期刊最新文献
Prediction of Locally Stationary Data Using Expert Advice Correcting a Single Error in an Asymmetric Feedback Channel Computation of the Fundamental Limits of Data Compression for Certain Nonstationary ARMA Vector Sources On Measuring the Topological Charge of Anyons Elementary Solution to the Fair Division Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1