REVIEW 1 cited by
Peak Age of Information under Tandem of Queues
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper considers a communication system where a source sends time-sensitive information to its destination via queues in tandem. We assume that the arrival process as well as the service process (of each server) are memoryless, and each of the servers has no buffer. For this setup, we develop a recursive framework to characterize the mean peak age of information (PAoI) under preemptive and non-preemptive policies with $N$ servers having different service rates. For the preemptive case, the proposed framework also allows to obtain mean age of information (AoI).
Forward citations
Cited by 1 Pith paper
-
MCPEval: Automatic MCP-based Deep Evaluation for AI Agent Models
MCPEval is an automated MCP-based framework that generates, verifies, and scores LLM agent tool-use tasks; its experiments reveal a consistent gap between how well agents execute tool calls and how well they synthesiz...
Discussion (0). Continue with ORCID to comment.