Block cutpoint decomposition for markovian queueing systems

DOI10.1002/ASM.3150040205MaRDI QIDQ3793477zbMATH OpenOpenAlexFDO

Authors Dale R. Fox

Publication date 1988

Published in Applied Stochastic Models and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/asm.3150040205

zbMATH Keywords

Matrix representationsSteady-state probabilitiestransition diagram

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• scientific article; zbMATH DE number 3872446
• scientific article; zbMATH DE number 19242
• Matrix Methods for Queuing Problems
• Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
• Algorithms for finding steady state probabilities for some special classes of finite state Markov chains

Cited in

(5)

• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Enumeration of BC-subtrees of trees
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• Constant time enumeration of weighted trees

This page was built for publication: Block cutpoint decomposition for markovian queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3793477)