Aysegul Altin – Optimization Online

OSPF Routing with Optimal Oblivious Performance Ratio Under Polyhedral Demand Uncertainty

Published: 2009/01/12

Network Optimization, Robust Optimization, Telecommunications branch-and-price, duality, ecmp, oblivious routing, ospf, traffic engineering, traffic 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: the set of traffic matrices is a polyhedron defined by a set of linear constraints, and the performance of each routing is assessed on … Read more

Provisioning Virtual Private Networks under traffic uncertainty

Published: 2005/02/25

Network Optimization, Robust Optimization, Telecommunications branch-and-price, cutting planes, linear mixed-integer programs, network design, robust optimization, traffic uncertainty, virtual private networks

We investigate a network design problem under traffic uncertainty which arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic matrices, sufficient capacity has to be reserved on the links of the large underlying public network so as to support all … Read more