OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694)
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: OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty |
scientific article; zbMATH DE number 6218679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty |
scientific article; zbMATH DE number 6218679 |
Statements
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (English)
0 references
24 October 2013
0 references
OSPF
0 references
oblivious routing
0 references
traffic engineering
0 references
ECMP
0 references
branch-and-price
0 references
traffic uncertainty
0 references
0 references
0.891153872013092
0 references
0.8713406920433044
0 references
0.8027379512786865
0 references
0.8017945885658264
0 references
0.7844738960266113
0 references
