A robust optimization approach to network design
暂无分享,去创建一个
[1] N. McKeown,et al. Designing a Predictable Internet Backbone Network , 2004 .
[2] Ariel Orda,et al. Designing Low-Capacity Backup Networks for Fast Restoration , 2010, 2010 Proceedings IEEE INFOCOM.
[3] B. Yu,et al. Time-varying network tomography: router link data , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[4] Kumar N. Sivarajan,et al. Design of logical topologies for wavelength-routed all-optical networks , 1995, Proceedings of INFOCOM'95.
[5] Arkadi Nemirovski,et al. Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..
[6] Eytan Modiano,et al. Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..
[7] Biswanath Mukherjee,et al. Survivable WDM mesh networks , 2003 .
[8] Walid Ben-Ameur,et al. Routing of Uncertain Traffic Demands , 2005 .
[9] S. Brooks,et al. Optimization Using Simulated Annealing , 1995 .
[10] Koonlachat Meesublak,et al. Network design under demand uncertainty , 2007 .
[11] M. Herzberg,et al. The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.
[12] Suresh Subramaniam,et al. Survivability in optical networks , 2000, IEEE Netw..
[13] Biswanath Mukherjee,et al. Service provisioning to provide per-connection-based availability guarantee in WDM mesh networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..
[14] Chunming Qiao,et al. Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .
[15] András Kern,et al. Surviving multiple network failures using shared backup path protection , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.
[16] Marco Mellia,et al. Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties , 2001, IEEE Communications Letters.
[17] Biswanath Mukherjee,et al. A review of fault management in WDM mesh networks: basic concepts and research challenges , 2004, IEEE Netw..
[18] Qiong Wang,et al. Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management , 2005, TNET.
[19] Sudipta Sengupta,et al. Efficient and robust routing of highly variable traffic , 2005 .
[20] M. Medard,et al. Capacity versus robustness: a tradeoff for link restoration in mesh networks , 2000, Journal of Lightwave Technology.
[21] Eusebi Calle,et al. Topology-focused availability analysis of basic protection schemes in optical transport networks , 2008 .
[22] Ue-Pyng Wen,et al. Applying tabu search to spare capacity planning for network restoration , 1999, Comput. Oper. Res..
[23] Melvyn Sim,et al. The Price of Robustness , 2004, Oper. Res..
[24] Lei Guo,et al. Segment shared protection for survivable meshed WDM optical networks , 2005 .
[25] Massimo Tornatore,et al. Availability design of optical transport networks , 2005, IEEE Journal on Selected Areas in Communications.
[26] Andrew Odlyzko,et al. Internet traffic growth: sources and implications , 2003, SPIE ITCom.
[27] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[28] Marco Ajmone Marsan,et al. Algorithms for the l ogical topol-ogy design in WDM all-optical networks , 2000 .
[29] Filip De Turck,et al. Dimensioning of survivable WDM networks , 1998, IEEE J. Sel. Areas Commun..
[30] Yu Liu,et al. Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.
[31] Kumar N. Sivarajan,et al. Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers , 2001, TNET.
[32] Allen L. Soyster,et al. Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..
[33] Hande Yaman,et al. Robust DWDM Routing and Provisioning under Polyhedral Demand Uncertainty ∗ , 2005 .
[34] Suresh Subramaniam,et al. On double-link failure recovery in WDM optical networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[35] Eiji Oki,et al. A disjoint path selection scheme with shared risk link groups in GMPLS networks , 2002, IEEE Communications Letters.