标题： 累积优先级Lévy队列中的最低优先级等待时间分布 显示英文标题

标题： Lowest priority waiting time distribution in an accumulating priority Lévy queue

摘要： 本文提出了一种新的方法，用于推导具有正Lévy输入的累积优先级（AP）队列中最低类别的等待时间分布。 非原子客户（粒子）的优先级是其类别和在系统中等待时间的函数，优先级最高的粒子将被下一个处理。 该方法依赖于工作量超越过程的构建，并使用适当停止时间解决一个首次通过时间问题。 显示英文摘要

摘要： This paper presents a new method for deriving the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive L\'evy input. The priority of a non-atomic customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. The method relies on the construction of a workload overtaking process and solving a first-passage time problem using an appropriate stopping time.