A robust optimization approach to network design
Name
711102072-MIT.pdf
Description
Full printable version
Size
6.25 MB
Format
Adobe PDF
Checksum (MD5)
1afbd31f5a451332dc891b36c35195d8
Author(s)
Johnston, Matthew R. (Matthew Ryan)
Advisor(s)
Eytan Modiano.
Date Issued
2010
Publisher
Massachusetts Institute of Technology
Abstract
This thesis addresses the problem of logical topology design for optical backbone networks subject to traffic following a Gaussian distribution. The network design problem is broken into three tasks: traffic routing, capacity allocation, and link placement. The routing and capacity allocation problems are formulated as a convex mathematical program. To extend this formulation to discrete optimization problems, such as the link placement sub-problem, it is reformulated as a mixed integer linear program (MILP) by extending tools from robust optimization to Gaussian variables. Bounds are presented to relate capacity allocation to the probability of traffic overflow on a link. Lastly, the link placement subproblem is formulated as an MILP and network topologies for deterministic traffic are compared with those for stochastic traffic. Additionally, this thesis presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffic is rerouted through a preplanned path in the backup network. We introduce a novel approach for dealing with random link failures, in which probabilistic survivability guarantees are provided to limit capacity over-provisioning. We show that the optimal backup routing strategy in this respect depends on the reliability of the primary network. Specifically, as primary links become less likely to fail, the optimal backup networks employ more resource sharing amongst backup paths. We apply results from the field of robust optimization to formulate an ILP for the design and capacity provisioning of these backup networks. We then propose a simulated annealing heuristic to solve this problem for large-scale networks, and we present simulation results to verify our analysis on optimal backup networks.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 91-93).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
Persistent DSpace Link
