A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering.
Gábor RétváriJózsef BíróTibor CinklerPublished in: ISCC (2004)
Keyphrases
- traffic engineering
- lagrangian relaxation
- minimum cost
- np hard
- capacity constraints
- integer programming
- approximation algorithms
- branch and bound algorithm
- lower bound
- linear programming
- quality of service
- data center
- feasible solution
- network management
- ip networks
- network flow
- network design problem
- scheduling problem
- mixed integer programming
- column generation
- optimal solution
- special case
- np complete
- network traffic
- atm networks
- computational complexity
- wireless networks
- lower and upper bounds
- linear program
- relaxation algorithm
- end to end delay
- dynamic programming
- shortest path
- valid inequalities
- vehicle routing problem
- branch and bound
- simulated annealing
- upper bound
- primal dual
- qos requirements
- evolutionary algorithm
- energy consumption
- network security
- web services