Simulation Toolbox for Studying Energy Consumption in Wired Networks
|
|
- Thomasina Wade
- 5 years ago
- Views:
Transcription
1 Simulation Toolbox for Studying Energy Consumption in Wired Networks Anne-Cécile Orgerie, Betsegaw Lemma Amersho, Timothée Haudebourg, Martin Quinson, Myriana Rifai, Dino Lopez Pacheco, Laurent Lefèvre To cite this version: Anne-Cécile Orgerie, Betsegaw Lemma Amersho, Timothée Haudebourg, Martin Quinson, Myriana Rifai, et al.. Simulation Toolbox for Studying Energy Consumption in Wired Networks. CNSM: International Conference on Network and Service Management, Nov 2017, Tokyo, Japan. pp.1-5, <hal > HAL Id: hal Submitted on 28 Nov 2017 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
2 Simulation Toolbox for Studying Energy Consumption in Wired Networks Anne-Cécile Orgerie, Betsegaw Lemma Amersho, Timothée Haudebourg, Martin Quinson, Myriana Rifai, Dino Lopez Pacheco and Laurent Lefèvre CNRS, IRISA, Rennes, France Université Rennes 1, France & Aalto University, Finland ENS Rennes, IRISA, Rennes, France {timothee.haudebourg, Université Nice Sophia Antipolis, I3S, France {mrifai, Inria, LIP, ENS Lyon, University of Lyon, France Abstract Networking infrastructures are considered to consume as much energy as terminal end-user equipment or datacenters. While energy consumption of wireless networks is a matter of concern since their beginning, it is not the case for wired networks as they do not rely on batteries, but on plugged equipment. Yet, facing growing consumption, energyefficient techniques start to be implemented in wired networks. However, measuring the end-to-end energy consumption of wired networking infrastructures remains a real challenge for network operators and scientists. This article presents the ECOFEN (Energy Consumption model For End-to-end Networks) framework which allows to support precise simulation of energy consumption of large-scale complex wired networks. The experimental validation shows that Ecofen provides accurate energy consumption values. Index Terms Energy consumption, simulation, wired networks, green device, ns3 I. INTRODUCTION Networking infrastructures are considered to consume as much energy as terminal end-user equipment or datacenters [3]. But contrary to the two last families of consumers, networks can be very complex by nature with remote or legacy devices. Thus measuring end-to-end energy consumption of networking infrastructures can be unreachable or at least remains a real challenge for network operators and scientists. Simulation of energy consumption of networks is an alternative way in order to understand the energy impact of networking scenarios. This simulation approach has been widely studied in wireless open-source context where relevant devices are battery based and need to optimize their energy consumption [8], [11]. But such simulation frameworks dedicated for energy usage of wired infrastructures are mainly designed by network operators for specific networks. Based on ns-2 simulator, the Ecofen framework (End-to-end energy Cost model and simulator For Evaluating power consumption in large-scale Networks) has been proposed in 2011 [7]. In 2013, Ecofen, has been refined and re-designed for ns- 3 [5] simulator, a discrete-event simulator for Internet systems, targeted primarily for research and educational use. Since then, Ecofen has been used by several research teams for studying various networking infrastructures. Ecofen has become a mature framework able to simulate complex networking scenarios in order to study energy consumption and energy leverages in networks. The main goal of the Ecofen toolbox is to provide a simulating environment for large-scale wired networks where users can obtain the energy consumption of their new protocols, algorithms and frameworks involving different types of technologies and equipment. It is endowed with several energy models, and several representative network devices are pre-defined using energy consumption values found in the literature. The article is organized as follows. Section II presents the related works. Section III introduces the Ecofen model and simulator. Section IV analyzes a validation of the framework. Section V concludes and presents future work. II. RELATED WORK AND CONTEXT Several network simulators are available for studying and analyzing wired networks like OMNET++ discrete event simulator [6] or the ns-* frameworks. One of the most famous network simulator is the ns-2 simulator [4]. Ns-2 is a discreteevent network simulator and has been widely employed to study several transport and network layer protocols over wiredand wireless-based networks. While the high popularity of ns- 2 catalyzed the implementation of several protocol models, the simplicity of the implemented models might lead to results different to the ones that would be obtained in real networks [2], [10]. This is the case for instance of the by-default TCP models in ns-2 and this is why a Linux-based code, known as the TCP-Linux ns-2 agent, has been implemented for instance. To tackle the accuracy problems in the ns-2 results, the ns-3 network simulator has been developed [5]. Note that the ns-2 and the ns-3 simulators are incompatible. Ns-3 is a discreteevent network simulator, built as a C++ library which may be statically or dynamically linked to a C++ main program that defines the simulation topology and starts the simulator. In ns-3, the accuracy of the results are improved with the introduction of several Linux protocols implementations and kernel modules in its framework (e.g. the TCP/IP Linux implementation). Additionally, external Linux-based user-land tools can be plugged to the ns-3 simulator by means of the
3 ns-3-dce API. Hence, iperf or still Quagga can be used in ns-3 simulations. III. THE ECOFEN FRAMEWORK This section describes the Ecofen features and implementation. The Ecofen simulator has an architecture comprising three layers: energy models, green functions and network management. The energy models define the energy consumption values for each device and thus the relation between energy consumption and traffic load. The green functions are energyaware levers to enable devices to be put to sleep or to be completely turned off for example. They come with their own energy model (energy required to switch off an interface for instance). The state-of-the-art services provide network-wide functions such as energy-aware routing protocols or network management algorithms. Such services are not yet implemented in Ecofen but can be added by users using the green functions (to switch off nodes for instance, or to get the energy consumption of each device). The simulator provides energy consumption values at different levels: for the entire studied network (to compare networkwide frameworks); for a given equipment (to compare nodelevel optimizations); for a given transfer or flow (to evaluate the cost of a service or a data transfer). It is implemented within the ns-3 network simulator, and can thus benefit from all the protocols already implemented in this simulator. A. Energy models To model the energy consumption at a low level, the Ecofen simulator provides different energy models and different energy profiles for several categories of devices. The consumption of each equipment is divided between the chassis consumption and the consumption of the interfaces (or ports). Different models are proposed for the interfaces and for the moment, only one model is proposed for the chassis. These models can be configured for each modeled device using measured values or values taken from literature. So, according to the values used for the ports and for the chassis, users can simulate Ethernet cards, routers, switches, etc. Currently in Ecofen, the ns-3 supported models include PointToPointNetDevice and CsmaNetDevice for the net device models (interfaces), and Ipv4 and Ipv6 for the IP layer. Currently, only one model is implemented for the nodes (chassis consumption). It allows users to specify an OnConso: the node s power consumption (in Watts) when it is on, and an OffConso: the node s power consumption when the node is switched off. These values can be put to 0 if required. Each node of the simulation has its own model (so nodes can use different power values within the same simulation). Currently, three energy models are available for the net devices (per interface consumption): basic, that allows user to specify the OnConso (OffConso): the interface s power consumption when it is on (respectively off). linear, that allows user to specify the OffConso (IdleConso): the interface s power consumption when it is off (respectively on but idle, i.e. no traffic), and a ByteEnergy value: the energy consumed per processed Byte (incoming or outgoing). complete, that allows user to specify OffConso (IdleConso): the interface s power consumption when it is off (respectively on but idle); RecvByteEnergy (SentByteEnergy): the energy consumed per Byte received (respectively sent); and RecvPktEnergy: the energy consumed per packet received (respectively sent). The last model relies on the fact that the energy consumption of some interfaces depends on the traffic in two ways: it depends on the number of Bytes (because they need to be written in memory for instance), and it depends on the number of packets (because they need to be processed: reading the headers for instance) [9]. Table I summarizes the possible attributes per energy model, with the unit and the data format of each attribute. TABLE I ATTRIBUTES FOR EACH ENERGY MODEL Model name Attribute name Expected units Format Node energy models basic OnConso Watts double Net device energy models basic OnConso Watts double linear IdleConso Watts double ByteEnergy nanojoules per Byte double complete IdleConso Watts double RecvByteEnergy nanojoules per Byte double SentByteEnergy nanojoules per Byte double RecvPktEnergy nanojoules per packet double SentPktEnergy nanojoules per packet double B. Green functions The Ecofen simulator provides basic tools (or green functions) to design complex energy-efficient frameworks, protocols and algorithms that act at the network level. These basic tools are energy-efficient techniques that can be applied at the node level, currently on/off techniques, ALR and LPI [1]. The user is responsible to implement the coordination framework on top of these functions. For example, the simulator provides a function to switch off the devices, but the user has to determine when this function is used (e.g. autonomic decision or coordinated plan). Ecofen enables to switch off ports. This functionality can be used to switch off unused ports or to simulate failures. Switching on and off require time and energy. In the Ecofen simulator, these two parameters can be modified by users. Ecofen provides several functions to the users: NetDeviceSwitchOff (NetDeviceSwitchOn) to switch off (respectively on) an interface at a given date;
4 LinkSwitchOff (LinkSwitchOff) to switch off (respectively on) a link at a given date. Prior to use these functions, the user should precise an energy model to employ to switch on and off the interfaces. This model allows users to specify the energy parameters that will be used to switch on and off interfaces: SwitchOffEnergy (SwitchOnEnergy): the total amount of energy needed to switch off (respectively on) the interface and SwitchOffDuration (SwitchOnDuration): the time needed to switch off (respectively on) the interface. A switch off interface cannot receive nor send traffic. Along with interface switching functions, Ecofen provides similar tools to switch on and off entire nodes: NodeSwitchOff (NodeSwitchOn) to switch off (respectively on) a node at a given date. Similarly to the interface model, for switching a node, the user should first define an energy model. When a node is switched off, all its interfaces are unreachable. IV. VALIDATION Both the linear and complete models can produce values of power consumption as a function of traffic. The basic model, on the other hand, produces power consumption values based on the ON or OFF state of a node, it does not consider network traffic. Therefore we describe the validation experiments for both the linear and the complete models in this section. The basic procedure for the validation experiment is first to simulate, using Ecofen, power consumption in response to traffic sent or received and then to compare the results against data obtained from literature where actual measurements are conducted. A. Validating the Linear Model Sivaraman et al. [9] provide the results of power consumption experiments on real equipment. These experiments show the linear relationship that exists between traffic volume (in Mbps) and power consumption (in Watts) for fixed packet sizes of 100, 576, 1000, and 1500 Bytes. Furthermore, the linear fit equations for each of the packet size are also provided. The authors intention in these experiments is to determine values of the per-byte and the per-packet processing energy consumption, however, our intention is to use the per-byte energy consumption value that they have experimentally determined and to use it in Ecofen to get power consumption values for a given volume of traffic. We then compare the results we obtained with the linear fit models provided in [9]. In their experiments, the authors used three kinds of hardware devices: (1) NetFPGA router card that has four 1 Gbps Ethernet ports, (2) IXIA hardware traffic-generator for generating packets with the desired packet-size and data-rate, and (3) highfidelity oscilloscope for measuring the power consumed by the NetFPGA card as a consequence of the packets send or received. In this validation experiment we wish to simulate the experiments conducted by Sivaraman et al. as closely as possible. Fig. 1. Power consumption vs data-rate comparison between expected (or measured) values (in blue) and simulated values (in yellow) for a fixed packet size of 100, 576, 1000, and 1500 Bytes. With this in mind, we setup, in our ns-3 simulation script, a three node simple network with first and third nodes connected to the second node. All the three nodes are connected to each other by links that have maximum bandwidth capacity of 1 Gbps and delay of 10 ms. For the generated traffic volume in the simulation, we used uniform random number generator provided by ns-3. Finally, each experiment was run 40 times, each time with a different value for the random number generator. The results obtained are depicted in Figure 1. In the graph the expected power consumption values from the linear fit models shown in [9] along with the simulated values for each of the packet sizes (100, 576, 1000, and 1500 bytes) are displayed. Visually, the simulated and the expected values seem to agree very well, even though a gap draws between them as the data rate increases (specially true for the case of 100- bytes packet lengths). Hence, to better assess the accuracy of our results, we run unpaired t-test statistical test using the produced data. The summary of this test is shown in Table II. The 95% confidence interval values shown in Table II of difference in mean between the measured and simulated values are very close to zero and in fact zero is also one of the values. According to the P-values, the null hypothesis that the difference in mean between the simulated and the expected values is zero is not rejected. The conclusion in this validation test is that the linear model of Ecofen is accurate in predicting the power consumed by NetFPGA router for a given volume of traffic.
5 TABLE II UNPAIRED T-TEST RESULTS FOR SIMULATED AND MEASURED POWER CONSUMPTION VALUES FOR ECOFEN S LINEAR Packet Size Confidence Interval of difference in mean Mean of Expected Mean of Simulated P-Value 100 [-0.027, 0.110] [-0.039, 0.082] [-0.043, 0.073] [-0.062, 0.048] B. Validating the Complete Model Roughly, in this validation experiment, we have used the same experimental configuration and procedure as that of the linear validation experiment that we have described in the previous section. One of the main difference between the complete and the linear model of Ecofen is that the complete model distinguishes between the received and sent bytes. Which means that different energy consumption values can be assigned to bytes based on the direction of transfer. The linear model, on the other hand, assigns same value for both. The other main difference is that the complete model considers the packet processing energy consumption cost both for the sent and received packets. Sivaraman et al. [9] also conducted experiments to determine energy consumption values for per-byte receive or transmit and per-packet processing. The experimentally determined values for per-byte receive is 1.3 nj, for per-byte transmit is 2.1 nj, and for per-packet processing is 197.2nJ. Power Consumption in Watt Expected 1000 Simulated Traffic in Kilo PPS Fig. 2. Power consumption vs data-rate comparison between expected (or measured) values (in blue) and simulated values (in yellow) for a fixed packet size of 1000 Bytes for the sending end The results for the sending and receiving are shown in Figures 2 and 3, respectively. Table III shows the unpaired t-test result for one packetsizes in the transmitting side (Tx) and for two packet-sizes in the receiving side (Rx). Again in this case, the 95% confidence interval values shown in Table III of difference in mean between the measured and simulated values are very close to zero and in fact zero Fig. 3. Power consumption vs data-rate comparison between expected (or measured) values (in blue) and simulated values (in yellow) for a fixed packet size of 576 and 1500 Bytes for the receiving end TABLE III UNPAIRED T-TEST RESULTS FOR SIMULATED AND MEASURED POWER CONSUMPTION VALUES FOR ECOFEN S COMPLETE MODEL Packet Size End Confidence interval of difference in mean Mean of Expected Mean of Simulated P-Value 576 Rx [-0.067, 0.039] Rx [-0.010, 0.095] Tx [-0.096, 0.053] is also one of the values. According to the P-values, the null hypothesis that the difference in mean between the measured and the simulated values is zero is not rejected. The conclusion from this validation experiment is also the same as the previous one, the Ecofen s complete energy consumption model accurately predicts power consumed by NetFPGA router for a given volume of sent or received traffic. V. CONCLUSION Studying and understanding the energy consumption of the network infrastructures can be very complex due to the presence of multiple forwarding devices and middle-boxes, potentially spread over multiple countries. Simulation tools are good candidates to study the energy consumption of networks. However, while multiple solutions exist to study the energy consumption in wireless networks (e.g. in networks) through simulation, little attention has been put over wired networks. The Ecofen model, proposed in this article, aims at filling the void of energy modeling in wired networks. Ecofen was initially designed to be integrated into the ns-2 simulator. Currently, we have redesigned and updated Ecofen to be integrated within the ns-3 network simulator. Since ns-3 is able to run native Linux code to provide results close to the real life, ns-3 with Ecofen is expected to provide valuable insights about the energy consumption of real networks and energy efficient protocols.
6 REFERENCES [1] T. Haudebourg and A.-C. Orgerie, On the Energy Efficiency of Sleeping and Rate Adaptation for Network Devices, in International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), [2] G. F. Lucio, M. Paredes-farrera, E. Jammeh, M. Fleury, and M. J. Reed, Opnet modeler and ns-2: Comparing the accuracy of network simulators for packet-level analysis using a network testbed, in In 3rd WEAS International Conference on Simulation, Modelling and Optimization (ICOSMO), 2003, pp [3] Nokia, Global what-if analyzer of network energy consumption, http: //gwatt.net, [4] ns-2. [Online]. Available: [5] ns3 network simulator. [Online]. Available: ns-3-11/ [6] OMNeT++ Discrete Event Simulator. [Online]. Available: https: //omnetpp.org/ [7] A.-C. Orgerie, L. Lefèvre, I. Guérin-Lassous, and D. Lopez Pacheco, Ecofen: an end-to-end energy cost model and simulator for evaluating power consumption in large-scale networks, in SustaInet: First International Workshop on Sustainable Internet and Internet for Sustainability (in conjunction with WoWMoM), [8] P. Serrano, A. Garcia-Saavedra, G. Bianchi, A. Banchs, and A. Azcorra, Per-Frame Energy Consumption in Devices and Its Implication on Modeling and Design, IEEE/ACM Transactions on Networking, vol. 23, no. 4, pp , [9] V. Sivaraman, A. Vishwanath, Z. Zhao, and C. Russell, Profiling per-packet and per-byte energy consumption in the NetFPGA Gigabit router, in 2011 Conference on Computer Communications Workshops (INFOCOM Workshops), 2011, pp [10] D. X. Wei and P. Cao, Ns-2 tcp-linux: An ns-2 tcp implementation with congestion control algorithms from linux, in Proceeding from the 2006 Workshop on Ns-2: The IP Network Simulator, ser. WNS2 06. New York, NY, USA: ACM, [Online]. Available: [11] H. Wu, S. Nabar, and R. Poovendran, An Energy Framework for the Network Simulator 3 (NS-3), in International ICST Conference on Simulation Tools and Techniques (SIMUTools), 2011, pp
Setup of epiphytic assistance systems with SEPIA
Setup of epiphytic assistance systems with SEPIA Blandine Ginon, Stéphanie Jean-Daubias, Pierre-Antoine Champin, Marie Lefevre To cite this version: Blandine Ginon, Stéphanie Jean-Daubias, Pierre-Antoine
More informationReal-Time and Resilient Intrusion Detection: A Flow-Based Approach
Real-Time and Resilient Intrusion Detection: A Flow-Based Approach Rick Hofstede, Aiko Pras To cite this version: Rick Hofstede, Aiko Pras. Real-Time and Resilient Intrusion Detection: A Flow-Based Approach.
More informationHardware Acceleration for Measurements in 100 Gb/s Networks
Hardware Acceleration for Measurements in 100 Gb/s Networks Viktor Puš To cite this version: Viktor Puš. Hardware Acceleration for Measurements in 100 Gb/s Networks. Ramin Sadre; Jiří Novotný; Pavel Čeleda;
More informationPerformance Evaluation of Energy Efficient Policies for Ethernet Switches
Performance Evaluation of Energy Efficient Policies for Ethernet Switches Béatrice Paillassa, Riadh Dhaou, Gentian Jakllari, Thaenchaikun Chakadkit To cite this version: Béatrice Paillassa, Riadh Dhaou,
More informationVery Tight Coupling between LTE and WiFi: a Practical Analysis
Very Tight Coupling between LTE and WiFi: a Practical Analysis Younes Khadraoui, Xavier Lagrange, Annie Gravey To cite this version: Younes Khadraoui, Xavier Lagrange, Annie Gravey. Very Tight Coupling
More informationBoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm
BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard To cite this version: Zeina Azmeh, Fady Hamoui, Marianne Huchard. BoxPlot++. RR-11001, 2011. HAL Id: lirmm-00557222 https://hal-lirmm.ccsd.cnrs.fr/lirmm-00557222
More informationComputing and maximizing the exact reliability of wireless backhaul networks
Computing and maximizing the exact reliability of wireless backhaul networks David Coudert, James Luedtke, Eduardo Moreno, Konstantinos Priftis To cite this version: David Coudert, James Luedtke, Eduardo
More informationSimulations of VANET Scenarios with OPNET and SUMO
Simulations of VANET Scenarios with OPNET and SUMO Florent Kaisser, Christophe Gransart, Marion Berbineau To cite this version: Florent Kaisser, Christophe Gransart, Marion Berbineau. Simulations of VANET
More informationTaking Benefit from the User Density in Large Cities for Delivering SMS
Taking Benefit from the User Density in Large Cities for Delivering SMS Yannick Léo, Anthony Busson, Carlos Sarraute, Eric Fleury To cite this version: Yannick Léo, Anthony Busson, Carlos Sarraute, Eric
More informationSIM-Mee - Mobilizing your social network
SIM-Mee - Mobilizing your social network Jérémie Albert, Serge Chaumette, Damien Dubernet, Jonathan Ouoba To cite this version: Jérémie Albert, Serge Chaumette, Damien Dubernet, Jonathan Ouoba. SIM-Mee
More informationService Reconfiguration in the DANAH Assistive System
Service Reconfiguration in the DANAH Assistive System Said Lankri, Pascal Berruet, Jean-Luc Philippe To cite this version: Said Lankri, Pascal Berruet, Jean-Luc Philippe. Service Reconfiguration in the
More informationA Measurement-Based Model of Energy Consumption for PLC Modems
A Measurement-Based Model of Energy Consumption for PLC Modems Wafae Bakkali, Mohamed Tlich, Pascal Pagani, Thierry Chonavel To cite this version: Wafae Bakkali, Mohamed Tlich, Pascal Pagani, Thierry Chonavel.
More informationAssisted Policy Management for SPARQL Endpoints Access Control
Assisted Policy Management for SPARQL Endpoints Access Control Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien Gandon To cite this version: Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien
More informationFIT IoT-LAB: The Largest IoT Open Experimental Testbed
FIT IoT-LAB: The Largest IoT Open Experimental Testbed Eric Fleury, Nathalie Mitton, Thomas Noel, Cédric Adjih To cite this version: Eric Fleury, Nathalie Mitton, Thomas Noel, Cédric Adjih. FIT IoT-LAB:
More informationExperimental Evaluation of an IEC Station Bus Communication Reliability
Experimental Evaluation of an IEC 61850-Station Bus Communication Reliability Ahmed Altaher, Stéphane Mocanu, Jean-Marc Thiriet To cite this version: Ahmed Altaher, Stéphane Mocanu, Jean-Marc Thiriet.
More informationReverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces
Reverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces Romain Delamare, Benoit Baudry, Yves Le Traon To cite this version: Romain Delamare, Benoit Baudry, Yves Le Traon. Reverse-engineering
More informationTacked Link List - An Improved Linked List for Advance Resource Reservation
Tacked Link List - An Improved Linked List for Advance Resource Reservation Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu To cite this version: Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu. Tacked Link List
More informationComparison of spatial indexes
Comparison of spatial indexes Nathalie Andrea Barbosa Roa To cite this version: Nathalie Andrea Barbosa Roa. Comparison of spatial indexes. [Research Report] Rapport LAAS n 16631,., 13p. HAL
More informationA Practical Evaluation Method of Network Traffic Load for Capacity Planning
A Practical Evaluation Method of Network Traffic Load for Capacity Planning Takeshi Kitahara, Shuichi Nawata, Masaki Suzuki, Norihiro Fukumoto, Shigehiro Ano To cite this version: Takeshi Kitahara, Shuichi
More informationKeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard
KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard Mathieu Raynal, Nadine Vigouroux To cite this version: Mathieu Raynal, Nadine Vigouroux. KeyGlasses : Semi-transparent keys
More informationNatural Language Based User Interface for On-Demand Service Composition
Natural Language Based User Interface for On-Demand Service Composition Marcel Cremene, Florin-Claudiu Pop, Stéphane Lavirotte, Jean-Yves Tigli To cite this version: Marcel Cremene, Florin-Claudiu Pop,
More informationMalware models for network and service management
Malware models for network and service management Jérôme François, Radu State, Olivier Festor To cite this version: Jérôme François, Radu State, Olivier Festor. Malware models for network and service management.
More informationAn FCA Framework for Knowledge Discovery in SPARQL Query Answers
An FCA Framework for Knowledge Discovery in SPARQL Query Answers Melisachew Wudage Chekol, Amedeo Napoli To cite this version: Melisachew Wudage Chekol, Amedeo Napoli. An FCA Framework for Knowledge Discovery
More informationRobust IP and UDP-lite header recovery for packetized multimedia transmission
Robust IP and UDP-lite header recovery for packetized multimedia transmission Michel Kieffer, François Mériaux To cite this version: Michel Kieffer, François Mériaux. Robust IP and UDP-lite header recovery
More informationThe Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks
The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks Florian Huc, Claudia Linhares Sales, Hervé Rivano To cite this version: Florian Huc, Claudia Linhares Sales, Hervé Rivano.
More informationYANG-Based Configuration Modeling - The SecSIP IPS Case Study
YANG-Based Configuration Modeling - The SecSIP IPS Case Study Abdelkader Lahmadi, Emmanuel Nataf, Olivier Festor To cite this version: Abdelkader Lahmadi, Emmanuel Nataf, Olivier Festor. YANG-Based Configuration
More informationA Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme
A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme Yue Zhang, Yunxia Pei To cite this version: Yue Zhang, Yunxia Pei. A Resource Discovery Algorithm in Mobile Grid Computing
More informationChange Detection System for the Maintenance of Automated Testing
Change Detection System for the Maintenance of Automated Testing Miroslav Bures To cite this version: Miroslav Bures. Change Detection System for the Maintenance of Automated Testing. Mercedes G. Merayo;
More informationCollision Avoidance on Shared Slots in a Wireless Slotted Network: Models and Simulations
Collision Avoidance on Shared Slots in a Wireless Slotted Network: Models and Simulations Pascale Minet, Paul Muhlethaler, Ines Khoufi To cite this version: Pascale Minet, Paul Muhlethaler, Ines Khoufi.
More informationHySCaS: Hybrid Stereoscopic Calibration Software
HySCaS: Hybrid Stereoscopic Calibration Software Guillaume Caron, Damien Eynard To cite this version: Guillaume Caron, Damien Eynard. HySCaS: Hybrid Stereoscopic Calibration Software. SPIE newsroom in
More informationThe optimal routing of augmented cubes.
The optimal routing of augmented cubes. Meirun Chen, Reza Naserasr To cite this version: Meirun Chen, Reza Naserasr. The optimal routing of augmented cubes.. Information Processing Letters, Elsevier, 28.
More informationThroughput prediction in wireless networks using statistical learning
Throughput prediction in wireless networks using statistical learning Claudina Rattaro, Pablo Belzarena To cite this version: Claudina Rattaro, Pablo Belzarena. Throughput prediction in wireless networks
More informationCatalogue of architectural patterns characterized by constraint components, Version 1.0
Catalogue of architectural patterns characterized by constraint components, Version 1.0 Tu Minh Ton That, Chouki Tibermacine, Salah Sadou To cite this version: Tu Minh Ton That, Chouki Tibermacine, Salah
More informationX-Kaapi C programming interface
X-Kaapi C programming interface Fabien Le Mentec, Vincent Danjean, Thierry Gautier To cite this version: Fabien Le Mentec, Vincent Danjean, Thierry Gautier. X-Kaapi C programming interface. [Technical
More informationTeaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs
Teaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs Gilles Ardourel, Marianne Huchard To cite this version: Gilles Ardourel, Marianne Huchard. Teaching Encapsulation and
More informationEfficient Gradient Method for Locally Optimizing the Periodic/Aperiodic Ambiguity Function
Efficient Gradient Method for Locally Optimizing the Periodic/Aperiodic Ambiguity Function F Arlery, R assab, U Tan, F Lehmann To cite this version: F Arlery, R assab, U Tan, F Lehmann. Efficient Gradient
More informationMultimedia CTI Services for Telecommunication Systems
Multimedia CTI Services for Telecommunication Systems Xavier Scharff, Pascal Lorenz, Zoubir Mammeri To cite this version: Xavier Scharff, Pascal Lorenz, Zoubir Mammeri. Multimedia CTI Services for Telecommunication
More informationStudy on Feebly Open Set with Respect to an Ideal Topological Spaces
Study on Feebly Open Set with Respect to an Ideal Topological Spaces Yiezi K. Al Talkany, Suadud H. Al Ismael To cite this version: Yiezi K. Al Talkany, Suadud H. Al Ismael. Study on Feebly Open Set with
More informationBlind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better
Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better Waseem Safi Fabrice Maurel Jean-Marc Routoure Pierre Beust Gaël Dias To cite this version: Waseem Safi Fabrice Maurel Jean-Marc
More informationLinux: Understanding Process-Level Power Consumption
Linux: Understanding Process-Level Power Consumption Aurélien Bourdon, Adel Noureddine, Romain Rouvoy, Lionel Seinturier To cite this version: Aurélien Bourdon, Adel Noureddine, Romain Rouvoy, Lionel Seinturier.
More informationTraffic Grooming in Bidirectional WDM Ring Networks
Traffic Grooming in Bidirectional WDM Ring Networks Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau To cite this version: Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau. Traffic
More informationMoveability and Collision Analysis for Fully-Parallel Manipulators
Moveability and Collision Analysis for Fully-Parallel Manipulators Damien Chablat, Philippe Wenger To cite this version: Damien Chablat, Philippe Wenger. Moveability and Collision Analysis for Fully-Parallel
More informationMUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor
MUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor Matthieu Nicolas, Victorien Elvinger, Gérald Oster, Claudia-Lavinia Ignat, François Charoy To cite this version: Matthieu Nicolas, Victorien
More informationTechnical Overview of F-Interop
Technical Overview of F-Interop Rémy Leone, Federico Sismondi, Thomas Watteyne, César Viho To cite this version: Rémy Leone, Federico Sismondi, Thomas Watteyne, César Viho. Technical Overview of F-Interop.
More informationFault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid
Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid Minhwan Ok To cite this version: Minhwan Ok. Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid.
More informationLaHC at CLEF 2015 SBS Lab
LaHC at CLEF 2015 SBS Lab Nawal Ould-Amer, Mathias Géry To cite this version: Nawal Ould-Amer, Mathias Géry. LaHC at CLEF 2015 SBS Lab. Conference and Labs of the Evaluation Forum, Sep 2015, Toulouse,
More informationEfficient implementation of interval matrix multiplication
Efficient implementation of interval matrix multiplication Hong Diep Nguyen To cite this version: Hong Diep Nguyen. Efficient implementation of interval matrix multiplication. Para 2010: State of the Art
More informationHow to simulate a volume-controlled flooding with mathematical morphology operators?
How to simulate a volume-controlled flooding with mathematical morphology operators? Serge Beucher To cite this version: Serge Beucher. How to simulate a volume-controlled flooding with mathematical morphology
More informationMokka, main guidelines and future
Mokka, main guidelines and future P. Mora De Freitas To cite this version: P. Mora De Freitas. Mokka, main guidelines and future. H. Videau; J-C. Brient. International Conference on Linear Collider, Apr
More informationFrom medical imaging to numerical simulations
From medical imaging to numerical simulations Christophe Prud Homme, Vincent Chabannes, Marcela Szopos, Alexandre Ancel, Julien Jomier To cite this version: Christophe Prud Homme, Vincent Chabannes, Marcela
More informationAn Experimental Assessment of the 2D Visibility Complex
An Experimental Assessment of the D Visibility Complex Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang To cite this version: Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang.
More informationRegularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material
Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material Yingying Song, David Brie, El-Hadi Djermoune, Simon Henrot To cite this version: Yingying Song,
More informationCloud My Task - A Peer-to-Peer Distributed Python Script Execution Service
Cloud My Task - A Peer-to-Peer Distributed Python Script Execution Service Daniel Rizea, Daniela Ene, Rafaela Voiculescu, Mugurel Ionut Andreica To cite this version: Daniel Rizea, Daniela Ene, Rafaela
More informationOA-DVFA: A Distributed Virtual Forces-based Algorithm to Monitor an Area with Unknown Obstacles
OA-DVFA: A Distributed Virtual Forces-based Algorithm to Monitor an Area with Unknown Obstacles Ines Khoufi, Pascale Minet, Anis Laouiti To cite this version: Ines Khoufi, Pascale Minet, Anis Laouiti.
More informationThe New Territory of Lightweight Security in a Cloud Computing Environment
The New Territory of Lightweight Security in a Cloud Computing Environment Shu-Ching Wang, Shih-Chi Tseng, Hsin-Met Chuan, Kuo-Qin Yan, Szu-Hao Tsai To cite this version: Shu-Ching Wang, Shih-Chi Tseng,
More informationNP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal https://hal.archives-ouvertes.fr/hal
NP versus PSPACE Frank Vega To cite this version: Frank Vega. NP versus PSPACE. Preprint submitted to Theoretical Computer Science 2015. 2015. HAL Id: hal-01196489 https://hal.archives-ouvertes.fr/hal-01196489
More informationExtended interface ID for virtual link selection in GeoNetworking to IPv6 Adaptation Sub-layer (GN6ASL)
Extended interface ID for virtual link selection in GeoNetworking to IPv6 Adaptation Sub-layer (GN6ASL) Manabu Tsukada, Masatoshi Kakiuchi, Thierry Ernst To cite this version: Manabu Tsukada, Masatoshi
More informationRelabeling nodes according to the structure of the graph
Relabeling nodes according to the structure of the graph Ronan Hamon, Céline Robardet, Pierre Borgnat, Patrick Flandrin To cite this version: Ronan Hamon, Céline Robardet, Pierre Borgnat, Patrick Flandrin.
More informationYAM++ : A multi-strategy based approach for Ontology matching task
YAM++ : A multi-strategy based approach for Ontology matching task Duy Hoa Ngo, Zohra Bellahsene To cite this version: Duy Hoa Ngo, Zohra Bellahsene. YAM++ : A multi-strategy based approach for Ontology
More informationFueling Time Machine: Information Extraction from Retro-Digitised Address Directories
Fueling Time Machine: Information Extraction from Retro-Digitised Address Directories Mohamed Khemakhem, Carmen Brando, Laurent Romary, Frédérique Mélanie-Becquet, Jean-Luc Pinol To cite this version:
More informationQAKiS: an Open Domain QA System based on Relational Patterns
QAKiS: an Open Domain QA System based on Relational Patterns Elena Cabrio, Julien Cojan, Alessio Palmero Aprosio, Bernardo Magnini, Alberto Lavelli, Fabien Gandon To cite this version: Elena Cabrio, Julien
More informationLossless and Lossy Minimal Redundancy Pyramidal Decomposition for Scalable Image Compression Technique
Lossless and Lossy Minimal Redundancy Pyramidal Decomposition for Scalable Image Compression Technique Marie Babel, Olivier Déforges To cite this version: Marie Babel, Olivier Déforges. Lossless and Lossy
More informationFuzzy sensor for the perception of colour
Fuzzy sensor for the perception of colour Eric Benoit, Laurent Foulloy, Sylvie Galichet, Gilles Mauris To cite this version: Eric Benoit, Laurent Foulloy, Sylvie Galichet, Gilles Mauris. Fuzzy sensor for
More informationIntegration of Legacy Non-SDN Optical ROADMs in a Software Defined Network
Integration of Legacy Non-SDN Optical ROADMs in a Software Defined Network Imad Alawe, Bernard Cousin, Olivier Thorey, Rodolphe Legouable To cite this version: Imad Alawe, Bernard Cousin, Olivier Thorey,
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu To cite this version: Hong-Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu. Every 3-connected,
More informationA Voronoi-Based Hybrid Meshing Method
A Voronoi-Based Hybrid Meshing Method Jeanne Pellerin, Lévy Bruno, Guillaume Caumon To cite this version: Jeanne Pellerin, Lévy Bruno, Guillaume Caumon. A Voronoi-Based Hybrid Meshing Method. 2012. hal-00770939
More informationComparator: A Tool for Quantifying Behavioural Compatibility
Comparator: A Tool for Quantifying Behavioural Compatibility Meriem Ouederni, Gwen Salaün, Javier Cámara, Ernesto Pimentel To cite this version: Meriem Ouederni, Gwen Salaün, Javier Cámara, Ernesto Pimentel.
More informationAn Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions
An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions Huaibin Tang, Qinghua Zhang To cite this version: Huaibin Tang, Qinghua Zhang.
More informationUsing a Medical Thesaurus to Predict Query Difficulty
Using a Medical Thesaurus to Predict Query Difficulty Florian Boudin, Jian-Yun Nie, Martin Dawes To cite this version: Florian Boudin, Jian-Yun Nie, Martin Dawes. Using a Medical Thesaurus to Predict Query
More informationSliding HyperLogLog: Estimating cardinality in a data stream
Sliding HyperLogLog: Estimating cardinality in a data stream Yousra Chabchoub, Georges Hébrail To cite this version: Yousra Chabchoub, Georges Hébrail. Sliding HyperLogLog: Estimating cardinality in a
More informationMulti-atlas labeling with population-specific template and non-local patch-based label fusion
Multi-atlas labeling with population-specific template and non-local patch-based label fusion Vladimir Fonov, Pierrick Coupé, Simon Eskildsen, Jose Manjon, Louis Collins To cite this version: Vladimir
More informationTHE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS
THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS Antoine Mhanna To cite this version: Antoine Mhanna. THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS. 016. HAL Id: hal-0158188
More informationPrivacy-preserving carpooling
Ulrich Matchi Aïvodji, Sébastien Gambs, Marie-José Huguet, Marc-Olivier Killijian To cite this version: Ulrich Matchi Aïvodji, Sébastien Gambs, Marie-José Huguet, Marc-Olivier Killijian. Privacypreserving
More informationRepresentation of Finite Games as Network Congestion Games
Representation of Finite Games as Network Congestion Games Igal Milchtaich To cite this version: Igal Milchtaich. Representation of Finite Games as Network Congestion Games. Roberto Cominetti and Sylvain
More informationQuality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment
Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment Kuo-Qin Yan, Yung-Hsiang Su, Hsin-Met Chuan, Shu-Ching Wang, Bo-Wei Chen
More informationDANCer: Dynamic Attributed Network with Community Structure Generator
DANCer: Dynamic Attributed Network with Community Structure Generator Oualid Benyahia, Christine Largeron, Baptiste Jeudy, Osmar Zaïane To cite this version: Oualid Benyahia, Christine Largeron, Baptiste
More informationQuickRanking: Fast Algorithm For Sorting And Ranking Data
QuickRanking: Fast Algorithm For Sorting And Ranking Data Laurent Ott To cite this version: Laurent Ott. QuickRanking: Fast Algorithm For Sorting And Ranking Data. Fichiers produits par l auteur. 2015.
More informationSynthesis of fixed-point programs: the case of matrix multiplication
Synthesis of fixed-point programs: the case of matrix multiplication Mohamed Amine Najahi To cite this version: Mohamed Amine Najahi. Synthesis of fixed-point programs: the case of matrix multiplication.
More informationDSM GENERATION FROM STEREOSCOPIC IMAGERY FOR DAMAGE MAPPING, APPLICATION ON THE TOHOKU TSUNAMI
DSM GENERATION FROM STEREOSCOPIC IMAGERY FOR DAMAGE MAPPING, APPLICATION ON THE TOHOKU TSUNAMI Cyrielle Guérin, Renaud Binet, Marc Pierrot-Deseilligny To cite this version: Cyrielle Guérin, Renaud Binet,
More informationLinked data from your pocket: The Android RDFContentProvider
Linked data from your pocket: The Android RDFContentProvider Jérôme David, Jérôme Euzenat To cite this version: Jérôme David, Jérôme Euzenat. Linked data from your pocket: The Android RDFContentProvider.
More informationImplementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context
Implementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context Bertrand Gilles, Laurent Tchamnda Nana, Valérie-Anne Nicolas To cite this version: Bertrand
More informationEnd-to-end Energy Models for Edge Cloud-based IoT Platforms: Application to Data Stream Analysis in IoT
End-to-end Energy Models for Edge Cloud-based IoT Platforms: Application to Data Stream Analysis in IoT Yunbo Li, Anne-Cécile Orgerie, Ivan Rodero, Betsegaw Lemma Amersho, Manish Parashar, Jean-Marc Menaud
More informationIMPLEMENTATION OF MOTION ESTIMATION BASED ON HETEROGENEOUS PARALLEL COMPUTING SYSTEM WITH OPENC
IMPLEMENTATION OF MOTION ESTIMATION BASED ON HETEROGENEOUS PARALLEL COMPUTING SYSTEM WITH OPENC Jinglin Zhang, Jean François Nezan, Jean-Gabriel Cousin To cite this version: Jinglin Zhang, Jean François
More informationThe Connectivity Order of Links
The Connectivity Order of Links Stéphane Dugowson To cite this version: Stéphane Dugowson. The Connectivity Order of Links. 4 pages, 2 figures. 2008. HAL Id: hal-00275717 https://hal.archives-ouvertes.fr/hal-00275717
More informationStructuring the First Steps of Requirements Elicitation
Structuring the First Steps of Requirements Elicitation Jeanine Souquières, Maritta Heisel To cite this version: Jeanine Souquières, Maritta Heisel. Structuring the First Steps of Requirements Elicitation.
More informationApplication-Aware Protection in DWDM Optical Networks
Application-Aware Protection in DWDM Optical Networks Hamza Drid, Nasir Ghani, Bernard Cousin To cite this version: Hamza Drid, Nasir Ghani, Bernard Cousin. Application-Aware Protection in DWDM Optical
More informationScalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints
Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints Joris Guyonvarc H, Sébastien Ferré To cite this version: Joris Guyonvarc H, Sébastien Ferré. Scalewelis: a Scalable Query-based
More informationOpen Digital Forms. Hiep Le, Thomas Rebele, Fabian Suchanek. HAL Id: hal
Open Digital Forms Hiep Le, Thomas Rebele, Fabian Suchanek To cite this version: Hiep Le, Thomas Rebele, Fabian Suchanek. Open Digital Forms. Research and Advanced Technology for Digital Libraries - 20th
More informationDetecting Anomalies in Netflow Record Time Series by Using a Kernel Function
Detecting Anomalies in Netflow Record Time Series by Using a Kernel Function Cynthia Wagner, Thomas Engel To cite this version: Cynthia Wagner, Thomas Engel. Detecting Anomalies in Netflow Record Time
More informationApplication of Artificial Neural Network to Predict Static Loads on an Aircraft Rib
Application of Artificial Neural Network to Predict Static Loads on an Aircraft Rib Ramin Amali, Samson Cooper, Siamak Noroozi To cite this version: Ramin Amali, Samson Cooper, Siamak Noroozi. Application
More informationBugMaps-Granger: A Tool for Causality Analysis between Source Code Metrics and Bugs
BugMaps-Granger: A Tool for Causality Analysis between Source Code Metrics and Bugs Cesar Couto, Pedro Pires, Marco Tulio Valente, Roberto Bigonha, Andre Hora, Nicolas Anquetil To cite this version: Cesar
More informationFormal modelling of ontologies within Event-B
Formal modelling of ontologies within Event-B Yamine Ait Ameur, Idir Ait-Sadoune, Kahina Hacid, Linda Mohand Oussaid To cite this version: Yamine Ait Ameur, Idir Ait-Sadoune, Kahina Hacid, Linda Mohand
More informationImproving Collaborations in Neuroscientist Community
Improving Collaborations in Neuroscientist Community Isabelle Mirbel, Pierre Crescenzo To cite this version: Isabelle Mirbel, Pierre Crescenzo. Improving Collaborations in Neuroscientist Community. Web2Touch,
More informationFStream: a decentralized and social music streamer
FStream: a decentralized and social music streamer Antoine Boutet, Konstantinos Kloudas, Anne-Marie Kermarrec To cite this version: Antoine Boutet, Konstantinos Kloudas, Anne-Marie Kermarrec. FStream:
More informationBranch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows
Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu To cite this version: Estèle Glize, Nicolas Jozefowiez,
More informationA Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications
A Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications Fabien Demangel, Nicolas Fau, Nicolas Drabik, François Charot, Christophe Wolinski To cite this version: Fabien
More informationXML Document Classification using SVM
XML Document Classification using SVM Samaneh Chagheri, Catherine Roussey, Sylvie Calabretto, Cyril Dumoulin To cite this version: Samaneh Chagheri, Catherine Roussey, Sylvie Calabretto, Cyril Dumoulin.
More informationThe Origin of BGP Duplicates
David Hauweele, Bruno Quoitin, Cristel Pelsser, Randy Bush To cite this version: David Hauweele, Bruno Quoitin, Cristel Pelsser, Randy Bush. The Origin of BGP Duplicates. CoRes 2016, May 2016, Bayonne,
More informationGeneric Design Space Exploration for Reconfigurable Architectures
Generic Design Space Exploration for Reconfigurable Architectures Lilian Bossuet, Guy Gogniat, Jean Luc Philippe To cite this version: Lilian Bossuet, Guy Gogniat, Jean Luc Philippe. Generic Design Space
More informationRemoving the MAC Retransmission Times from the RTT in TCP
Removing the MAC Retransmission Times from the RTT in TCP Eugen Dedu, Sébastien Linck, François Spies To cite this version: Eugen Dedu, Sébastien Linck, François Spies. Removing the MAC Retransmission
More information