Multi-hour design of survivable classical IP networks

DOI10.1002/DAC.551MaRDI QIDQ4790688zbMATH OpenOpenAlexFDO

Authors Walid Ben-Ameur

Publication date 4 February 2003

Published in International Journal of Communication Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/dac.551

zbMATH Keywords

survivabilitytraffic engineeringshortest path routingInternetdimensioningmulti-hour

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Network design and communication in computer systems (68M10)

Recommendations

• Multiobjective design of survivable IP networks
• Survivable IP network design with OSPF routing
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• Design of survivable IP-over-optical networks
• Increasing internet capacity using local search

Cites work

• Resource allocation and capacity assignment in distributed systems
• Tabu Search—Part I

Cited in

(8)

• Survivable IP network design with OSPF routing
• Intra-domain traffic engineering with shortest path routing protocols
• Design of survivable IP-over-optical networks
• Multiobjective design of survivable IP networks
• Approximability of unsplittable shortest path routing problems
• Optimization of OSPF routing in IP networks
• Intra-domain traffic engineering with shortest path routing protocols
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

This page was built for publication: Multi-hour design of survivable classical IP networks

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