A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks
暂无分享,去创建一个
Olivier Bonaventure | Clarence Filsfils | Pierre Schaus | Stefano Vissicchio | Renaud Hartert | Thomas Telkamp | Pierre François | O. Bonaventure | P. Schaus | Renaud Hartert | C. Filsfils | Stefano Vissicchio | Pierre François | T. Telkamp
[1] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[2] Matthew Roughan,et al. Simplifying the synthesis of internet traffic matrices , 2005, CCRV.
[3] Mung Chiang,et al. Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[4] Nick McKeown,et al. OpenFlow: enabling innovation in campus networks , 2008, CCRV.
[5] Mark Handley,et al. FUBAR: Flow Utility Based Routing , 2014, HotNets.
[6] Ratul Mahajan,et al. Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.
[7] 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).
[8] Amin Vahdat,et al. Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.
[9] Cheng Jin,et al. MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[10] Ion Stoica,et al. A policy-aware switching layer for data centers , 2008, SIGCOMM '08.
[11] Olivier Bonaventure,et al. When the cure is worse than the disease: The impact of graceful IGP operations on BGP , 2013, 2013 Proceedings IEEE INFOCOM.
[12] Olivier Bonaventure,et al. Opportunities and research challenges of hybrid software defined networks , 2014, CCRV.
[13] Anoop Ghanwani,et al. Mechanisms for Optimizing Link Aggregation Group (LAG) and Equal-Cost Multipath (ECMP) Component Link Utilization in Networks , 2015, RFC.
[14] A. Greenberg,et al. Cope: Traffic Engineering in Dynamic Networks , 2022 .
[15] Murali S. Kodialam,et al. Traffic engineering in software defined networks , 2013, 2013 Proceedings IEEE INFOCOM.
[16] Ina Minei,et al. MPLS-Enabled Applications , 2005 .
[17] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[18] 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).
[19] Fernando M. V. Ramos,et al. Software-Defined Networking: A Comprehensive Survey , 2014, Proceedings of the IEEE.
[20] Srikanth Kandula,et al. Achieving high utilization with software-driven WAN , 2013, SIGCOMM.
[21] Ailsa H. Land,et al. An Automatic Method of Solving Discrete Programming Problems , 1960 .
[22] Srikanth Kandula,et al. Calendaring for wide area networks , 2014, SIGCOMM.
[23] Clarence Filsfils,et al. Loop-Free Alternate (LFA) Applicability in Service Provider (SP) Networks , 2012, RFC.
[24] Oliver C. Ibe,et al. A survey of IP and multiprotocol label switching fast reroute schemes , 2007, Comput. Networks.
[25] Brighten Godfrey,et al. Pathlet routing , 2009, SIGCOMM '09.
[26] Debasish Ghosh,et al. DSLs in Action , 2010 .
[27] Olivier Tilmans,et al. IGP-as-a-backup for robust SDN networks , 2014, 10th International Conference on Network and Service Management (CNSM) and Workshop.
[28] David A. Maltz,et al. Latency inflation with MPLS-based traffic engineering , 2011, IMC '11.
[29] Renata Teixeira,et al. Network sensitivity to hot-potato disruptions , 2004, SIGCOMM '04.
[30] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.
[31] Jürgen Schönwälder,et al. Network Configuration Protocol (NETCONF) , 2011, RFC.
[32] Laurent Vanbever,et al. Central Control Over Distributed Routing , 2015, Comput. Commun. Rev..
[33] Nick McKeown,et al. MPLS-TE and MPLS VPNS with openflow , 2011, SIGCOMM.
[34] Minlan Yu,et al. SIMPLE-fying middlebox policy enforcement using SDN , 2013, SIGCOMM.
[35] Ramki Krishnan,et al. Mechanisms for Optimal LAG/ECMP Component Link Utilization in Networks , 2013 .
[36] Mikkel Thorup,et al. Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..
[37] Ning Wang,et al. An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.
[38] Paul Quinn,et al. Service Function Chaining Problem Statement , 2013 .
[39] M. Kodialam,et al. Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones , 2009, IEEE/ACM Transactions on Networking.
[40] Pierre Schaus,et al. Multi-Objective Large Neighborhood Search , 2013, CP.
[41] Olivier Bonaventure,et al. Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.
[42] S. Shenker,et al. Rethinking Enterprise Network Control , 2009, IEEE/ACM Transactions on Networking.
[43] Min Zhu,et al. B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.
[44] Robert Raszuk,et al. Dissemination of Flow Specification Rules , 2009, RFC.
[45] Clarence Filsfils,et al. The Segment Routing Architecture , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).
[46] Ian F. Akyildiz,et al. A roadmap for traffic engineering in SDN-OpenFlow networks , 2014, Comput. Networks.
[47] 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).
[48] Albert G. Greenberg,et al. OSPF Monitoring: Architecture, Design, and Deployment Experience , 2004, NSDI.
[49] Jean-Philippe Vasseur,et al. Dynamic traffic engineering for mixed traffic on international networks: Simulation and analysis on real network and traffic scenarios , 2008, Comput. Networks.
[50] Thomas D. Nadeau,et al. Problem Statement for Service Function Chaining , 2015, RFC.
[51] Srikanth Kandula,et al. Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.
[52] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[53] D. Godard,et al. Self-Adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems , 2007 .
[54] Olivier Bonaventure,et al. IGen: Generation of router-level Internet topologies through network design heuristics , 2009, 2009 21st International Teletraffic Congress.