D-Scholarship@Pitt (University of Pittsburgh) · 2007 · 12 citations · 19 references
Open access
Natural SciencesMathematicsComputer NetworksOptimizationUncertainty QuantificationNetwork Capacity PlanningNetwork OptimizationOptimization Under UncertaintyRoutingStochastic OptimizationStochastic ProgrammingBandwidth ProvisioningChance-constrained OptimizationChance-constrained ProgrammingDemand UncertaintyDemand Uncertainty ModelingMulticommodity FlowNetwork Design ProblemsOptimization Under Demand Uncertainty
A methodology for network design under demand uncertainty is proposed in this dissertation. The uncertainty is caused by the dynamic nature of the IP-based traffic which is expected to betransported directly over the optical layer in the future. Thus, there is a need to incorporate the uncertainty into a design modelexplicitly. We assume that each demand can be represented as a random variable, and then develop an optimization model to minimizethe cost of routing and bandwidth provisioning. The optimization problem is formulated as a nonlinear Multicommodity Flow problemusing Chance-Constrained Programming to capture both the demand variability and levels of uncertainty guarantee. Numerical work ispresented based on a heuristic solution approach using a linear approximation to transform the nonlinear problem to a simpler linearprogramming problem. In addition, the impact of the uncertainty on a two-layer network is investigated. This will determine how theChance-Constrained Programming based scheme can be practically implemented. Finally, the implementation guidelines for developingan updating process are provided.
19
Network Flows: Theory, Algorithms, and Applications.
David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text
Chance-Constrained Programming
A. Charnes, W. W. Cooper · Management Science · 1959 · 2.7K citations