pith. sign in

Reducing Age-of-Information for Computation-Intensive Messages via Packet Replacement

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

Freshness of data is an important performance metric for real-time applications, which can be measured by age-of-information. For computation-intensive messages, the embedded information is not available until being computed. In this paper, we study the age-of-information for computation-intensive messages, which are firstly transmitted to a mobile edge server, and then processed in the edge server to extract the embedded information. The packet generation follows zero-wait policy, by which a new packet is generated when the last one is just delivered to the edge server. The queue in front of the edge server adopts one-packet-buffer replacement policy, meaning that only the latest received packet is preserved. We derive the expression of average age-of-information for exponentially distributed transmission time and computing time. With packet replacement, the average age is reduced compared with the case without packet replacement, especially when the transmission rate is close to or greater than the computing rate.

fields

cs.IT 2

years

2019 2

verdicts

UNVERDICTED 2

representative citing papers

Timely Cloud Computing: Preemption and Waiting

cs.IT · 2019-07-11 · unverdicted · novelty 6.0

In cloud status updates with i.i.d. random service times, the optimal deterministic policy minimizing long-run average AoI uses a threshold on current age to decide when to upload and a fixed cutoff to preempt long computations, with preemption outperforming waiting for exponential services.

citing papers explorer

Showing 2 of 2 citing papers.

  • Timely Cloud Computing: Preemption and Waiting cs.IT · 2019-07-11 · unverdicted · none · ref 26 · internal anchor

    In cloud status updates with i.i.d. random service times, the optimal deterministic policy minimizing long-run average AoI uses a threshold on current age to decide when to upload and a fixed cutoff to preempt long computations, with preemption outperforming waiting for exponential services.

  • Trading Off Computation with Transmission in Status Update Systems cs.IT · 2019-07-01 · unverdicted · none · ref 27 · internal anchor

    Derives closed-form average and peak AoI for a tandem M/GI/1/1 and GI/M/1/2* queue system with dependent service times between computation and transmission.