Student: Ning Zhao, M.Eng Student
Supervisor: Prof. Lorne Mason
Abstract: The optimal cost/performance core node device placement and interconnection problem is formulated as a Mixed Integer Linear Programming (MILP) optimization problem. As this problem is in general NP-complete, large scale network design implies using heuristic methods. A meta heuristic method, called Lagrangian Relaxation, has been applied to provide a near optimal solution for large scale network design given traffic demand and cost parameters. Here we illustrate the impact of different equipment cost assumptions on the resulting near optimal network topology.
[Full Description (not available)]
|