Optimization of Internet Protocol network design and routing

DOI10.1002/NET.10102MaRDI QIDQ4446916zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg, Di Yuan

Publication date 3 February 2004

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10102

zbMATH Keywords

internet protocolnetwork designoptimizationrouting

Mathematics Subject Classification ID

Network protocols (68M12) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
• Optimization of dynamic routing networks
• Route optimization in IP networks
• Optimization of OSPF routing in IP networks
• Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints

Cites work

• Applied simulated annealing
• Tailoring Benders decomposition for uncapacitated network design

Cited in

(24)

• Network optimization for unified packet and circuit switched networks
• Optimization models for forest road upgrade planning
• Multiobjective design of survivable IP networks
• Point of presence design in internet protocol networks with performance guarantees
• Cost-optimal design of VoIP networks using the VPN concept
• Approximability of unsplittable shortest path routing problems
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• Internet protocol network design with uncertain demand
• Optimization of OSPF routing in IP networks
• Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
• An Integer Programming Algorithm for Routing Optimization in IP Networks
• Valid cycles: A source of infeasibility in open shortest path first routing
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Internet Routing and Related Topology Issues
• On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
• An IP network resilient routing layers building algorithm based on partheno-genetic algorithm
• Optimization of dynamic routing networks
• Route optimization in IP networks
• Routing and capacity optimization for IP networks
• An integer programming algorithm for routing optimization in IP networks
• Intra-domain traffic engineering with shortest path routing protocols
• Intra-domain traffic engineering with shortest path routing protocols
• An enhanced Benders decomposition method for unique shortest path routing

This page was built for publication: Optimization of Internet Protocol network design and routing

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