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

DOI10.3138/INFOR.47.2.117MaRDI QIDQ6160201zbMATH OpenOpenAlexFDO

Authors 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

mathematical programming modelnetwork designtabu searchthree-level (access/edge/core) networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A genetic algorithm for the weight setting problem in OSPF routing
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A tabu search algorithm for access network design
• An algorithm for network dimensioning under reliability considerations
• scientific article; zbMATH DE number 571346 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• New modeling approaches for the design of local access transport area networks
• On the design problem of multitechnology networks
• On The Expansion Problem of Reliable ip Networks with Performance Guarantees
• Solving the Hub location problem in telecommunication network design: A local search approach
• Solving the hub location problem with modular link capacities
• The prize collecting traveling salesman problem
• Topological expansion of multiple-ring metropolitan area networks
• Tree knapsack approaches for local access network design

This page was built for publication: Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure

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