OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
暂无分享,去创建一个
Pietro Belotti | Mustafa Ç. Pınar | P. Belotti | M. Pinar | A. Altın | Ayşegül Altın | A. Altin | M. Pınar
[1] Edoardo Amaldi,et al. Provisioning virtual private networks under traffic uncertainty , 2007, Networks.
[2] Martin W. P. Savelsbergh,et al. MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..
[3] Melvyn Sim,et al. The Price of Robustness , 2004, Oper. Res..
[4] Amin Ahsan Ali,et al. Minimizing congestion in General Networks using oblivious on-line routing algorithms , 2005 .
[5] Michal Pioro,et al. Optimization of administrative weights in IP networks using branch-and-cut approach , 2005 .
[6] Di Yuan,et al. Optimization of Internet Protocol network design and routing , 2004, Networks.
[7] Ratul Mahajan,et al. Measuring ISP topologies with rocketfuel , 2002, TNET.
[8] Thorsten Koch,et al. Integer Programming Approaches to Access and Backbone IP Network Planning , 2006, HPSC.
[9] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[10] Ulrich Killat,et al. Optimizing IP Networks for Uncertain Demands Using Outbound Traffic Constraints , 2005 .
[11] Albert G. Greenberg,et al. A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.
[12] George L. Nemhauser,et al. Functional description of MINTO : a mixed integer optimizer , 1991 .
[13] Arkadi Nemirovski,et al. Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..
[14] Gianpaolo Oriolo,et al. Domination Between Traffic Matrices , 2008, Math. Oper. Res..
[15] Allen L. Soyster,et al. Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..
[16] Michal Pióro,et al. On open shortest path first related network optimisation problems , 2002, Perform. Evaluation.
[17] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[18] Mohammad Taghi Hajiaghayi,et al. Oblivious network design , 2006, SODA '06.
[19] Klara Nahrstedt,et al. Edge-based traffic engineering for OSPF networks , 2005, Comput. Networks.
[20] Kaj Holmberg,et al. Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model , 2005 .
[21] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.
[22] Martine Labbé,et al. A Lower Bound for the Internet Protocol Network Design Problem , 2005 .
[23] Joel Sokol,et al. An integer programming approach to the OSPF weight setting problem ∗ , 2006 .
[24] P. Belotti,et al. Optimal oblivious routing under linear and ellipsoidal uncertainty , 2008 .
[25] Walid Ben-Ameur,et al. Routing of Uncertain Traffic Demands , 2005 .
[26] Mikkel Thorup,et al. Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[27] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[28] Zheng Wang,et al. Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[29] J. L. Wang,et al. Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[30] Chao Yang,et al. A column generation method for inverse shortest path problems , 1995, Math. Methods Oper. Res..
[31] Edith Cohen,et al. Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.
[32] Melvyn Sim,et al. Robust discrete optimization and network flows , 2003, Math. Program..
[33] Edoardo Amaldi,et al. Provisioning virtual private networks under traffic uncertainty , 2007 .
[34] Roch Guérin,et al. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[35] Hoang Xuan Phu,et al. Modeling, Simulation and Optimization of Complex Processes, Proceedings of the Third International Conference on High Performance Scientific Computing, March 6-10, 2006, Hanoi, Vietnam , 2008, HPSC.
[36] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..
[37] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..
[38] Roch Guérin,et al. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.