Efficient and robust routing of highly variable traffic
暂无分享,去创建一个
[1] Ratul Mahajan,et al. Inferring link weights using end-to-end measurements , 2002, IMW '02.
[2] Ashish Goel,et al. Efficient computation of delay-sensitive routes from one source to all destinations , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[3] Amit Kumar,et al. Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.
[4] Albert G. Greenberg,et al. A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.
[5] L. Lovász. A Characterization of Perfect Graphs , 1972 .
[6] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .
[7] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[8] Christophe Diot,et al. An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[9] G. Ziegler. Lectures on Polytopes , 1994 .
[10] Farnam Jahanian,et al. Experimental study of Internet stability and backbone failures , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).
[11] W. Norton,et al. Internet Service Providers and Peering , 2001 .
[12] Chung-Lun Li,et al. Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.
[13] Wayne D. Grover,et al. Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .
[14] Cheng-Shang Chang,et al. Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..
[15] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .
[16] Renata Teixeira,et al. Dynamics of hot-potato routing in IP networks , 2004, SIGMETRICS '04/Performance '04.
[17] Murali S. Kodialam,et al. Maximum Throughput Routing of Traffic in the Hose Model , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[18] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[19] Murali S. Kodialam,et al. A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[20] Kavé Salamatian,et al. Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.
[21] N. McKeown,et al. Designing a Predictable Internet Backbone Network , 2004 .
[22] Carsten Lund,et al. An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.
[23] Thomas Erlebach,et al. Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.
[24] Murali S. Kodialam,et al. Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[25] Vijay P. Kumar,et al. Switched optical backbone for cost-effective scalable core IP networks , 2003, IEEE Commun. Mag..
[26] Murali S. Kodialam,et al. Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.
[27] Eric C. Rosen,et al. Multiprotocol Label Switching Architecture , 2001, RFC.
[28] Scott Shenker,et al. Internet indirection infrastructure , 2004, IEEE/ACM Transactions on Networking.
[29] Albert G. Greenberg,et al. Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.
[30] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[31] Cheng-Shang Chang,et al. Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.
[32] Bruce E. Hajek,et al. Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.