IDEAS home Printed from https://ideas.repec.org/a/wly/apsmda/v4y1988i2p101-114.html
   My bibliography  Save this article

Block cutpoint decomposition for markovian queueing systems

Author

Listed:
  • Dale R. Fox

Abstract

Steady‐state probabilities of Markov Processes are computed by enumerating subgraphs of the transition diagram of the process. The presence of cutpoints in the transition diagram allows for decomposition of the problem into smaller components. Examples from queueing theory are presented. Matrix representations for these structures are also discussed.

Suggested Citation

  • Dale R. Fox, 1988. "Block cutpoint decomposition for markovian queueing systems," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 4(2), pages 101-114, June.
  • Handle: RePEc:wly:apsmda:v:4:y:1988:i:2:p:101-114
    DOI: 10.1002/asm.3150040205
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asm.3150040205
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asm.3150040205?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yu Yang & An Wang & Hua Wang & Wei-Ting Zhao & Dao-Qiang Sun, 2019. "On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution," Mathematics, MDPI, vol. 7(5), pages 1-19, May.
    2. Li, Long & Yang, Yu & Hui, Zhi-hao & Jin, Bang-Bang & Wang, Hua & Fahad, Asfand & Zhang, Heng, 2024. "Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 462(C).
    3. Yu Yang & Long Li & Wenhu Wang & Hua Wang, 2020. "On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs," Mathematics, MDPI, vol. 9(1), pages 1-29, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmda:v:4:y:1988:i:2:p:101-114. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-0747 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.