Filters








84 Hits in 1.2 sec

Optimal Network Service Chain Provisioning

Nicolas Huin, Brigitte Jaumard, Frederic Giroire
2018 IEEE/ACM Transactions on Networking  
Huin and F. Giroire are with Université Côte d'Azur, Inria, CNRS, I3S, UNS, Sophia Antipolis, France. Emails: nicolasjfhuin@gmail.com, frederic.giroire@cnrs.fr B.  ... 
doi:10.1109/tnet.2018.2833815 fatcat:lsmo4a3wyjf3naqzwsxbf5xz5u

Optimization of network service chain provisioning

Nicolas Huin, Brigitte Jaumard, Frederic Giroire
2017 2017 IEEE International Conference on Communications (ICC)  
Huin and F. Giroire have been partially supported by ANR program ANR-11-LABX-0031-01 and Mitacs.  ... 
doi:10.1109/icc.2017.7997198 dblp:conf/icc/HuinJG17 fatcat:y5cakrqjvvbltcunf2pfzq52cq

Energy-Efficient Service Function Chain Provisioning

Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte Jaumard
2018 Electronic Notes in Discrete Mathematics  
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
more » ... he resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network functions in a specific order. We propose an ILP formulation, an ILP-based heuristic, as well as a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% to 62% of energy savings for networks of different sizes.
doi:10.1016/j.endm.2018.02.001 fatcat:65lj4o4pe5e4jdk2n3jw5lwz2m

Energy-Aware Routing in Software-Defined Network using Compression

Frédéric Giroire, Nicolas Huin, Joanna Moulierac, Truong Khoa Phan
2018 Computer journal  
Software-defined Networks (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, virtualmachine migration, tra c engineering and access control. In this paper, we focus on using SDN for energy-aware routing (EAR). Since tra c 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
more » ... y. SDN can collect tra c 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 e cient 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.
doi:10.1093/comjnl/bxy029 fatcat:i6mhjlcm2nggvgbr6qkcgvxzj4

Study of Repair Protocols for Live Video Streaming Distributed Systems

Frederic Giroire, Nicolas Huin
2014 2015 IEEE Global Communications Conference (GLOBECOM)  
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,
more » ... 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.
doi:10.1109/glocom.2014.7417647 dblp:conf/globecom/GiroireH15 fatcat:z4yw44ecufc53j3clihhivzzd4

Resource Requirements for Reliable Service Function Chaining

Andrea Tomassilli, Nicolas Huin, Frederic Giroire, Brigitte Jaumard
2018 2018 IEEE International Conference on Communications (ICC)  
doi:10.1109/icc.2018.8422774 dblp:conf/icc/TomassilliHGJ18 fatcat:a5re3h4d5ncfjpplihphwzvjqi

The Structured Way of Dealing with Heterogeneous Live Streaming Systems [chapter]

Andrea Tomassilli, Nicolas Huin, Frédéric Giroire
2019 Lecture Notes in Networks and Systems  
In peer-to-peer networks for video live streaming, peers can share the forwarding load in two types of systems: unstructured and structured. In unstructured overlays, the graph structure is not well-defined, and a peer can obtain the stream from many sources. In structured overlays, the graph is organized as a tree rooted at the server and parent-child relationships are established between peers. Unstructured overlays ensure robustness and a higher degree of resilience compared to the
more » ... ed to the structured ones. Indeed, they better manage the dynamics of peer participation or churn. Nodes can join and leave the system at any moment. However, they are less bandwidth efficient than structured overlays. In this work, we propose new simple distributed repair protocols for video live streaming structured systems. We show, through simulations and with real traces from Twitch, that structured systems can be very efficient and robust to failures, even for high churn and when peers have very heterogeneous upload bandwidth capabilities.
doi:10.1007/978-3-030-33509-0_38 fatcat:4gfneq5t6bbihg4lp3ewg2r5ei

Minnie : An SDN world with few compressed forwarding rules

Myriana Rifai, Nicolas Huin, Christelle Caillouet, Frederic Giroire, Joanna Moulierac, Dino Lopez Pacheco, Guillaume Urvoy-Keller
2017 Computer Networks  
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. 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.
more » ... 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 entry 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 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 ASICs. Hence, both simulations and experimental results suggest that MINNIE can be safely deployed in real networks, providing compression ratios between 70% and 99%. Résumé : Les Software Defined Networks (SDN) prennent de l'ampleur grâceà l'appui de grands fabricants. Bien qu'il apporte de la souplesse dans la gestion des flots au sein des centre de données, cette flexibilité se fait au détriment des capacités de table de routage, qui sont plus petites. En effet, la mémoire requis par les périphériques SDN (TCAM) a une capcité réduite par rapportà celle utilisés dans le matériel existant. Dans cet article, nousétudions des techniques de compression pour maximiser l'utilisation des tables de routage SDN. Nous validons notre algorithme, appelé MINNIE, avec des simulations intensives sue des topologies de centre de données connues, afin d'étudier son efficacité et le taux de compression pour un grand nombre de règles. Nos résultats indiquent que MINNIE passe bienà l'échelle,être en mesure de traiter environ un million de différents flux avec moins de 1000 entrée de transfert par commutateur SDN, nécessitant un temps de calcul négligeable. Pourévaluer la viabilité de MINNIE dans les réseaux réels, nous déployons une plateforme capable d'émuler un k = 4 fat-tree. Nous démontrons d'une part, que même avec un petit nombre de clients, la limite en termes de nombre de règles est atteinte si aucune compression est réalisée, augmentant le délai des nouveaux flots arrivants. MINNIE, d'autre part, réduit considérablement le nombre de règles qui doiventêtre stockées, sans pertes de paquets, ni délai supplémentaires visibles. Par conséquent, les résultats de simulations et expérimentaux suggèrent que MINNIE peutêtre déployé en toute sécurité dans des réseaux réels, offrant des taux de compression entre 70 % et 99 %. Mots-clés : Software Defined Networks, réseaux programmables, réseaux de centre de données, table de routage, mémoire TCAM
doi:10.1016/j.comnet.2017.04.026 fatcat:zopp4e6ribhrpmvguftvkfkmu4

β-Cyclodextrin-Based Star Amphiphilic Copolymers: Synthesis, Characterization, and Evaluation as Artificial Channels

Ibrahima Faye, Cécile Huin, Nicolas Illy, Véronique Bennevault, Philippe Guégan
2018 Macromolecular Chemistry and Physics  
[36] Huin et al.  ... 
doi:10.1002/macp.201800308 fatcat:vgrzr2yc2rafjoy5z5amyowvfm

Using Microscopy to Help with the Understanding of Degradation Mechanisms Observed in Materials of Pressurized Water Reactors

Laurent Legras, Alexandre Volgin, Bertrand Radiguet, Philippe Pareige, Cedric Pokor, Brigitte Décamps, Thierry Couvant, Nicolas Huin, Romain Soulas
2017 Journal of Materials Science and Engineering: B  
Huin [67] and will be briefly illustrated in the following. Results and Discussion Initial surface of materials plays an important role in fatigue crack initiation.  ... 
doi:10.17265/2161-6221/2017.9-10.002 fatcat:yprxnfsb2jelblveqyflko7ymi

Identification of a Small Molecule Yeast TORC1 Inhibitor with a Multiplex Screen Based on Flow Cytometry

Jun Chen, Susan M. Young, Chris Allen, Andrew Seeber, Marie-Pierre Péli-Gulli, Nicolas Panchaud, Anna Waller, Oleg Ursu, Tuanli Yao, Jennifer E. Golden, J. Jacob Strouse, Mark B. Carter (+10 others)
2012 ACS Chemical Biology  
TOR (target of rapamycin) is a serine/threonine kinase, evolutionarily conserved from yeast to human, which functions as a fundamental controller of cell growth. The moderate clinical benefit of rapamycin in mTOR-based therapy of many cancers favors the development of new TOR inhibitors. Here we report a high-throughput flow cytometry multiplexed screen using five GFP-tagged yeast clones that represent the readouts of four branches of the TORC1 signaling pathway in budding yeast. Each
more » ... ast. Each GFP-tagged clone was differentially color-coded, and the GFP signal of each clone was measured simultaneously by flow cytometry, which allows rapid prioritization of compounds that likely act through direct modulation of TORC1 or proximal signaling components. A total of 255 compounds were confirmed in dose-response analysis to alter GFP expression in one or more clones. To validate the concept of the high-throughput screen, we have characterized CID 3528206, a small molecule most likely to act on TORC1 as it alters GFP expression in all five GFP clones in a manner analogous to that of rapamycin. We have shown that CID 3528206 inhibited yeast cell growth and that CID 3528206 inhibited TORC1 activity both in vitro and in vivo with EC(50)'s of 150 nM and 3.9 μM, respectively. The results of microarray analysis and yeast GFP collection screen further support the notion that CID 3528206 and rapamycin modulate similar cellular pathways. Together, these results indicate that the HTS has identified a potentially useful small molecule for further development of TOR inhibitors.
doi:10.1021/cb200452r pmid:22260433 pmcid:PMC3331904 fatcat:eyw6dpcq7va5xh2yeqayrqhgie

Table of contents

2018 IEEE Transactions on Green Communications and Networking  
Nicolas Huin, Myriana Rifai, Frédéric Giroire, Dino Lopez Pacheco, Guillaume Urvoy-Keller, and Joanna Moulierac 1128 Structure Free Aggregation in Duty Cycle Sensor Networks for Delay Sensitive Applications  ... 
doi:10.1109/tgcn.2018.2878389 fatcat:joluutdgerfd5bbksq2m2a5hgi

Program

2021 2021 17th International Conference on the Design of Reliable Communication Networks (DRCN)  
Huin (Huawei Technologies, France); Jeremie Leguay (Huawei Technologies, France Research Center, France) 15:11 Compositional model checking of an SDN platform Abdul Majith Noordheen (University  ...  of Coimbra, INESC Coimbra, Department of Electrical and Computer Engineering, Coimbra, Portugal) 14:52 Constrained Policy Optimization for Load Balancing Yassine Kamri, Tran Anh Quang Pham and Nicolas  ... 
doi:10.1109/drcn51631.2021.9477374 fatcat:hijdamj57zcexgyp7aohwsvrka

Page 323 of Edinburgh Review: Critical Journal Vol. 136, Issue 278 [page]

1872 Edinburgh Review: Critical Journal  
Petit- nicolas and Pourthie, met a similar fate near the city of Hang- yang ; whilst the coadjutor. Monseigneur Daveluy, with I’abbe Huin and another missionary, M.  ... 

Page 899 of Revue Des Deux Mondes Vol. 61, Issue [page]

1884 Revue Des Deux Mondes  
Aumaître et Huin, ainsi que de nombreux indigènes chrétiens, étaient torturés, puis déca- pités sur les berges du fleuve qui baigne la capitale, non loin du village de Sai-Nam-To.  ...  aïlés, les tribunes, se composent de deux petites chambres dans lesquelles nos chrétiens et nos chré- tiennes sont entassés. » En 1866, Me Berneux et MM. de Brétenières, Beaulieu, Dorie, Pourthié, Petit-Nicolas  ... 
« Previous Showing results 1 — 15 out of 84 results