A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks
Authors:
Open Access
- 17 August 2015
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 45 (4) , 15-28
Abstract
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 framework, which translates high-level goals expressed almost in natural language into compliant network configurations. Our evaluation on real and synthetic topologies shows that framework 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).Keywords
Funding Information
- Communauté Française de Belgique (ARC grant 13/18-054)
This publication has 44 references indexed in Scilit:
- Pathlet routingACM SIGCOMM Computer Communication Review, 2009
- A policy-aware switching layer for data centersACM SIGCOMM Computer Communication Review, 2008
- OpenFlowACM SIGCOMM Computer Communication Review, 2008
- COPEACM SIGCOMM Computer Communication Review, 2006
- Simplifying the synthesis of internet traffic matricesACM SIGCOMM Computer Communication Review, 2005
- Walking the tightropeACM SIGCOMM Computer Communication Review, 2005
- Achieving sub-second IGP convergence in large IP networksACM SIGCOMM Computer Communication Review, 2005
- Network sensitivity to hot-potato disruptionsACM SIGCOMM Computer Communication Review, 2004
- Measuring ISP Topologies With RocketfuelIEEE/ACM Transactions on Networking, 2004
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960