A simple polynomial time framework for reduced-path decomposition in multipath routing
暂无分享,去创建一个
[1] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Li Li,et al. 1. DISTRIBUTED NETWORK MONITORING WITH BOUNDED LINK UTILIZATION , 2002 .
[3] Christian Scheideler,et al. Improved bounds for the unsplittable flow problem , 2002, SODA '02.
[4] Lionel M. Ni,et al. Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..
[5] Ibrahim Matta,et al. Scalability-performance tradeoffs in MPLS and IP routing , 2002, SPIE ITCom.
[6] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[7] Amit Kumar,et al. Exploring the trade-off between label size and stack depth in MPLS routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[8] Jon M. Kleinberg,et al. Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[9] Martin Skutella,et al. The k-Splittable Flow Problem , 2002, Algorithmica.
[10] A. Dwivedi,et al. Traffic model for USA long-distance optical network , 2000, Optical Fiber Communication Conference. Technical Digest Postconference Edition. Trends in Optics and Photonics Vol.37 (IEEE Cat. No. 00CH37079).
[11] Michel X. Goemans,et al. On the Single-Source Unsplittable Flow Problem , 1999, Comb..
[12] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[13] Ibrahim Matta,et al. BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.
[14] Debasis Mitra,et al. A case study of multiservice, multipriority traffic engineering design for data networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).
[15] Anja Feldmann,et al. Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.
[16] Mikkel Thorup,et al. Load optimal MPLS routing with N + M labels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[17] 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).
[18] Marina Thottan,et al. SEQUIN: An SNMP-based MPLS network monitoring system , 2003, Bell Labs Technical Journal.
[19] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[20] Murali S. Kodialam,et al. Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[21] Marina Thottan,et al. Distributed network monitoring with bounded link utilization in IP networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[22] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[23] Subhash Suri,et al. Profile-based routing and traffic engineering , 2003, Comput. Commun..
[24] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[25] Curtis Villamizar,et al. MPLS Optimized Multipath (MPLS--OMP) , 1999 .
[26] Jim Boyle,et al. Applicability Statement for Traffic Engineering with MPLS , 2002, RFC.
[27] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[28] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[29] David F. Lynch,et al. Optimizing Restoration Capacity in the AT&T Network , 2000, Interfaces.
[30] Srihari Nelakuditi,et al. On Selection of Paths for Multipath Routing , 2001, IWQoS.