OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty

Simple item page
dc.citation.epage422en_US
dc.citation.issueNumber3en_US
dc.citation.spage395en_US
dc.citation.volumeNumber11en_US
dc.contributor.authorAltın, A.en_US
dc.contributor.authorBelotti, P.en_US
dc.contributor.authorPınar, M. Ç.en_US
dc.date.accessioned2016-02-08T10:00:36Z
dc.date.available2016-02-08T10:00:36Z
dc.date.issued2010en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe 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 a routing is sought with a fair performance for any feasible traffic matrix in the polyhedron. The problem accurately reflects real world networks, where demands can only be estimated, and models one of the main traffic forwarding technologies, Open Shortest Path First (OSPF) routing with equal load sharing. This is an NP-hard problem as it generalizes the problem with a fixed demand matrix, which is also NP-hard. We prove that the optimal oblivious routing under polyhedral traffic uncertainty on a non-OSPF network can be obtained in polynomial time through Linear Programming. Then we consider the OSPF routing with equal load sharing under polyhedral traffic uncertainty, and present a compact mixed-integer linear programming formulation with flow variables. We propose an alternative formulation and a branch-and-price algorithm. Finally, we report and discuss test results for several network instances.en_US
dc.identifier.doi10.1007/s11081-009-9098-yen_US
dc.identifier.eissn1573-2924
dc.identifier.issn1389-4420
dc.identifier.urihttp://hdl.handle.net/11693/22474
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s11081-009-9098-yen_US
dc.source.titleOptimization and Engineeringen_US
dc.subjectOSPFen_US
dc.subjectOblivious routingen_US
dc.subjectTraffic engineeringen_US
dc.subjectECMPen_US
dc.subjectBranch-and-priceen_US
dc.subjectTraffic uncertaintyen_US
dc.titleOSPF routing with optimal oblivious performance ratio under polyhedral demand uncertaintyen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
OSPF_routing_with_optimal_oblivious_performance_ratio_under_polyhedral_demand_uncertainty.pdf
Size:
653.43 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Industrial Engineering