The forwarding index of directed networks (Q1923618)
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: The forwarding index of directed networks |
scientific article; zbMATH DE number 933128
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The forwarding index of directed networks |
scientific article; zbMATH DE number 933128 |
Statements
The forwarding index of directed networks (English)
0 references
9 October 1996
0 references
In an \(n\)-node digraph, a routing is defined as a set of \(n(n-1)\) paths specified for all ordered pairs of nodes of the digraph, one path for each pair. The load of a node is the number of paths going through it. The forwarding index of the digraph is the minimum of the largest load taken over all routings. The paper gives upper bounds on the forwarding index in \(k\)-connected digraphs and in digraphs with half-degrees at least \(k\).
0 references
connectivity
0 references
digraph
0 references
routing
0 references
paths
0 references
forwarding index
0 references
