Investigation of Queueing Systems with a Polya Arrival Process

Seferin Mirtchev
{"title":"Investigation of Queueing Systems with a Polya Arrival Process","authors":"Seferin Mirtchev","doi":"10.1109/TELECOM50385.2020.9299550","DOIUrl":null,"url":null,"abstract":"The random processes in the telecommunications networks are intensively studied for many decades. In this paper for different teletraffic systems with peaked arrival flow described by the Polya distribution - multi-server queueing system with an infinite number of servers and single-server queue with infinite waiting position at constant service time and at general distributed service time are investigated. Results for the state probabilities and for the mean waiting time are presented, and new formulas for the busy period are derived.","PeriodicalId":300010,"journal":{"name":"2020 28th National Conference with International Participation (TELECOM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 28th National Conference with International Participation (TELECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELECOM50385.2020.9299550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The random processes in the telecommunications networks are intensively studied for many decades. In this paper for different teletraffic systems with peaked arrival flow described by the Polya distribution - multi-server queueing system with an infinite number of servers and single-server queue with infinite waiting position at constant service time and at general distributed service time are investigated. Results for the state probabilities and for the mean waiting time are presented, and new formulas for the busy period are derived.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有Polya到达过程的排队系统研究
几十年来,人们对电信网络中的随机过程进行了深入的研究。本文研究了在固定服务时间和一般分布式服务时间下,具有无限服务器数量的多服务器排队系统和具有无限等待位置的单服务器排队系统。给出了状态概率和平均等待时间的计算结果,并导出了新的繁忙时段计算公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Investigation of Queueing Systems with a Polya Arrival Process [Copyright notice] Exploring the Congestion Level Index for Defining the QoS Performance Profile of Internet Paths Simulation Investigation of a Power Amplifier Circuit for Measurements of Power Losses in Soft Magnetic Materials Computational Complexity Analysis of Cognitive Radio using PCA with Various Clustering Methods
×
引用
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