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

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

0.00 Avg rating0 Votes
Article ID: iaor19932374
Country: United States
Volume: 4
Issue: 2
Start Page Number: 111
End Page Number: 116
Publication Date: Jun 1991
Journal: Journal of Applied Mathematics and Stochastic Analysis
Authors:
Keywords: queues: theory
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.

Reviews

Required fields are marked *. Your email address will not be published.