Pages that link to "Item:Q1281690"

The following pages link to The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline (Q1281690):

Displayed 9 items.

• On the link between Markovian trees and tree-structured Markov chains (Q1038338) ‎ (← links)
• Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue (Q1579504) ‎ (← links)
• Solving nonlinear matrix equations arising in tree-like stochastic processes. (Q1874657) ‎ (← links)
• Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models (Q1977260) ‎ (← links)
• Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue (Q2572898) ‎ (← links)
• Workload Process, Waiting Times, and Sojourn Times in a Discrete Time<i>MMAP</i>[<i>K</i>]/<i>SM</i>[<i>K</i>]/1/FCFS Queue (Q3157860) ‎ (← links)
• (Q4511445) ‎ (← links)
• A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure (Q4798100) ‎ (← links)
• Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams (Q5462803) ‎ (← links)