On the Strong Approximation for a Simple Reentrant Line in Light Traffic Under First-buffer First-served Service Discipline  

作　　者：Kai-ming YANG Yong-jiang GUO 

机构地区：[1]School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China

出　　处：《Acta Mathematicae Applicatae Sinica》2024年第3期823-839,共17页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.11871116 and No.11971074);by the Fundamental Research Funds for the Central Universities(No.2023ZCJH02)。

摘　　要：For a 2-station and 3-class reentrant line under first-buffer first-served(FBFS)service discipline in light traffic,we firstly construct the strong approximations for performance measures including the queue length,workload,busy time and idle time processes.Based on the obtained strong approximations,we use a strong approximation method to find all the law of the iterated logarithms(LILs)for the above four performance measures,which are expressed as some functions of system parameters:means and variances of interarrival and service times,and characterize the fluctuations around their fluid approximations.

关 键 词：reentrant line queueing network FBFS service discipline strong approximation LIL Brownian motion 

分 类 号：O226[理学—运筹学与控制论]