Now showing items 1-3 of 3

    • Optimal oblivious routing under linear and ellipsoidal uncertainty 

      Belotti, P.; Pınar, M. Ç. (Springer, 2008)
      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 ...
    • OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty 

      Altın, A.; Belotti, P.; Pınar, M. Ç. (Springer, 2010)
      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: ...
    • Provisioning virtual private networks under traffic uncertainty 

      Altın, Ayşegül; Amaldi, E.; Belotti, P.; Pınar, Mustafa Çelebi (Wiley, 2007)
      We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic ...