Received samples of a stochastic process are processed by a server for delivery as updates to a monitor. Each sample belongs to a class that specifies a distribution for its processing time and a function that describes how the value of the processed update decays with age at the monitor. The class of a sample is identified when the processed update is delivered. The server implements a form of M/G/1/1 blocking queue; samples arriving at a busy server are discarded and samples arriving at an idle server are subject to an admission policy that depends on the age and class of the prior delivered update. For the delivered updates, we characterize the average age of information (AoI) and average value of information (VoI). We derive the optimal stationary policy that minimizes the convex combination of the AoI and (negative) VoI. It is shown that the policy has a threshold structure, in which a new sample is allowed to arrive to the server only if the previous update's age and value difference surpasses a certain threshold that depends on the specifics of the value function and system statistics.

翻译：随机过程的接收样本由服务器处理，以作为更新发送至监控器。每个样本属于一个类别，该类别规定了其处理时间的分布，并定义了一个描述已处理更新在监控器端价值随年龄衰减的函数。样本的类别在已处理更新被交付时确定。服务器采用一种M/G/1/1阻塞队列机制：到达繁忙服务器的样本将被丢弃，而到达空闲服务器的样本则需遵循一项准入策略，该策略取决于先前已交付更新的年龄与类别。针对已交付的更新，我们刻画了平均信息年龄（AoI）与平均信息价值（VoI）。我们推导了最小化AoI与（负向）VoI凸组合的最优平稳策略。研究表明，该策略具有阈值结构：仅当先前更新的年龄与价值差异超过某一特定阈值时，才允许新样本进入服务器，该阈值取决于价值函数的具体形式与系统统计特性。