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.
Highlights
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
"network flow equations" which as he claimed are a first step towards obtaining higher moments of sojourn times for customers in networks of queues
Nothing is said in this expressions about the customer’s itinerary through the network. It is the purpose of this paper to sketch how these network flow equations can be obtained from "splitting formulas" for passage time distributions which are previously obtained, at the same time generalizing LEMOINE’s result to the case of JACKSON networks with multiserver nodes
Summary
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. Lecently, LEMOINE [3] derived for JACKSON networks of single server nodes a set of
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
