Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure

DOI10.3138/infor.47.2.117OpenAlexW2101248658MaRDI QIDQ6160201

Steven Chamberland

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.47.2.117

zbMATH Keywords

tabu searchnetwork designmathematical programming modelthree-level (access/edge/core) networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An algorithm for network dimensioning under reliability considerations
• New modeling approaches for the design of local access transport area networks
• A tabu search algorithm for access network design
• A genetic algorithm for the weight setting problem in OSPF routing
• Solving the hub location problem with modular link capacities
• Tree knapsack approaches for local access network design
• On the Design Problem of Multitechnology Networks
• Solving the Hub location problem in telecommunication network design: A local search approach
• The prize collecting traveling salesman problem
• Topological expansion of multiple-ring metropolitan area networks
• On The Expansion Problem of Reliable ip Networks with Performance Guarantees