Age of Information in a Network of Preemptive Servers

March 21, 2018 Β· Declared Dead Β· πŸ› Conference on Computer Communications Workshops

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Roy D. Yates arXiv ID 1803.07993 Category cs.IT: Information Theory Cross-listed cs.NI Citations 109 Venue Conference on Computer Communications Workshops Last Checked 4 months ago
Abstract
A source submits status updates to a network for delivery to a destination monitor. Updates follow a route through a series of network nodes. Each node is a last-come-first-served queue supporting preemption in service. We characterize the average age of information at the input and output of each node in the route induced by the updates passing through. For Poisson arrivals to a line network of preemptive memoryless servers, we show that average age accumulates through successive network nodes.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted