Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

The quasi-birth-death type markov chain with a tree structure

4 references·4 citing·25 second hop

FromToDepth

this work references cited by second hop

References

1993A logarithmic reduction algorithm for quasi-birth-death processes391 cited
1990A duality theorem for the matrix paradigms in queueing theory90 cited
1994Matrix product-form solutions for Markov chains with a tree structure60 cited
1995A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure55 cited

Cited by

2001STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN37 cited
2003Tree Structured QBD Markov Chains and Tree‐Like QBD Processes27 cited
2010Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains26 cited
2006Analyzing priority queues with 3 classes using tree-like processes15 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work