OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty

DOI10.1007/s11081-009-9098-yzbMath1273.90038MaRDI QIDQ374694

Pietro Belotti, Ayşegül Altın, Mustafa Çelebi Pinar

Publication date: 24 October 2013

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/22474

zbMATH Keywords

branch-and-price; oblivious routing; traffic engineering; ECMP; OSPF; traffic uncertainty

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

90B18: Communication networks in operations research

90B20: Traffic problems in operations research

Related Items

Intra-domain traffic engineering with shortest path routing protocols

Uses Software

• MINTO