OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
type: Item
instance of: scholarly article
title: OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
zbMATH Open document ID: 1273.90038
author: Ayşegül Altın
author: Pietro Belotti
author: Mustafa Ç. Pınar
published in: Optimization and Engineering
publication date: 2013-10-24T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/22474
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6218679
zbMATH Keywords: OSPF
zbMATH Keywords: oblivious routing
zbMATH Keywords: traffic engineering
zbMATH Keywords: ECMP
zbMATH Keywords: branch-and-price
zbMATH Keywords: traffic uncertainty
describes a project that uses: MINTO
MaRDI profile type: Publication
OpenAlex ID: W2064784845
cites work: Provisioning virtual private networks under traffic uncertainty
cites work: Optimal oblivious routing in polynomial time
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Optimal oblivious routing under linear and ellipsoidal uncertainty
cites work: Routing of uncertain traffic demands
cites work: Robust solutions of uncertain linear programs
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Routing, merging, and sorting on parallel models of computation
cites work: Oblivious network design
cites work: Optimization of Internet Protocol network design and routing
cites work: Domination Between Traffic Matrices
cites work: On open shortest path first related network optimisation problems
cites work: MINTO, a Mixed INTeger Optimizer
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Edge-based traffic engineering for OSPF networks
DOI: 10.1007/S11081-009-9098-Y
description: scientific article; zbMATH DE number 6218679