Pages that link to "Item:Q4267514"

The following pages link to The quasi-birth-death type markov chain with a tree structure (Q4267514):

Displaying 10 items.

• Analyzing priority queues with 3 classes using tree-like processes (Q854994) (← links)
• QBD Markov chains on binomial-like trees and its application to multilevel feedback queues (Q928194) (← links)
• 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)
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221) (← links)
• Throughput and delay analysis of an opportunistic tree algorithm (Q2803401) (← links)
• Tree Structured QBD Markov Chains and Tree‐Like QBD Processes (Q4431306) (← links)
• Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline (Q4511445) (← links)
• Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams (Q5462803) (← links)