Bicriteria shortest path in networks of queues (Q861124): Difference between revisions

The paper develops a polynomial algorithm to find the shortest path from the source to the sink node of a network of queues in the steady state. It is assumed that some nodes of the network contain service stations including either one or infinite servers with general distribution of service time. The arc lengths among the service stations are assumed to be independent random variables with general distribution functions. It is also proved that the defined utility function satisfies the monotonicity assumption.