Edge-based traffic engineering for OSPF networks

DOI10.1016/J.COMNET.2004.11.008zbMATH Open1101.68357OpenAlexW2152899109MaRDI QIDQ2484983FDOQ2484983

Authors: Jun Wang, Yaling Yang, Li Xiao, Klara Nahrstedt 

Publication date: 3 August 2005

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2004.11.008

Recommendations

• Increasing internet capacity using local search
• On open shortest path first related network optimisation problems
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Efficient techniques and tools for intra-domain traffic engineering

zbMATH Keywords

OSPFTraffic engineeringEdge-basedMathematical programming/optimizationTraffic set

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

This page was built for publication: Edge-based traffic engineering for OSPF networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484983)