论处理器共享系统的信息时代

IF 2.9 3区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Communications and Networks Pub Date : 2023-10-01 DOI:10.23919/JCN.2023.000042

Benat Gandarias;Josu Doncel;Mohamad Assaad

{"title":"论处理器共享系统的信息时代","authors":"Benat Gandarias;Josu Doncel;Mohamad Assaad","doi":"10.23919/JCN.2023.000042","DOIUrl":null,"url":null,"abstract":"In this paper, we examine the age of information (AoI) of a source sending status updates to a monitor through a queue operating under the processor sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service. While AoI has been well studied for various queuing models and policies, less attention has been given so far to the PS discipline. We first consider the M/M/1/2 queue with and without preemption and provide closed-form expressions for the average AoI in this case. We overcome the challenges of deriving the AoI expression by employing the stochastic hybrid systems (SHS) tool. We then extend the analysis to the M/M/1 queue with one and two sources and provide numerical results for these cases. Our results show that PS can outperform the M/M/1/1∗ queue in some cases.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323427","citationCount":"0","resultStr":"{\"title\":\"On the age of information of processor sharing systems\",\"authors\":\"Benat Gandarias;Josu Doncel;Mohamad Assaad\",\"doi\":\"10.23919/JCN.2023.000042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we examine the age of information (AoI) of a source sending status updates to a monitor through a queue operating under the processor sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service. While AoI has been well studied for various queuing models and policies, less attention has been given so far to the PS discipline. We first consider the M/M/1/2 queue with and without preemption and provide closed-form expressions for the average AoI in this case. We overcome the challenges of deriving the AoI expression by employing the stochastic hybrid systems (SHS) tool. We then extend the analysis to the M/M/1 queue with one and two sources and provide numerical results for these cases. Our results show that PS can outperform the M/M/1/1∗ queue in some cases.\",\"PeriodicalId\":54864,\"journal\":{\"name\":\"Journal of Communications and Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323427\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Communications and Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10323427/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10323427/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们研究了在处理器共享(PS)规则下通过队列向监视器发送状态更新的源的信息年龄(AoI)。在PS排队规则中，所有更新都是同时提供的，因此，没有任何作业在队列中等待获得服务。虽然AoI已经在各种排队模型和策略中得到了很好的研究，但迄今为止对PS学科的关注较少。我们首先考虑具有和不具有抢占的M/M/1/2队列，并为这种情况下的平均AoI提供封闭形式表达式。我们利用随机混合系统(SHS)工具克服了推导AoI表达式的挑战。然后，我们将分析扩展到具有一个和两个源的M/M/1队列，并为这些情况提供数值结果。我们的结果表明，在某些情况下，PS可以优于M/M/1/1∗队列。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the age of information of processor sharing systems

In this paper, we examine the age of information (AoI) of a source sending status updates to a monitor through a queue operating under the processor sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service. While AoI has been well studied for various queuing models and policies, less attention has been given so far to the PS discipline. We first consider the M/M/1/2 queue with and without preemption and provide closed-form expressions for the average AoI in this case. We overcome the challenges of deriving the AoI expression by employing the stochastic hybrid systems (SHS) tool. We then extend the analysis to the M/M/1 queue with one and two sources and provide numerical results for these cases. Our results show that PS can outperform the M/M/1/1∗ queue in some cases.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Communications and Networks 工程技术-电信学

CiteScore

6.60

自引率

5.60%

发文量

审稿时长

14.4 months

期刊介绍： The JOURNAL OF COMMUNICATIONS AND NETWORKS is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks. Theoretical research contributions presenting new techniques, concepts, or analyses, applied contributions reporting on experiences and experiments, and tutorial expositions of permanent reference value are welcome. The subjects covered by this journal include all topics in communication theory and techniques, communication systems, and information networks. COMMUNICATION THEORY AND SYSTEMS WIRELESS COMMUNICATIONS NETWORKS AND SERVICES.