Optimal routing for multiclass networks (Q666417)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6013017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal routing for multiclass networks |
scientific article; zbMATH DE number 6013017 |
Statements
Optimal routing for multiclass networks (English)
0 references
8 March 2012
0 references
Summary: Overall optimal routing is considered along with individually optimal routing for networks with nodes interconnected in a generally configured manner and with multiple classes of users. The two problems are formulated, and we discuss the mutual equivalence between the problems, the existence and uniqueness of solutions, and the relation between the formulations with path and link flow patterns. We show that a link-traffic loop-free property holds within each class for both individually and overall optimal routing for a wide range of networks, and we show the condition that characterizes the category of networks for which the property holds.
0 references
0 references
0 references
0.821609377861023
0 references
0.7915274500846863
0 references
0.787017822265625
0 references
