Multi-hour design of survivable classical IP networks

DOI10.1002/dac.551zbMath1009.68616OpenAlexW2088007832MaRDI QIDQ4790688

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

Internetsurvivabilitytraffic engineeringshortest path routingdimensioningmulti-hour

Mathematics Subject Classification ID

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

Related Items

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Approximability of unsplittable shortest path routing problems ⋮ Optimization of OSPF Routing in IP Networks

Cites Work

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