Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Y. Arun Kumar Reddy;T. G Venkatesh
{"title":"Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System","authors":"Y. Arun Kumar Reddy;T. G Venkatesh","doi":"10.1109/TMC.2024.3481062","DOIUrl":null,"url":null,"abstract":"This paper analyzes the Age of Information (AoI), focusing on transmitting status updates from source to destination. We analyze the Age of Information in a system comprised of two heterogeneous servers with exponential distribution parameters <inline-formula><tex-math>$\\mu _{1}$</tex-math></inline-formula> and <inline-formula><tex-math>$\\mu _{2}$</tex-math></inline-formula>, respectively. Our study adopts the stochastic hybrid systems (SHS) methodology to thoroughly assess the system’s performance. We explore various queueing disciplines, including Last-Come-First-Serve (LCFS) with work-conservative and LCFS with probabilistic routing, to accurately quantify AoI and Peak AoI (PAoI) metrics. We have used the Proactive Obsolete Packet Management (POPMAN) approach to identify and discard obsolete packets proactively, thus enhancing server processing efficiency and ensuring orderly packet reception. We also investigate the following parameters, such as the probability of preemption of packets, the probability of packets getting obsolete, the probability of informative packets, and optimal splitting probabilities. Results show an improvement in both AoI and PAoI within the LCFS with work-conservative queueing system with the integration of the POPMAN method. Furthermore, LCFS with probabilistic routing using the POPMAN approach performs similarly to conventional methods. In all the queueing systems studied, as the arrival rate <inline-formula><tex-math>$\\lambda \\to \\infty$</tex-math></inline-formula>, the average AoI and PAoI approach <inline-formula><tex-math>$1/(\\mu _{1}+\\mu _{2})$</tex-math></inline-formula>. For c servers, they approach <inline-formula><tex-math>$1/(\\mu _{1}+\\mu _{2}+\\cdots +\\mu _{c})$</tex-math></inline-formula>.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"1513-1529"},"PeriodicalIF":7.7000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10716803/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper analyzes the Age of Information (AoI), focusing on transmitting status updates from source to destination. We analyze the Age of Information in a system comprised of two heterogeneous servers with exponential distribution parameters $\mu _{1}$ and $\mu _{2}$, respectively. Our study adopts the stochastic hybrid systems (SHS) methodology to thoroughly assess the system’s performance. We explore various queueing disciplines, including Last-Come-First-Serve (LCFS) with work-conservative and LCFS with probabilistic routing, to accurately quantify AoI and Peak AoI (PAoI) metrics. We have used the Proactive Obsolete Packet Management (POPMAN) approach to identify and discard obsolete packets proactively, thus enhancing server processing efficiency and ensuring orderly packet reception. We also investigate the following parameters, such as the probability of preemption of packets, the probability of packets getting obsolete, the probability of informative packets, and optimal splitting probabilities. Results show an improvement in both AoI and PAoI within the LCFS with work-conservative queueing system with the integration of the POPMAN method. Furthermore, LCFS with probabilistic routing using the POPMAN approach performs similarly to conventional methods. In all the queueing systems studied, as the arrival rate $\lambda \to \infty$, the average AoI and PAoI approach $1/(\mu _{1}+\mu _{2})$. For c servers, they approach $1/(\mu _{1}+\mu _{2}+\cdots +\mu _{c})$.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信