Pages that link to "Item:Q2746221"
From MaRDI portal
The following pages link to STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221):
Displaying 8 items.
- On the link between Markovian trees and tree-structured Markov chains (Q1038338) (← links)
- On preemptive-repeat LIFO queues (Q1640074) (← links)
- Solving nonlinear matrix equations arising in tree-like stochastic processes. (Q1874657) (← links)
- Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue (Q2572898) (← links)
- Throughput and delay analysis of an opportunistic tree algorithm (Q2803401) (← links)
- Tree Structured QBD Markov Chains and Tree‐Like QBD Processes (Q4431306) (← links)
- A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure (Q4798100) (← links)
- The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing (Q4819517) (← links)
