Minimum hop flow assignment and routing subject to an average message delay constraint (Q792210)
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: Minimum hop flow assignment and routing subject to an average message delay constraint |
scientific article; zbMATH DE number 3852761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum hop flow assignment and routing subject to an average message delay constraint |
scientific article; zbMATH DE number 3852761 |
Statements
Minimum hop flow assignment and routing subject to an average message delay constraint (English)
0 references
1983
0 references
Flow assignment and routing problems for message-switched communication networks are considered. The particular problem to be addressed is one of minimizing the average number of hops subject to the average message delay constraint. The presented method is a centralized one and is based on the flow deviation method.
0 references
minimization of the average number of hops
0 references
flow assignment
0 references
routing
0 references
message-switched communication networks
0 references
0.7847087979316711
0 references
0.7634486556053162
0 references
