Analysis of a discrete-time queue with load dependent service under discrete-time Markovian arrival process |
| |
Institution: | 1. Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India;2. Department of Mathematics, National Institute of Technology, Raipur-492010, India;3. School of Computer Application, KIIT University, Bhubaneswar-751024, India |
| |
Abstract: | In the study of normal queueing systems, the server’s average service times are generally assumed to be constant. However, in numerous applications this assumption may not be valid. To prevent congestion in overload control telecommunication networks, the transmission rates vary depending on the number of packets waiting in the queue. As traffics in telecommunication networks are of bursty nature and correlated, we assume that arrivals follow the discrete-time Markovian arrival process. This paper analyzes a queueing model in which the server changes its service times (rates) only at the beginning of service depending on the number of customers waiting in the queue. We obtain the steady-state probabilities at various epochs and some performance measures. In addition, varieties of numerical results are discussed to display the effect of the system parameters on the performance measures. |
| |
Keywords: | Discrete-time Markovian arrival process Imbedded Markov chain Queue length dependent service Steady-state probability Supplementary variable technique |
本文献已被 ScienceDirect 等数据库收录! |
|