Now showing items 1-2 of 2
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
We study the best OSPF style routing problem in telecommunication networks, where weight management is employed to get a routing configuration with the minimum oblivious ratio. We consider polyhedral demand uncertainty: ...
Optimal oblivious routing under linear and ellipsoidal uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilization) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into ...