Performance evaluation of finite-source Cognitive Radio Networks with impatient customers

IF 0.3 Q4 MATHEMATICS Annales Mathematicae et Informaticae Pub Date : 2020-01-01 DOI:10.33039/ami.2020.07.004
M. Zaghouani, J. Sztrik
{"title":"Performance evaluation of finite-source Cognitive Radio Networks with impatient customers","authors":"M. Zaghouani, J. Sztrik","doi":"10.33039/ami.2020.07.004","DOIUrl":null,"url":null,"abstract":"The current paper takes into consideration a cognitive radio network with impatient customers, by the help of finite-source retrial queueing system. We consider two different types of customers (Primary and Secondary) assigned to two interconnected frequency bands. A first frequency band with a priority queue and a second one with an orbit, both are respectively dedicated for the Primary Users (PUs) and Secondary Users (SUs). In case the servers are busy, both customers (Licensed and Unlicensed) join either the queue or the orbit. Before joining the orbit, secondary customers receive a random retrial time according to Exponential distribution, which is the holding time before the next retry. Unlicensed users (impatient) are obliged to leave the system once their total waiting time exceeds a given maximum waiting time. The novelty of this work is the investigation of the abandonment and its impact on several performance measures of the system such as the mean response time and waiting time of users, probability of abandonment of SU, etc. Several figures illustrate the problem in question by the help of simulation.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"244 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae et Informaticae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/ami.2020.07.004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 4

Abstract

The current paper takes into consideration a cognitive radio network with impatient customers, by the help of finite-source retrial queueing system. We consider two different types of customers (Primary and Secondary) assigned to two interconnected frequency bands. A first frequency band with a priority queue and a second one with an orbit, both are respectively dedicated for the Primary Users (PUs) and Secondary Users (SUs). In case the servers are busy, both customers (Licensed and Unlicensed) join either the queue or the orbit. Before joining the orbit, secondary customers receive a random retrial time according to Exponential distribution, which is the holding time before the next retry. Unlicensed users (impatient) are obliged to leave the system once their total waiting time exceeds a given maximum waiting time. The novelty of this work is the investigation of the abandonment and its impact on several performance measures of the system such as the mean response time and waiting time of users, probability of abandonment of SU, etc. Several figures illustrate the problem in question by the help of simulation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有不耐烦客户的有限源认知无线网络性能评价
本文利用有限源重新排队系统,研究了具有不耐烦顾客的认知无线电网络。我们考虑分配给两个相互连接的频带的两种不同类型的客户(主要和次要)。带优先级队列的第一个频带和带轨道的第二个频带分别专用于主用户(pu)和辅助用户(su)。在服务器繁忙的情况下,两个客户(许可的和未许可的)都加入队列或轨道。在加入轨道之前,二级客户根据指数分布获得随机的重试时间,这是下一次重试前的等待时间。一旦他们的总等待时间超过给定的最大等待时间,未经许可的用户(不耐烦)就必须离开系统。这项工作的新颖之处在于调查了放弃及其对系统的几个性能指标的影响,如用户的平均响应时间和等待时间,SU的放弃概率等。有几个数字借助模拟说明了所讨论的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
0
期刊最新文献
Using irreducible polynomials for random number generation Solving Hungarian natural language processing tasks with multilingual generative models Stability condition of multiclass classical retrials: a revised regenerative proof Sensitivity analysis of a single server finite-source retrial queueing system with two-way communication and catastrophic breakdown using simulation On the generalized Fibonacci like sequences and matrices
×
引用
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