小缓冲系统的信息时代
Age of Information for Small Buffer Systems
摘要：
考虑一个消息处理系统，它的目标是产生最新的信息，这是由称为“信息年龄”的量来衡量的。我们在以前的论文中已经论证过，如果允许我们随意设计消息处理策略，我们应该保留一个小的缓冲区，并根据LIFO策略进行操作。在这个小笔记中，我们提供了对P_m系统的AoI的分析，该系统使用大小为m的缓冲区，单个服务器，在没有服务抢占的情况下操作，并以LIFO方式存储消息。稳态AoI的平均值（或均匀分布）的解析表达式是可能的，但需要借助计算机代数。我们解释了m=3的分析。
英文摘要：
Consider a message processing system whose objective is to produce the most current information as measured by the quantity known as "age of information". We have argued in previous papers that if we are allowed to design the message processing policy ad libitum, we should keep a small buffer and operate according to a LIFO policy. In this small note we provide an analysis for the AoI of the P_m system which uses a buffer of size m, a single server, operating without service preemption and in a LIFO manner for stored messages. Analytical expressions for the mean (or even distribution) of the AoI in steady-state are possible but with the aid computer algebra. We explain the the analysis for m=3.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
