Pages that link to "Item:Q1579504"

The following pages link to Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue (Q1579504):

Displaying 6 items.

• Marked Markovian arrivals in a tandem G-network with blocking (Q1041300) (← links)
• Analysis of MAP(1), MAP(2)/ PH/ 1 non-preemptive priority queueing model under classical retrial policy with breakdown, repair, discouragement, single vacation, standby server, negative arrival and impatient customers (Q2114634) (← links)
• A multiple warm standby system with operational and repair times following phase-type distributions (Q2569107) (← links)
• Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue (Q2572898) (← links)
• Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline (Q4511445) (← links)
• A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure (Q4798100) (← links)