An M/M/1 queue in a semi-Markovian environment
نویسندگان
چکیده
!" $#% & (') +* , -* $# ( !. /103254 6 -* ( !. /7 8 9!. : ; 1 < = >/%?5 @# /A +/B 6 !" $# & @ (') +* C ( 1 ( D?9 $/B4E (<: $/B B =E @F ( G/( !. : /B < /( H IKJ)LNMPOQ ,ISR LNMPOA0G ,4 T , /A @/B UWVYX-Z1 [\ /B !. B . @ (
منابع مشابه
Analyses of a Markovian queue with two heterogeneous servers and working vacation
This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملCommuting matrices in the queue length and sojourn time analysis of MAP/MAP/1 queues
Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...
متن کاملProcessor-sharing and Random-service Queues with Semi-markovian Arrivals
We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...
متن کامل