THE RECURSIVE SOLUTION OF QUEUE LENGTH FOR Geo/G/1 QUEUE WITH N-POLICY  

作　　者：Chuanyi LUO Yinghui TANG Wei LI Kaili XIANG 

机构地区：[1]School of Economic Mathematics,Southwestern University of Finance and Economics [2]School of Mathematics and Software Science,Sichuan Normal University

出　　处：《Journal of Systems Science & Complexity》2012年第2期293-302,共10页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant No.70871084;The Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001;a grant from the "project 211(PhaseⅢ)" of the Southwestern University of Finance and Economics, Scientific Research Fund of Southwestern University of Finance and Economics

摘　　要：This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n^-,n^+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n^-,n^+,n and departure epoch D_n).

关 键 词：Discrete-time queue N-POLICY recursive expression stochastic decomposition. 

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