Sojourn-time Analysis on Congestion in DBMAP/DMSP/1/K Queue
This paper applies a matrix-analytic approach to analyze the sojourn-time statistics and the temporal behavior of finite bu.er single server queue with discrete-time batch Markovian arrival process (DBMAP). The service process is correlated and its structure is presented through discrete-time Markovian service process (DMSP). We examine the temporal behavior of packet loss by means of conditional statistics with respect to congested and non-congested periods that occur in an alternating manner. The congested period corresponds to having more than a certain number of packets in the buffer of router; non-congested corresponds to the opposite. All of the three related performance measurement are derived,including probability distributions of a congested and non-congested period,and the packet loss probability during congested period.
Matrix-analytic method ojourn-time Congested period and non-congested period discrete-time batch Markovian arrival process Discrete-time Markovian service process
Yung-Chung Wang Chih-Ta Chiu
EE, National Taipei University of Technology 1,Sec.3,Chung-Hsiao E.Rd. Taipei 10608,Taiwan EE, National Taipei University of Technology 1,Sec.3,Chung-Hsiao E. Rd.Taipei 10608,Taiwan
国际会议
北京
英文
216-219
2010-07-24（万方平台首次上网日期，不代表论文的发表时间）