Design of survivable IP-over-optical networks
暂无分享,去创建一个
Ali Ridha Mahjoub | Sylvie Borne | Éric Gourdin | Bernard Liau | A. Mahjoub | É. Gourdin | B. Liau | S. Borne
[1] Francisco Barahona,et al. Separating from the dominant of the spanning tree polytope , 1992, Oper. Res. Lett..
[2] Hervé Kerivin,et al. Reseaux fiables et polyedres , 2000 .
[3] Jon Postel,et al. Internet Control Message Protocol , 1981, RFC.
[4] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[5] Panos M. Pardalos,et al. Design of survivable networks , 2006 .
[6] M. Stoer,et al. A polyhedral approach to multicommodity survivable network design , 1994 .
[7] Ali Ridha Mahjoub,et al. On two-connected subgraph polytopes , 1995, Discret. Math..
[8] Thomas L. Magnanti,et al. The convex hull of two core capacitated network design problems , 1993, Math. Program..
[9] Ali Ridha Mahjoub,et al. (1,2)-Survivable Networks: Facets and Branch&Cut , 2004 .
[10] K. Bala,et al. IP over optical networks: architectural aspects , 2000, IEEE Commun. Mag..
[11] William H. Cunningham,et al. Optimal attack and reinforcement of a network , 1985, JACM.
[12] Luís Gouveia,et al. MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[13] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[14] Jon Postel,et al. Internet Protocol , 1981, RFC.
[15] Michael Jünger,et al. Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS , 2000, Computational Combinatorial Optimization.
[16] Jon Postel,et al. Transmission Control Protocol , 1981, RFC.
[17] Ali Ridha Mahjoub,et al. Two-edge connected spanning subgraphs and polyhedra , 1994, Math. Program..
[18] Marco Listanti,et al. Off-line configuration of a MPLS over WDM network under time-varying offered traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[19] Ali Ridha Mahjoub,et al. (1, 2)-Survivable Networks: Facets and Branch-and-Cut , 2004, The Sharpest Cut.
[20] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[21] Stefan Thienel,et al. ABACUS - a branch-and-CUt system , 1995 .
[22] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[23] Thomas L. Magnanti,et al. Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..
[24] Dan Gusfield,et al. Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..
[25] Scott O. Bradner,et al. The Recommendation for the IP Next Generation Protocol , 1995, RFC.