基于信息时代视角的非抢占M/M/1/1排队系统动态资源共享

Qisi Zeng, Zhengchuan Chen, Yunjian Jia, Min Wang
{"title":"基于信息时代视角的非抢占M/M/1/1排队系统动态资源共享","authors":"Qisi Zeng, Zhengchuan Chen, Yunjian Jia, Min Wang","doi":"10.1109/iccc52777.2021.9580289","DOIUrl":null,"url":null,"abstract":"Resource allocation for server would significantly affect the timeless of interested status updates in various queuing systems. In this work, we study a non-preemptive M/M/1/1 queueing system with two sources in which updates are forwarded independently to an interested monitor by sharing a communication channel. In order to improve the timeliness of this system under limited service resource, an important policy, dynamic resource sharing policy is proposed which allocates the channel resource for transmission of the arrived update based on the state of the queue. By modeling the queue as a stochastic hybrid system, the closed form of average AoI of the proposed scheme is achieved. Numerical results show that a non-preemptive system with dynamic resources sharing policy can significantly improve the AoI performance compared with benchmark scheme.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dynamic Resource Sharing for Non-preemptive M/M/1/1 Queueing System : An Age of Information Perspective\",\"authors\":\"Qisi Zeng, Zhengchuan Chen, Yunjian Jia, Min Wang\",\"doi\":\"10.1109/iccc52777.2021.9580289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Resource allocation for server would significantly affect the timeless of interested status updates in various queuing systems. In this work, we study a non-preemptive M/M/1/1 queueing system with two sources in which updates are forwarded independently to an interested monitor by sharing a communication channel. In order to improve the timeliness of this system under limited service resource, an important policy, dynamic resource sharing policy is proposed which allocates the channel resource for transmission of the arrived update based on the state of the queue. By modeling the queue as a stochastic hybrid system, the closed form of average AoI of the proposed scheme is achieved. Numerical results show that a non-preemptive system with dynamic resources sharing policy can significantly improve the AoI performance compared with benchmark scheme.\",\"PeriodicalId\":425118,\"journal\":{\"name\":\"2021 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccc52777.2021.9580289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在各种排队系统中,服务器的资源分配会显著影响感兴趣的状态更新的时间。本文研究了一个具有两个源的非抢占式M/M/1/1队列系统,其中更新通过共享通信通道独立转发到感兴趣的监视器。为了在服务资源有限的情况下提高系统的时效性,提出了一种重要的策略——动态资源共享策略,该策略根据队列的状态来分配传输到达更新的通道资源。通过将队列建模为随机混合系统,得到了该方案的平均AoI的封闭形式。数值结果表明,与基准方案相比,采用动态资源共享策略的无抢占系统可以显著提高AoI性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dynamic Resource Sharing for Non-preemptive M/M/1/1 Queueing System : An Age of Information Perspective
Resource allocation for server would significantly affect the timeless of interested status updates in various queuing systems. In this work, we study a non-preemptive M/M/1/1 queueing system with two sources in which updates are forwarded independently to an interested monitor by sharing a communication channel. In order to improve the timeliness of this system under limited service resource, an important policy, dynamic resource sharing policy is proposed which allocates the channel resource for transmission of the arrived update based on the state of the queue. By modeling the queue as a stochastic hybrid system, the closed form of average AoI of the proposed scheme is achieved. Numerical results show that a non-preemptive system with dynamic resources sharing policy can significantly improve the AoI performance compared with benchmark scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Group-oriented Handover Authentication Scheme in MEC-Enabled 5G Networks Joint Task Secure Offloading and Resource Allocation for Multi-MEC Server to Improve User QoE Dueling-DDQN Based Virtual Machine Placement Algorithm for Cloud Computing Systems Predictive Beam Tracking with Cooperative Sensing for Vehicle-to-Infrastructure Communications Age-aware Communication Strategy in Federated Learning with Energy Harvesting Devices
×
引用
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