1 / 16

Robust Designs for WDM Routing and Provisioning

Robust Designs for WDM Routing and Provisioning. Jeff Kennington & Eli Olinick Southern Methodist University. Augustyn Ortynski & Gheorghe Spiride Nortel Networks. LTE. LTE. LTE. LTE. …. …. LTE. LTE. LTE. LTE. LTE. LTE. …. …. LTE. LTE. Equipment modeling – sample network link.

cathleen-monroe
Download Presentation

Robust Designs for WDM Routing and Provisioning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Robust Designs for WDM Routing and Provisioning Jeff Kennington & Eli Olinick Southern Methodist University Augustyn Ortynski & Gheorghe Spiride Nortel Networks

  2. LTE LTE LTE LTE … … LTE LTE LTE LTE LTE LTE … … LTE LTE Equipment modeling – sample network link TE LTE TE LTE LTE TE LTE TE … … … … TE LTE TE LTE LTE TE TE LTE LTE TE LTE TE … … … … LTE TE TE LTE

  3. UnderprovisionedCase Dallas Atlanta Unmet demand Satisfied demand Excess capacity Perfect MatchCase LA Phoenix OverprovisionedCase Boston NYC

  4. Regret UnderprovisionedCase OverprovisionedCase Underprovisioning Overprovisioning Perfect MatchCase

  5. Regret UnderprovisionedCase OverprovisionedCase Underprovisioning Overprovisioning Perfect MatchCase

  6. If the point-to-point demands are known, then we can develop a perfect design. If the demands (which are forecasts) are not known with certainty, then we develop a design that attempts to minimize regret over a range of possible demands.

  7. Example 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas

  8. Distance Matrix (KM)

  9. Scenario #1 Demand Matrix (DS3s)

  10. Scenario #2 Demand Matrix (DS3s)

  11. Scenario #3 Demand Matrix (DS3s)

  12. Scenario #1 Solution 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas

  13. Scenario #2 Optimal Solution 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas

  14. Scenario #3 Solution 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas

  15. Robust Solution 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas

  16. The End

More Related