The Experts below are selected from a list of 97350 Experts worldwide ranked by ideXlab platform

Francois Clad - One of the best experts on this subject based on the ideXlab platform.

  • BGP Control Plane Extensions for Segment Routing based Service Chaining
    2018
    Co-Authors: Hani Elmalky, Gaurav Dawra, Clarence Filsfils, Ketan Talaulikar, James Uttaro, Bruno Decraene, Francois Clad
    Abstract:

    The BGP Control Plane for the SR service-chaining solution is consistent with the BGP Control Plane for the topological Segment Routing Traffic Engineering (SR-TE) solution. o BGP Link-State(BGP-LS) address-family/sub-address-family[RFC7752] is used to discover service and topological characteristics from the network. o SR-TE policies[I-D .ietf-idr-segment-routing-te-policy] instantiate source-routed policies that may mix service and topological segments.

  • BGP Control Plane for Segment Routing based Service Chaining
    2017
    Co-Authors: Hani Elmalky, Gaurav Dawra, Clarence Filsfils, Francois Clad
    Abstract:

    The BGP Control Plane for the SR service-chaining solution is consistent with the BGP Control Plane for the topological Segment Routing Traffic Engineering (SR-TE) solution. o BGP Link-State(BGP- LS) address-family/sub-address-family[RFC7752] is used to discover service and topological characteristics from the network. o SR-TE policies[I-D.ietf-idr-segment-routing-te-policy] instantiate source- routed policies that may mix service and topological segments.

Stefano Secci - One of the best experts on this subject based on the ideXlab platform.

  • ParaCon: A Parallel Control Plane for Scaling Up Path Computation in SDN
    IEEE Transactions on Network and Service Management, 2017
    Co-Authors: Kun Qiu, Siyuan Huang, Jin Zhao, Xin Wang, Stefano Secci
    Abstract:

    —The fundamental tasks of the Control Plane in Software Defined Networking (SDN) are to customize forwarding policies for the data Plane and to provide global network view for applications. The logically centralized design of Control Plane brings the benefit of network programmability and promises to ease network management. However, it also increases efficiency concerns for large-scale networks. In this paper, our goal is to build a high-performance SDN Control Plane using multiple Controllers. Previous work seeks to improve Control Plane efficiency by balancing only the load for data Plane behaviors among multiple Controllers. Deviating from conventional wisdom, we propose the design and implementation of ParaCon, which resorts to parallel computing to speed up the path computation in SDN Control Plane. We also address the consistency problem and synchronization overhead under the design. To the best of our knowledge, ParaCon is the first attempt that utilizes node parallelism in path computation for SDN Control Plane. We experimented ParaCon using both Mininet and real-world clusters. Our results show that the path computing time of ParaCon is able to achieve speedup of 10x over POX baseline implementation in a 300-node network with 20 Controllers.

  • The OpenLISP Control Plane architecture
    IEEE Network, 2014
    Co-Authors: Dung Chi Phung, Stefano Secci, Damien Saucez, Luigi Iannone
    Abstract:

    Among many options tackling the scalability issues of the current Internet routing architecture, the Locator/Identifier Separation Protocol (LISP) appears as a viable solution. LISP improves a network's scalability, flexibility, and traffic engineering, enabling mobility with limited overhead. As for any new technology, implementation and deployment are essential to gather and master the real benefits that it provides. In this article, we present the first complete open source implementation of the LISP Control Plane. Our implementation is deployed in the worldwide LISP Beta Network and the French LISP-Lab testbed, and includes the key standardized Control Plane features. Our Control Plane software is the companion of the existing OpenLISP dataPlane implementation, allowing the deployment of a fully functional open source LISP network compatible with any implementation respecting the standards.

  • An Open Control-Plane Implementation for LISP networks
    2012
    Co-Authors: Chi Dung Phung, Stefano Secci, Guy Pujolle, Patrick Raad, Pascal Gallard
    Abstract:

    Among many options to tackle scalability issues of the current Internet routing architecture, the Locator Identity Separation Protocol (LISP) seems to be a feasible and effective one. LISP brings renewed scale and flexibility to the network, enabling advanced mobility management, with acceptable scalability and security. This paper gives a brief presentation about an open Control-Plane implementation of LISP currently working in the lisp4.net testbed. Our implementation includes most LISP Control-Plane functions, and also a module to allow the integration with an OpenLISP data-Plane and, therefore, the deployment of a complete standalone Open-Source LISP Tunnel Router interoperable with existing Cisco LISP implementation.

Marc Ruiz - One of the best experts on this subject based on the ideXlab platform.

  • GMPLS Control Plane network design with resilience guarantees
    Journal of Lightwave Technology, 2011
    Co-Authors: Marc Ruiz, Jordi Perello, Luis Velasco, Jaume Comellas, Salvatore Spadaro, Gabriel Junyent
    Abstract:

    A one-to-one association between data and Control channels has traditionally existed in transport networks. Being the Control Plane embedded in the data Plane, the design of the former, as well as its resilience, has been addressed in the latter's one. However, a main GMPLS architectural requirement is to provide a clean separation between Control and data Planes. In this sense, the Control Plane in GMPLS networks may describe a different topology than the data Plane, even realized over a separated IP network. As a consequence of this, data and Control network design become no more linked in such scenarios. To the best of our knowledge, no works in the literature have addressed an independent design of the Control Plane in GMPLS-enabled networks regardless of the data Plane. In this paper, we provide a method to obtain the optimal GMPLS Control Plane design, minimizing the network Capital Expenditures (CAPEX) while matching specific resilience requirements. To this goal, the problem of finding an optimal Control Plane topology that ensures a certain resilience level is formulated as a non-linear combinatorial model. This model, however, does not scale properly for large backbone networks. In view of this, a constructive linear method is also presented and its optimality validated through simulations on several reference network scenarios. Furthermore, its benefits in terms of total execution time are also highlighted.

  • An analytical model for GMPLS Control Plane resilience quantification
    IEEE Communications Letters, 2009
    Co-Authors: Marc Ruiz, Jordi Perelló, Luis Velasco, Salvatore Spadaro, Jaume Comellas
    Abstract:

    This paper concentrates on the resilience of the Generalized Multi-Protocol Label Switching (GMPLS) enabled Control Plane. To this end, the problem of Control Plane resilience in GMPLS-Controlled networks is firstly stated and previous work on the topic reviewed. Next, analytical formulae to quantify the resilience of generic meshed Control Plane topologies are derived. The resulting model is validated by simulation results on several reference network scenarios.

Hani Elmalky - One of the best experts on this subject based on the ideXlab platform.

  • BGP Control Plane Extensions for Segment Routing based Service Chaining
    2018
    Co-Authors: Hani Elmalky, Gaurav Dawra, Clarence Filsfils, Ketan Talaulikar, James Uttaro, Bruno Decraene, Francois Clad
    Abstract:

    The BGP Control Plane for the SR service-chaining solution is consistent with the BGP Control Plane for the topological Segment Routing Traffic Engineering (SR-TE) solution. o BGP Link-State(BGP-LS) address-family/sub-address-family[RFC7752] is used to discover service and topological characteristics from the network. o SR-TE policies[I-D .ietf-idr-segment-routing-te-policy] instantiate source-routed policies that may mix service and topological segments.

  • BGP Control Plane for Segment Routing based Service Chaining
    2017
    Co-Authors: Hani Elmalky, Gaurav Dawra, Clarence Filsfils, Francois Clad
    Abstract:

    The BGP Control Plane for the SR service-chaining solution is consistent with the BGP Control Plane for the topological Segment Routing Traffic Engineering (SR-TE) solution. o BGP Link-State(BGP- LS) address-family/sub-address-family[RFC7752] is used to discover service and topological characteristics from the network. o SR-TE policies[I-D.ietf-idr-segment-routing-te-policy] instantiate source- routed policies that may mix service and topological segments.

Jaume Comellas - One of the best experts on this subject based on the ideXlab platform.

  • GMPLS Control Plane network design with resilience guarantees
    Journal of Lightwave Technology, 2011
    Co-Authors: Marc Ruiz, Jordi Perello, Luis Velasco, Jaume Comellas, Salvatore Spadaro, Gabriel Junyent
    Abstract:

    A one-to-one association between data and Control channels has traditionally existed in transport networks. Being the Control Plane embedded in the data Plane, the design of the former, as well as its resilience, has been addressed in the latter's one. However, a main GMPLS architectural requirement is to provide a clean separation between Control and data Planes. In this sense, the Control Plane in GMPLS networks may describe a different topology than the data Plane, even realized over a separated IP network. As a consequence of this, data and Control network design become no more linked in such scenarios. To the best of our knowledge, no works in the literature have addressed an independent design of the Control Plane in GMPLS-enabled networks regardless of the data Plane. In this paper, we provide a method to obtain the optimal GMPLS Control Plane design, minimizing the network Capital Expenditures (CAPEX) while matching specific resilience requirements. To this goal, the problem of finding an optimal Control Plane topology that ensures a certain resilience level is formulated as a non-linear combinatorial model. This model, however, does not scale properly for large backbone networks. In view of this, a constructive linear method is also presented and its optimality validated through simulations on several reference network scenarios. Furthermore, its benefits in terms of total execution time are also highlighted.

  • An analytical model for GMPLS Control Plane resilience quantification
    IEEE Communications Letters, 2009
    Co-Authors: Marc Ruiz, Jordi Perelló, Luis Velasco, Salvatore Spadaro, Jaume Comellas
    Abstract:

    This paper concentrates on the resilience of the Generalized Multi-Protocol Label Switching (GMPLS) enabled Control Plane. To this end, the problem of Control Plane resilience in GMPLS-Controlled networks is firstly stated and previous work on the topic reviewed. Next, analytical formulae to quantify the resilience of generic meshed Control Plane topologies are derived. The resulting model is validated by simulation results on several reference network scenarios.