Load balancing optimization of capacitated networks with path protection

MaRDI QIDQ2861563zbMATH OpenFDO

Authors Amaro de Sousa, Dorabella Santos, Pedro Matos, Joaquim Madeira

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001599

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Optimal routing with failure-independent path protection
• Routing and capacity assignment in backbone communication networks
• A link weight assignment algorithm for traffic-engineered networks
• Balancing loads on Sonet rings with integer demand splitting
• Optimal load balancing in tree networks with two-way traffic

Cites work

• A quick method for finding shortest pairs of disjoint paths
• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• On solving linear programs with the ordered weighted averaging objective.

Cited in

(7)

• scientific article; zbMATH DE number 2088500 (Why is no real title available?)
• A hybrid column generation with GRASP and path relinking for the network load balancing problem
• Optimal load balancing in tree networks with two-way traffic
• Euro-Par 2004 Parallel Processing
• Optimizing flow thinning protection in multicommodity networks with variable link capacity
• A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity
• A link weight assignment algorithm for traffic-engineered networks

This page was built for publication: Load balancing optimization of capacitated networks with path protection

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