本文研究了一个非强占静态优先权first—buffer—first—served(FBFS)服务规则下的re-entrantline排队网络.文章首先建立了一个极限定理,后通过分析队长和斜反射映射的关系,建立了队长过程和闲期过程的扩散逼近.
A re-entrant line under non-preemptive first-buffer-first-served (FBFS) service discipline is considered in this paper. Firstly a limit theorem is proved. This, together with the relation between the queue length and oblique reflection mapping, shows the diffusion approximation characterized by the queue length and the workload processes.