IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v113y2002i1p141-15410.1023-a1020914029651.html
   My bibliography  Save this article

A Product Theorem for Markov Chains with Application to PF-Queueing Networks

Author

Listed:
  • G.Sh. Tsitsiashvili
  • M.A. Osipova
  • N.V. Koliev
  • D. Baum

Abstract

Queueing networks in random environments represent more realistic models of computer and telecommunication systems than classical product form networks. This is due to the fact that network behaviour often depends on human activities which may vary according to daytime dependent behavioural patterns as well as physiological and mental indexes. In this paper we establish a product connection theorem for Markov chains which contains some corresponding results for spatial processes as well as for queueing networks in random environment as special cases. We demonstrate how our results can be applied to construct an adequate model for wireless networks with hook up capacity. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • G.Sh. Tsitsiashvili & M.A. Osipova & N.V. Koliev & D. Baum, 2002. "A Product Theorem for Markov Chains with Application to PF-Queueing Networks," Annals of Operations Research, Springer, vol. 113(1), pages 141-154, July.
    • Handle: RePEc:spr:annopr:v:113:y:2002:i:1:p:141-154:10.1023/a:1020914029651
    DOI: 10.1023/A:1020914029651
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020914029651
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1020914029651?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Balsamo, Simonetta & Marin, Andrea, 2013. "Separable solutions for Markov processes in random environments," European Journal of Operational Research, Elsevier, vol. 229(2), pages 391-403.
    2. Alexander Zeifman & Yacov Satin & Ksenia Kiseleva & Victor Korolev, 2019. "On the Rate of Convergence for a Characteristic of Multidimensional Birth-Death Process," Mathematics, MDPI, vol. 7(5), pages 1-10, May.

    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:spr:annopr:v:113:y:2002:i:1:p:141-154:10.1023/a:1020914029651. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.