{"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}
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.