Bicriteria shortest path in networks of queues
Copyright policy )Bicriteria shortest path in networks of queues
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.
- University College Cork Ireland
Stochastic network models in operations research, queueing networks, Applications of Markov renewal processes (reliability, queueing networks, etc.), Queues and service in operations research, stochastic routing problems, Queueing theory (aspects of probability theory)
Stochastic network models in operations research, queueing networks, Applications of Markov renewal processes (reliability, queueing networks, etc.), Queues and service in operations research, stochastic routing problems, Queueing theory (aspects of probability theory)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!