On network flow equations and splitting formulas for Sojourn times in queueing networks

Hans Daduna

International Journal of Stochastic Analysis, 1991, vol. 4, 1-6

Abstract:

LEMOINE's network flow equations are generalized to the case of multiserver networks. These equations provide a basis for recursive evaluation of residual conditional sojourn time moments.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/4/846217.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/4/846217.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:846217

DOI: 10.1155/S1048953391000072

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().