Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Y. Arun Kumar Reddy

dblp:397/5373 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0002-0924-3888ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 39% Network performance modeling · 30% Edge and fog computing · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
age of information
0.912025
Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System · IEEE Trans. Mob. Comput. 2025
Edge and fog computing › edge server
heterogeneous edge servers
0.912025
Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System · IEEE Trans. Mob. Comput. 2025
Network performance modeling
queueing analysis
0.912025
Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System · IEEE Trans. Mob. Comput. 2025
Internet of things and sensor networks
status update
0.312025
Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System · IEEE Trans. Mob. Comput. 2025

Methods — techniques the papers use, named apart from their topics

stochastic hybrid systems · 0.9probabilistic routing · 0.9
YearPublicationVenuePosition
2025 Proactive Obsolete Packet Management Based Analysis of Age of Information for LCFS Heterogeneous Queueing System
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})$.
Y. Arun Kumar Reddy, T. G. Venkatesh 0001
IEEE Trans. Mob. Comput.1