International journals
2018 |
Huin, Nicolas; Jaumard, Brigitte; Giroire, Frédéric Optimal Network Service Chain Provisioning Journal Article IEEE Transactions on Networking, 26 (3), 2018, ISSN: 1063-6692. @article{huin18ton, title = {Optimal Network Service Chain Provisioning}, author = {Nicolas Huin and Brigitte Jaumard and Frédéric Giroire}, doi = {10.1109/TNET.2018.2833815}, issn = {1063-6692}, year = {2018}, date = {2018-05-22}, journal = {IEEE Transactions on Networking}, volume = {26}, number = {3}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Huin, Nicolas; Rifai, Myriana; Giroire, Frédéric; Lopez, Dino; Urvoy-Keller, Guillaume; Moulierac, Joanna Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks Journal Article 2018. @article{hui2018tgcn, title = {Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}, author = {Nicolas Huin and Myriana Rifai and Frédéric Giroire and Dino Lopez and Guillaume Urvoy-Keller and Joanna Moulierac}, doi = {10.1109/TGCN.2018.2842123}, year = {2018}, date = {2018-05-00}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Huin, Nicolas; Tomassilli, Andrea; Giroire, Frédéric; Jaumard, Brigitte Energy-Efficient Service Function Chain Provisioning Journal Article J. Opt. Commun. Netw., 10 (3), pp. 114–124, 2018. @article{Huin:18, title = {Energy-Efficient Service Function Chain Provisioning}, author = {Nicolas Huin and Andrea Tomassilli and Frédéric Giroire and Brigitte Jaumard}, url = {http://jocn.osa.org/abstract.cfm?URI=jocn-10-3-114}, doi = {10.1364/JOCN.10.000114}, year = {2018}, date = {2018-03-01}, journal = {J. Opt. Commun. Netw.}, volume = {10}, number = {3}, pages = {114--124}, publisher = {OSA}, abstract = {Network function virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the software defined network (SDN) paradigm, virtual network functions (VNFs) can be implemented dynamically on generic hardware. This is of primary interest to implement energy-efficient solutions, in order to adapt the resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with an SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a service function chain, which is several network functions in a specific order. We propose an integer linear programming (ILP) formulation, an ILP-based heuristic, and a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% and 62% of energy savings for networks of different sizes.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Network function virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the software defined network (SDN) paradigm, virtual network functions (VNFs) can be implemented dynamically on generic hardware. This is of primary interest to implement energy-efficient solutions, in order to adapt the resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with an SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a service function chain, which is several network functions in a specific order. We propose an integer linear programming (ILP) formulation, an ILP-based heuristic, and a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% and 62% of energy savings for networks of different sizes. |
Giroire, Frédéric; Huin, Nicolas; Moulierac, Joanna; Phan, Khoa Energy-aware Routing in Software-Defined Network using Compression Journal Article The Computer Journal, 2018. @article{comp2018, title = {Energy-aware Routing in Software-Defined Network using Compression}, author = {Frédéric Giroire and Nicolas Huin and Joanna Moulierac and Khoa Phan}, doi = {10.1093/comjnl/bxy029}, year = {2018}, date = {2018-02-23}, journal = {The Computer Journal}, abstract = {Software-defined Network (SDN) is a new networking paradigm enabling innovation through network programmability. Over past few years, many applications have been built using SDN such as server load balancing, virtual-machine migration, traffic engineering and access control. In this paper, we focus on using SDN for energy-aware routing (EAR). Since traffic load has a small influence on the power consumption of routers, EAR allows putting unused links into sleep mode to save energy. SDN can collect traffic matrix and then computes routing solutions satisfying QoS while being minimal in energy consumption. However, prior works on EAR have assumed that the SDN forwarding table switch can hold an infinite number of rules. In practice, this assumption does not hold since such flow tables are implemented in Ternary Content Addressable Memory (TCAM) which is expensive and power hungry. We consider the use of wildcard rules to compress the forwarding tables. In this paper, we propose optimization methods to minimize energy consumption for a backbone network while respecting capacity constraints on links and rule space constraints on routers. In details, we present two exact formulations using Integer Linear Program (ILP) and introduce efficient heuristic algorithms. Based on simulations on realistic network topologies, we show that using this smart rule space allocation, it is possible to save almost as much power consumption as the classical EAR approach.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Software-defined Network (SDN) is a new networking paradigm enabling innovation through network programmability. Over past few years, many applications have been built using SDN such as server load balancing, virtual-machine migration, traffic engineering and access control. In this paper, we focus on using SDN for energy-aware routing (EAR). Since traffic load has a small influence on the power consumption of routers, EAR allows putting unused links into sleep mode to save energy. SDN can collect traffic matrix and then computes routing solutions satisfying QoS while being minimal in energy consumption. However, prior works on EAR have assumed that the SDN forwarding table switch can hold an infinite number of rules. In practice, this assumption does not hold since such flow tables are implemented in Ternary Content Addressable Memory (TCAM) which is expensive and power hungry. We consider the use of wildcard rules to compress the forwarding tables. In this paper, we propose optimization methods to minimize energy consumption for a backbone network while respecting capacity constraints on links and rule space constraints on routers. In details, we present two exact formulations using Integer Linear Program (ILP) and introduce efficient heuristic algorithms. Based on simulations on realistic network topologies, we show that using this smart rule space allocation, it is possible to save almost as much power consumption as the classical EAR approach. |
Huin, Nicolas; Rifai, Myriana; Giroire, Frédéric; Pacheco, Dino Lopez; Urvoy-Keller, Guillaume; Moulierac, Joanna Bringing energy aware routing closer to reality with SDN hybrid networks Journal Article IEEE Transactions on Green Communications and Networking, 2 (4), pp. 1128–1139, 2018. @article{huin2018bringing, title = {Bringing energy aware routing closer to reality with SDN hybrid networks}, author = {Nicolas Huin and Myriana Rifai and Frédéric Giroire and Dino Lopez Pacheco and Guillaume Urvoy-Keller and Joanna Moulierac}, year = {2018}, date = {2018-01-01}, journal = {IEEE Transactions on Green Communications and Networking}, volume = {2}, number = {4}, pages = {1128--1139}, publisher = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
2017 |
Rifai, Myriana; Huin, Nicolas; Caillouet, Christelle; Giroire, Frédéric; Moulierac, Joanna; Lopez, Dino; Urvoy-Keller, Guillaume MINNIE: An SDN world with few compressed forwarding rules Journal Article Computer Networks, 121 , pp. 185–207, 2017, ISSN: 13891286. @article{rifai2017minnieCN, title = {MINNIE: An SDN world with few compressed forwarding rules}, author = {Myriana Rifai and Nicolas Huin and Christelle Caillouet and Frédéric Giroire and Joanna Moulierac and Dino Lopez and Guillaume Urvoy-Keller}, doi = {10.1016/j.comnet.2017.04.026}, issn = {13891286}, year = {2017}, date = {2017-01-01}, journal = {Computer Networks}, volume = {121}, pages = {185--207}, publisher = {Elsevier BV}, abstract = {Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility to the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. Indeed, the Ternary Content-Addressable Memory (TCAM) needed by SDN devices has smaller capacities than CAMs used in legacy hardware. In this paper, we investigate compression techniques to maximize the utility of SDN switches forwarding tables. We validate our algorithm, called MINNIE, with intensive simulations for well-known data center topologies, to study its efficiency and compression ratio for a large number of forwarding rules. Our results indicate that MINNIE scales well, being able to deal with around a million of different flows with less than 1000 forwarding entries per SDN switch, requiring negligible computation time. To assess the operational viability of MINNIE in real networks, we deployed a testbed able to emulate a k=4 Fat-Tree data center topology. We demonstrate on the one hand, that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored, with no packet losses, nor detectable extra delays if routing lookups are done in the Application-Specific Integrated Circuits (ASICs). Hence, both simulations and experimental results suggest that MINNIE can be safely deployed in real networks, providing compression ratios between 70% and 99%.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility to the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. Indeed, the Ternary Content-Addressable Memory (TCAM) needed by SDN devices has smaller capacities than CAMs used in legacy hardware. In this paper, we investigate compression techniques to maximize the utility of SDN switches forwarding tables. We validate our algorithm, called MINNIE, with intensive simulations for well-known data center topologies, to study its efficiency and compression ratio for a large number of forwarding rules. Our results indicate that MINNIE scales well, being able to deal with around a million of different flows with less than 1000 forwarding entries per SDN switch, requiring negligible computation time. To assess the operational viability of MINNIE in real networks, we deployed a testbed able to emulate a k=4 Fat-Tree data center topology. We demonstrate on the one hand, that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored, with no packet losses, nor detectable extra delays if routing lookups are done in the Application-Specific Integrated Circuits (ASICs). Hence, both simulations and experimental results suggest that MINNIE can be safely deployed in real networks, providing compression ratios between 70% and 99%. |
International conferences
2021 |
Yassine, Kamri Ahmed; Anh, Quang Pham Tran; Nicolas, Huin; Jérémie, Leguay Constrained Policy Optimization for Load Balancing Inproceedings Forthcoming IEEE Design of Reliable Communication Networks (DRCN), Forthcoming. @inproceedings{kamri2021, title = {Constrained Policy Optimization for Load Balancing}, author = {Kamri Ahmed Yassine and Quang Pham Tran Anh and Huin Nicolas and Leguay Jérémie}, url = {undefined}, year = {2021}, date = {2021-04-19}, booktitle = {IEEE Design of Reliable Communication Networks (DRCN)}, abstract = {To improve the bandwidth utilization in IP networks, a centralized controller splits flow aggregates over multiple paths and decides load balancing weights. Ideally, load balancing policies should anticipate the impact of their decisions on the Quality of Service (QoS). However, the embedding of accurate performance models into load balancing optimization algorithms is a challenge. In this context, we propose a Deep Reinforcement Learning (DRL) based solution that is able to learn the relationship between traffic and QoS, while providing safety to maximize throughput and avoid violating link capacity constraints. Our safe solution for QoS-aware load balancing integrates DRL algorithms with the Reward Constrained Policy Optimization algorithm. In a scenario where link delays follow the M/M/1 queuing model, we demonstrate, using a non-linear integer program, that our solution can reach a close to optimal end-to-end delay. We also show that our solution automatically learns reward parameters to meet capacity constraints.}, keywords = {}, pubstate = {forthcoming}, tppubtype = {inproceedings} } To improve the bandwidth utilization in IP networks, a centralized controller splits flow aggregates over multiple paths and decides load balancing weights. Ideally, load balancing policies should anticipate the impact of their decisions on the Quality of Service (QoS). However, the embedding of accurate performance models into load balancing optimization algorithms is a challenge. In this context, we propose a Deep Reinforcement Learning (DRL) based solution that is able to learn the relationship between traffic and QoS, while providing safety to maximize throughput and avoid violating link capacity constraints. Our safe solution for QoS-aware load balancing integrates DRL algorithms with the Reward Constrained Policy Optimization algorithm. In a scenario where link delays follow the M/M/1 queuing model, we demonstrate, using a non-linear integer program, that our solution can reach a close to optimal end-to-end delay. We also show that our solution automatically learns reward parameters to meet capacity constraints. |
2019 |
Babashahi, Kia; Jaumard, Brigitte; Huin, Nicolas Automated Mechanism Design: Compact and Decomposition Linear Programming Models Inproceedings 31st International Conference on Tools with Artificial Intelligence, 2019. @inproceedings{babashahi2019, title = {Automated Mechanism Design: Compact and Decomposition Linear Programming Models}, author = {Kia Babashahi and Brigitte Jaumard and Nicolas Huin}, doi = {10.1109/ICTAI.2019.00031}, year = {2019}, date = {2019-11-02}, booktitle = {31st International Conference on Tools with Artificial Intelligence}, abstract = {In the context of multi-agent systems, Automated Mechanism Design (AMD) is the computer-based design of the rules of a mechanism, which reaches an equilibrium despite the fact that agents can be selfish and lie about their preferences. Although it has been shown that AMD can be modelled as a linear program, it is with an exponential number of variables and consequently, there is no known efficient algorithm. We revisit the latter linear program model proposed for the AMD problem and introduce a new one with a polynomial number of variables. We show that the latter model corresponds to a Dantzig-Wolfe decomposition of the second one and design efficient solution schemes in polynomial time for both two models. Numerical experiments compare the solution efficiency of both models and show that we can solve very significantly larger data instances than before, up to 2,000 agents or 2,000 resources in about 35 seconds.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } In the context of multi-agent systems, Automated Mechanism Design (AMD) is the computer-based design of the rules of a mechanism, which reaches an equilibrium despite the fact that agents can be selfish and lie about their preferences. Although it has been shown that AMD can be modelled as a linear program, it is with an exponential number of variables and consequently, there is no known efficient algorithm. We revisit the latter linear program model proposed for the AMD problem and introduce a new one with a polynomial number of variables. We show that the latter model corresponds to a Dantzig-Wolfe decomposition of the second one and design efficient solution schemes in polynomial time for both two models. Numerical experiments compare the solution efficiency of both models and show that we can solve very significantly larger data instances than before, up to 2,000 agents or 2,000 resources in about 35 seconds. |
Huin, Nicolas; Leguay, Jérémie; Martin, Sébastien; Medagliani, Paolo; Cai, Shengming Routing and Slot Allocation in 5G Hard Slicing Inproceedings International Network Optimization Conference 2019, INOC 2019, 2019, 2019, ISBN: 978-3-89318-079-0. @inproceedings{huin2019routing, title = {Routing and Slot Allocation in 5G Hard Slicing}, author = {Nicolas Huin and Jérémie Leguay and Sébastien Martin and Paolo Medagliani and Shengming Cai}, doi = {https://dx.doi.org/10.5441/002/inoc.2019.14}, isbn = {978-3-89318-079-0}, year = {2019}, date = {2019-06-12}, booktitle = {International Network Optimization Conference 2019, INOC 2019, 2019}, issuetitle = {International Network Optimization Conference}, abstract = {5G networks will enable the creation of network slices to serve very different user requirements. Flex Ethernet (FlexE) is a standard technology that provides strict isolation between slices, also called hard slicing, by allocating capacity slots of physicallinks to slices. The resulting resource allocation problem is called Routing and Slot Allocation problem (RSA). We first prove that this problem is NP-hard and cannot be approximated. Then, we develop two matheuristics to efficiently solve the problem, by leveraging on a combination of Column Generation and GaussSeidel procedures. The numerical evaluation, carried out by comparing the two matheuristics against a greedy algorithm over realistic IP-RAN networks, shows an optimality gap smaller than7% while reducing the reservation cost by 4% compared to the greedy algorithm.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } 5G networks will enable the creation of network slices to serve very different user requirements. Flex Ethernet (FlexE) is a standard technology that provides strict isolation between slices, also called hard slicing, by allocating capacity slots of physicallinks to slices. The resulting resource allocation problem is called Routing and Slot Allocation problem (RSA). We first prove that this problem is NP-hard and cannot be approximated. Then, we develop two matheuristics to efficiently solve the problem, by leveraging on a combination of Column Generation and GaussSeidel procedures. The numerical evaluation, carried out by comparing the two matheuristics against a greedy algorithm over realistic IP-RAN networks, shows an optimality gap smaller than7% while reducing the reservation cost by 4% compared to the greedy algorithm. |
Giroire, Frédéric; Huin, Nicolas; Tomassilli, Andrea; Pérennes, Stéphane When network matters: Data center scheduling with network tasks Inproceedings IEEE International Conference on Computer Communications (INFOCOM), 2019. @inproceedings{giroire2019network, title = {When network matters: Data center scheduling with network tasks}, author = {Frédéric Giroire and Nicolas Huin and Andrea Tomassilli and Stéphane Pérennes}, url = {https://hal.inria.fr/hal-01989755}, year = {2019}, date = {2019-01-01}, booktitle = {IEEE International Conference on Computer Communications (INFOCOM)}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2018 |
Tomassilli, Andrea; Huin, Nicolas; Giroire, Frédéric; Jaumard, Brigitte Resource Requirements for Reliable Service Function Chaining Inproceedings IEEE International Conference on Communications (ICC), 2018, 2018. @inproceedings{tomassilli2018icc, title = {Resource Requirements for Reliable Service Function Chaining}, author = {Andrea Tomassilli and Nicolas Huin and Frédéric Giroire and Brigitte Jaumard}, year = {2018}, date = {2018-05-20}, booktitle = {IEEE International Conference on Communications (ICC), 2018}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Tomassilli, Andrea; Giroire, Frédéric; Huin, Nicolas; Stéphane, Perenesse Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints Inproceedings 2018 IEEE International Conference on Computer Communications, INFOCOM 2018, Honolulu, HI, USA, 2018. @inproceedings{tomassilli2018infocom, title = {Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints}, author = {Andrea Tomassilli and Frédéric Giroire and Nicolas Huin and Perenesse Stéphane}, year = {2018}, date = {2018-04-15}, booktitle = {2018 IEEE International Conference on Computer Communications, INFOCOM 2018}, address = {Honolulu, HI, USA}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Jaumard, Brigitte; Wang, Yan; Huin, Nicolas Optimal Design of Filterless Optical Networks Inproceedings 2018 20th International Conference on Transparent Optical Networks (ICTON), pp. 1–5, IEEE 2018. @inproceedings{jaumard2018optimal, title = {Optimal Design of Filterless Optical Networks}, author = {Brigitte Jaumard and Yan Wang and Nicolas Huin}, year = {2018}, date = {2018-01-01}, booktitle = {2018 20th International Conference on Transparent Optical Networks (ICTON)}, pages = {1--5}, organization = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2017 |
Huin, Nicolas; Tomassilli, Andrea; Giroire, Frédéric; Jaumard, Brigitte Energy-Efficient Service Function Chain Provisioning Inproceedings International Network Optimization Conference 2017, INOC 2017, 2017. @inproceedings{huin2017inoc, title = {Energy-Efficient Service Function Chain Provisioning}, author = {Nicolas Huin and Andrea Tomassilli and Frédéric Giroire and Brigitte Jaumard}, year = {2017}, date = {2017-01-01}, booktitle = {International Network Optimization Conference 2017, INOC 2017}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Huin, Nicolas; Jaumard, Brigitte; Giroire, Frédéric Optimization of network service chain provisioning Inproceedings 2017 IEEE International Conference on Communications, ICC 2017, IEEE, 2017, ISSN: 15503607. @inproceedings{huin2017icc, title = {Optimization of network service chain provisioning}, author = {Nicolas Huin and Brigitte Jaumard and Frédéric Giroire}, doi = {10.1109/ICC.2017.7997198}, issn = {15503607}, year = {2017}, date = {2017-01-01}, booktitle = {2017 IEEE International Conference on Communications, ICC 2017}, publisher = {IEEE}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Huin, Nicolas; Rifai, Myriana; Giroire, Frédéric; Lopez, Dino; Urvoy-Keller, Guillaume; Moulierac, Joanna Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks Inproceedings 2017 IEEE Global Communications Conference, GLOBECOM 2017, 2017. @inproceedings{huin2017globecomb, title = {Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks}, author = {Nicolas Huin and Myriana Rifai and Frédéric Giroire and Dino Lopez and Guillaume Urvoy-Keller and Joanna Moulierac}, year = {2017}, date = {2017-01-01}, booktitle = {2017 IEEE Global Communications Conference, GLOBECOM 2017}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2015 |
Giroire, Frédéric; Huin, Nicolas Study of repair protocols for live video streaming distributed systems Inproceedings 2015 IEEE Global Communications Conference, GLOBECOM 2015, IEEE, 2015, ISBN: 9781479959525. @inproceedings{giroire2015study, title = {Study of repair protocols for live video streaming distributed systems}, author = {Frédéric Giroire and Nicolas Huin}, doi = {10.1109/GLOCOM.2014.7417647}, isbn = {9781479959525}, year = {2015}, date = {2015-01-01}, booktitle = {2015 IEEE Global Communications Conference, GLOBECOM 2015}, publisher = {IEEE}, abstract = {We study distributed systems for live video streaming. These systems can be of two types: structured and unstructured. In an unstructured system, the diffusion is done opportunistically. The advantage is that it handles churn, that is the arrival and departure of users, which is very high in live streaming systems, in a smooth way. On the opposite, in a structured system, the diffusion of the video is done using explicit diffusion trees. The advantage is that the diffusion is very efficient, but the structure is broken by the churn. In this paper, we propose simple distributed repair protocols to maintain, under churn, the diffusion tree of a structured streaming system. We study these protocols using formal analysis and simulation. In particular, we provide an estimation of the system metrics, bandwidth usage, delay, or number of interruptions of the streaming. Our work shows that structured streaming systems can be efficient and resistant to churn.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } We study distributed systems for live video streaming. These systems can be of two types: structured and unstructured. In an unstructured system, the diffusion is done opportunistically. The advantage is that it handles churn, that is the arrival and departure of users, which is very high in live streaming systems, in a smooth way. On the opposite, in a structured system, the diffusion of the video is done using explicit diffusion trees. The advantage is that the diffusion is very efficient, but the structure is broken by the churn. In this paper, we propose simple distributed repair protocols to maintain, under churn, the diffusion tree of a structured streaming system. We study these protocols using formal analysis and simulation. In particular, we provide an estimation of the system metrics, bandwidth usage, delay, or number of interruptions of the streaming. Our work shows that structured streaming systems can be efficient and resistant to churn. |
Rifai, Myriana; Huin, Nicolas; Caillouet, Christelle; Giroire, Frédéric; Lopez, Dino; Moulierac, Joanna; Urvoy-Keller, Guillaume Too many SDN rules? compress them with MINNIE Inproceedings 2015 IEEE Global Communications Conference, GLOBECOM 2015, IEEE, 2015, ISBN: 9781479959525. @inproceedings{rifai2015tooGC, title = {Too many SDN rules? compress them with MINNIE}, author = {Myriana Rifai and Nicolas Huin and Christelle Caillouet and Frédéric Giroire and Dino Lopez and Joanna Moulierac and Guillaume Urvoy-Keller}, doi = {10.1109/GLOCOM.2014.7417661}, isbn = {9781479959525}, year = {2015}, date = {2015-01-01}, booktitle = {2015 IEEE Global Communications Conference, GLOBECOM 2015}, publisher = {IEEE}, abstract = {Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. In this paper, we investigate compression techniques to reduce the forwarding information base (FIB) of SDN switches. We validate our algorithm, called MINNIE, on a real testbed able to emulate a 20 switches fat tree architecture. We demonstrate that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of all new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored with a limited impact on the packet loss rate. We also evaluate the actual switching and reconfiguration times and the delay introduced by the communications with the controller.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. In this paper, we investigate compression techniques to reduce the forwarding information base (FIB) of SDN switches. We validate our algorithm, called MINNIE, on a real testbed able to emulate a 20 switches fat tree architecture. We demonstrate that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of all new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored with a limited impact on the packet loss rate. We also evaluate the actual switching and reconfiguration times and the delay introduced by the communications with the controller. |
National conferences
2020 |
Huin, Nicolas; Leguay, Jeremie; Martin, Sébastien Génération de colonnes pour le problème de routage à délai variable Inproceedings ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Lyon, France, 2020. @inproceedings{huin:hal-02875446, title = {Génération de colonnes pour le problème de routage à délai variable}, author = {Nicolas Huin and Jeremie Leguay and Sébastien Martin}, url = {https://hal.archives-ouvertes.fr/hal-02875446}, year = {2020}, date = {2020-01-01}, booktitle = {ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Lyon, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2019 |
Huin, Nicolas; Leguay, Jeremie; Martin, Sébastien; Medagliani, Paolo Découpage rigide des réseaux 5G avec FlexE Inproceedings ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France, 2019. @inproceedings{huin:hal-02119527, title = {Découpage rigide des réseaux 5G avec FlexE}, author = {Nicolas Huin and Jeremie Leguay and Sébastien Martin and Paolo Medagliani}, url = {https://hal.archives-ouvertes.fr/hal-02119527}, year = {2019}, date = {2019-01-01}, booktitle = {ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Saint Laurent de la Cabrerisse, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2018 |
Tomassilli, Andrea; Giroire, Frédéric; Huin, Nicolas; Pérennes, Stéphane Algorithmes d'approximation pour le placement de chaînes de fonctions de services avec des contraintes d'ordre Inproceedings ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, 2018. @inproceedings{tomassilli2018approx, title = {Algorithmes d'approximation pour le placement de chaînes de fonctions de services avec des contraintes d'ordre}, author = {Andrea Tomassilli and Frédéric Giroire and Nicolas Huin and Stéphane Pérennes}, url = {https://hal.archives-ouvertes.fr/hal-01774540}, year = {2018}, date = {2018-01-01}, booktitle = {ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Roscoff, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Huin, Nicolas; Jaumard, Brigitte; Giroire, Frédéric Optimisation pour le Provisionnement de Chaînes de Services Réseau Inproceedings ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, 2018. @inproceedings{huin2018sfc, title = {Optimisation pour le Provisionnement de Chaînes de Services Réseau}, author = {Nicolas Huin and Brigitte Jaumard and Frédéric Giroire}, url = {https://hal.archives-ouvertes.fr/hal-01779589}, year = {2018}, date = {2018-01-01}, booktitle = {ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Roscoff, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2016 |
Giroire, Frédéric; Huin, Nicolas Étude d'un système distribué de diffusion de vidéo en direct Inproceedings ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, 2016. @inproceedings{giroire2016etude, title = {Étude d'un système distribué de diffusion de vidéo en direct}, author = {Frédéric Giroire and Nicolas Huin}, url = {https://hal.inria.fr/hal-01305116}, year = {2016}, date = {2016-01-01}, booktitle = {ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Bayonne, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Rifai, Myriana; Huin, Nicolas; Caillouet, Christelle; Giroire, Frédéric; Moulierac, Joanna; Lopez, Dino; Urvoy-Keller, Guillaume MINNIE : enfin un monde SDN sans (trop de) règles Inproceedings ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France, 2016. @inproceedings{rifai2016minnieAlgoTel, title = {MINNIE : enfin un monde SDN sans (trop de) règles}, author = {Myriana Rifai and Nicolas Huin and Christelle Caillouet and Frédéric Giroire and Joanna Moulierac and Dino Lopez and Guillaume Urvoy-Keller}, url = {https://hal.inria.fr/hal-01304687}, year = {2016}, date = {2016-01-01}, booktitle = {ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Bayonne, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
2015 |
Havet, Frédéric; Huin, Nicolas; Moulierac, Joanna; Phan, Khoa Routage vert et compression de règles SDN Inproceedings ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, 2015. @inproceedings{havet2015routage, title = {Routage vert et compression de règles SDN}, author = {Frédéric Havet and Nicolas Huin and Joanna Moulierac and Khoa Phan}, url = {https://hal.archives-ouvertes.fr/hal-01148471}, year = {2015}, date = {2015-01-01}, booktitle = {ALGOTEL 2015 - 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications}, address = {Beaune, France}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Work under submission
Sorry, no publications matched your criteria.