{"title":"论 \"先缓冲先服务 \"纪律下轻度交通中简单重入线的强近似值","authors":"Kai-ming Yang, Yong-jiang Guo","doi":"10.1007/s10255-024-1093-8","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Strong Approximation for a Simple Reentrant Line in Light Traffic Under First-buffer First-served Service Discipline\",\"authors\":\"Kai-ming Yang, Yong-jiang Guo\",\"doi\":\"10.1007/s10255-024-1093-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10255-024-1093-8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10255-024-1093-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Strong Approximation for a Simple Reentrant Line in Light Traffic Under First-buffer First-served Service Discipline
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.