A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Optimal oblivious routing under linear and ellipsoidal uncertainty
Abstract 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 account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic demands. We present two models to compute, in polynomial time, the optimal oblivious routing: a linear model to deal with demands bounded by box constraints, and a second-order conic program to deal with ellipsoidal uncertainty, i.e., when a mean-variance description of the traffic demand is given. A comparison between the optimal oblivious routing and the well-known ospf routing technique on a set of real-world networks shows that, for different levels of uncertainty, optimal oblivious routing has a substantially better performance than ospf routing.
Optimal oblivious routing under linear and ellipsoidal uncertainty
Abstract 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 account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic demands. We present two models to compute, in polynomial time, the optimal oblivious routing: a linear model to deal with demands bounded by box constraints, and a second-order conic program to deal with ellipsoidal uncertainty, i.e., when a mean-variance description of the traffic demand is given. A comparison between the optimal oblivious routing and the well-known ospf routing technique on a set of real-world networks shows that, for different levels of uncertainty, optimal oblivious routing has a substantially better performance than ospf routing.
Optimal oblivious routing under linear and ellipsoidal uncertainty
Belotti, Pietro (author) / Pınar, Mustafa Ç. (author)
2007
Article (Journal)
English
Optimal oblivious routing under linear and ellipsoidal uncertainty
| Springer Verlag | 2007
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
| Springer Verlag | 2009
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
| Online Contents | 2009
Oblivious-transfer amplification
| UB Braunschweig | 2007