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. Abstract | Links | BibTeX @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. Abstract | Links | BibTeX @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. Links | BibTeX @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. BibTeX @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. BibTeX @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. BibTeX @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. BibTeX @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. Links | BibTeX @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. BibTeX @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. Abstract | Links | BibTeX @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. Abstract | Links | BibTeX @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. |