User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks

Primary tabs

download
  • Open access
  • PDF
  • 491.76 K
Hartert, Renaud [UCL] Vissicchio, Stefano [UCL] Schaus, Pierre [UCL] Bonaventure, Olivier [UCL] Filsfils, Clarence [Cisco Systems Inc.] Francois, Pierre [IMDEA]

SDN simplifies network management by relying on declarativity (high-level interface) and expressiveness (network flexibility). We propose a solution to support those features while preserving high robustness and scalability as needed in carrier-grade networks. Our solution is based on (i) a two-layer architecture separating connectivity and optimization tasks; and (ii) a centralized optimizer called DEFO, which translates high-level goals expressed almost in natural language into compliant network configurations. Our evaluation on real and synthetic topologies shows that DEFO improves the state of the art by (i) achieving better trade-offs for classic goals covered by previous works, (ii) supporting a larger set of goals (refined traffic engineering and service chaining), and (iii) optimizing large ISP networks in few seconds. We also quantify the gains of our implementation, running Segment Routing on top of IS-IS, over possible alternatives (RSVP-TE and OpenFlow).

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès libre
Publication date 2015
Language Anglais
Conference "28th Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM) on the applications, technologies, architectures, and protocols for computer communication", London (du 17/08/2015 au 21/08/2015)
Peer reviewed yes
Host document "Proceedings of SIGCOMM 2015" (ISBN : 978-1-4503-3542-3)
Publication status Publié
Affiliation UCL - SST/ICTM/INGI - Pôle en ingénierie informatique
Links
  1. S. Agarwal phet al., "Traffic Engineering in Software Defined Networks," in phINFOCOM, 2013.
  2. S. Vissicchio phet al., "Opportunities and Research Challenges of Hybrid Software Defined Networks," phACM CCR, vol. 44, no. 2, 2014.
  3. Z. Qazi phet al., "SIMPLE-fying Middlebox Policy Enforcement Using SDN," in phSIGCOMM, 2013.
  4. D. Joseph phet al., "A Policy-aware Switching Layer for Data Centers," in phSIGCOMM, 2008.
  5. S. Kandula phet al., "Walking the tightrope: responsive yet stable traffic engineering," in phSIGCOMM, 2005.
  6. H. Wang phet al., "COPE: traffic engineering in dynamic networks," in phSIGCOMM, 2006.
  7. N. Gvozdiev, B. Karp, and M. Handley, "FUBAR: Flow Utility Based Routing," in phHotNets, 2014.
  8. M. Kodialam phet al., "Oblivious routing of highly variable traffic in service overlays and IP backbones," phTrans. Netw., vol. 17, pp. 459--472, 2009.
  9. A. Pathak phet al., "Latency inflation with MPLS-based traffic engineering," in phIMC, 2011.
  10. R. Steenbergen, "Mpls autobandwidth," RIPE 64.
  11. S. Dasgupta phet al., "Dynamic traffic engineering for mixed traffic on international networks," phComputer Networks, vol. 52, no. 11, Aug. 2008.
  12. I. Minei and J. Luceck, phMPLS-Enabled Applications.\hskip 1em plus 0.5em minus 0.4em\relax Wiley, 2005.
  13. D. Xu, M. Chiang, and J. Rexford, "Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering," phTrans. Netw., vol. 19, no. 6, pp. 1717--1730, 2011.
  14. Y. Wang, Z. Wang, and L. Zhang, "Internet traffic engineering without full mesh overlaying," in phINFOCOM, 2001.
  15. A. Sridharan phet al., "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks," phTrans. Netw., vol. 13, no. 2, 2005.
  16. Juniper, "WANDL IP/MPLSView," http://www.juniper.net/assets/us/en/local/pdf/datasheets/1000500-en.pdf.
  17. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," phIEEE J. Sel. Areas Commun., vol. 20, no. 4, 2002.
  18. I. Akyildiz phet al., "A roadmap for traffic engineering in SDN-OpenFlow networks," phComputer Networks, vol. 71, pp. 1--30, 2014.
  19. Wang Ning, Ho Kin, Pavlou George, Howarth Michael, An overview of routing optimization for internet traffic engineering, 10.1109/comst.2008.4483669
  20. C. Filsfils, "Segment routing: update and future evolution," MPLS/SDN world congress, 2014.
  21. Cisco, "Cisco WAN Automation Engine: Greater Traffic and Bandwidth Awareness for Easier Programmability," white paper, 2015.
  22. R. Teixeira phet al., "Network sensitivity to hot-potato disruptions," in phSIGCOMM, 2004.
  23. L. Vanbever phet al., "When the cure is worse than the disease: The impact of graceful IGP operations on BGP," in phINFOCOM, 2013.
  24. T. Cormen phet al., phIntroduction to Algorithms.\hskip 1em plus 0.5em minus 0.4em\relax McGraw-Hill, 2001.
  25. Cisco, "Planning and Designing Networks with the Cisco MATE Portfolio," white paper, 2013.
  26. M. Roughan, "Simplifying the synthesis of internet traffic matrices," phACM CCR, vol. 35, no. 5, pp. 93--96, 2005.
  27. B. Quoitin phet al., "IGen: Generation of router-level Internet topologies through network design heuristics," in phITC, 2009.
  28. N. Spring phet al., "Measuring isp topologies with rocketfuel," phTrans. Netw., vol. 12, no. 1, 2004.
  29. S. Sivabalan phet al., "PCEP Extensions for Segment Routing," Internet Draft, 2014.
  30. P. Marques phet al., "Dissemination of Flow Specification Rules," RFC 5575, 2009.
  31. R. Enns phet al., "Network Configuration Protocol (NETCONF)," RFC 6241, 2011.
  32. A. Sharafat phet al., "MPLS-TE and MPLS VPNS with Openflow," in phSIGCOMM, 2011.
  33. S. Vissicchio phet al., "Central control over distributed routing," in phSIGCOMM, 2015.
  34. A. Shaikh and A. Greenberg, "OSPF Monitoring: Architecture, Design and Deployment Experience," in phNSDI, 2004.
  35. OscaR Team, "OscaR: Scala in OR," 2012,texttthttps://bitbucket.org/oscarlib/oscar.
  36. S. Previdi phet al., "IPv6 Segment Routing Header (SRH)," Internet draft, 2014.
  37. C. Filsfils phet al., "Segment Routing with MPLS data plane," Internet draft, 2014.
  38. P. Francois, C. Filsfils, J. Evans, and O. Bonaventure, "Achieving Sub-second IGP Convergence in Large IP Networks," phACM CCR, vol. 35, no. 3, 2005.
  39. A. H. Land and A. G. Doig, "An automatic method of solving discrete programming problems," phEconometrica: Journal of the Econometric Society, pp. 497--520, 1960.
  40. P. Laborie and D. Godard, "Self-adapting large neighborhood search: Application to single-mode scheduling problems," in phMISTA, 2007.
  41. P. Shaw, "Using constraint programming and local search methods to solve vehicle routing problems," in phCP, 1998.
  42. A. Raj and O. C. Ibe, "A survey of IP and multiprotocol label switching fast reroute schemes," phComputer Networks, vol. 51, no. 8, pp. 1882--1907, 2007.
  43. R. Hartert, "DEFO Web Site," sites.uclouvain.be/defo.
  44. P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica, "Pathlet routing," in phSIGCOMM, 2009.
  45. P. B. Godfrey, S. Shenker, and I. Stoica, "Pathlet routing," in phHotNets, 2008.
  46. P. Schaus and R. Hartert, "Multi-objective large neighborhood search," in phCP, 2013.
  47. D. Ghosh, phDSLs in action.\hskip 1em plus 0.5em minus 0.4em\relax Manning Publications, 2010.
  48. A. Elwalid phet al., "Mate: Mpls adaptive traffic engineering," in phINFOCOM, 2001.
  49. F. Rossi, P. Van Beek, and T. Walsh, phHandbook of constraint programming.\hskip 1em plus 0.5em minus 0.4em\relax Elsevier, 2006.
  50. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in phINFOCOM, 2000.
  51. O. Tilmans and S. Vissicchio, "IGP-as-a-Backup for Robust SDN Networks," in phCNSM, 2014.
  52. R. Krishnan phet al., "Mechanisms for Optimizing LAG/ECMP Component Link Utilization in Networks," Internet Draft, 2014.
  53. C. Filsfils phet al., "Loop-Free Alternate (LFA) Applicability in Service Provider (SP) Networks," RFC 6571, 2012.
  54. P. Quinn and T. Nadeau, "Service function chaining problem statement," Internet draft, 2014.
  55. C.-Y. Hong phet al., "Achieving High Utilization with Software-driven WAN," in phSIGCOMM, 2013.
  56. S. Kandula phet al., "Calendaring for Wide Area Networks," in phSIGCOMM, 2014.
  57. S. Jain phet al., "B4: Experience with a globally-deployed software defined wan," in phSIGCOMM, 2013.
  58. M. Al-Fares phet al., "Hedera: Dynamic Flow Scheduling for Data Center Networks," in phNSDI, 2010.
  59. M. Casado phet al., "Rethinking enterprise network control," phTrans. Netw., vol. 17, no. 4, pp. 1270--1283, 2009.
  60. C. Filsfils phet al., "Segment Routing Architecture," Internet draft, 2014.
  61. N. McKeown phet al., "OpenFlow: enabling innovation in campus networks," phACM CCR, vol. 38, no. 2, pp. 69--74, 2008.
  62. D. Kreutz phet al., "Software-defined networking: A comprehensive survey," phProceedings of the IEEE, vol. 103, no. 1, pp. 14--76, 2015.
Bibliographic reference Hartert, Renaud ; Vissicchio, Stefano ; Schaus, Pierre ; Bonaventure, Olivier ; Filsfils, Clarence ; et. al. A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks.28th Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM) on the applications, technologies, architectures, and protocols for computer communication (London, du 17/08/2015 au 21/08/2015). In: Proceedings of SIGCOMM 2015, 2015
Permanent URL http://hdl.handle.net/2078.1/164974