Bicriteria shortest path in networks of queues (Q861124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bicriteria shortest path in networks of queues |
scientific article; zbMATH DE number 5083697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bicriteria shortest path in networks of queues |
scientific article; zbMATH DE number 5083697 |
Statements
Bicriteria shortest path in networks of queues (English)
0 references
9 January 2007
0 references
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.
0 references
queueing networks
0 references
stochastic routing problems
0 references
0.7876943945884705
0 references
0.7741916179656982
0 references
0.773328423500061
0 references
0.7712932229042053
0 references
