Actes du 11ème Atelier en Évaluation de Performances

International audienceLe présent document contient les actes du 11ème Atelier en Évaluation des Performances qui s'est tenu les 15-17 Mars 2016 au LAAS-CNRS, Toulouse. L’Atelier en Évaluation de Performances est une réunion destinée à faire s’exprimer et se rencontrer les jeunes chercheurs (doctorants et postdoctorants) dans le domaine de la Modélisation et de l’Évaluation de Performances, une discipline consacrée à l’étude et l’optimisation de systèmes dynamiques stochastiques et/ou temporisés apparaissant en Informatique, Télécommunications, Productique et Robotique entre autres. La présentation informelle de travaux, même en cours, y est encouragée afin de renforcer les interactions entre jeunes chercheurs et préparer des soumissions de nouveaux projets scientifiques. Des exposés de synthèse sur des domaines de recherche d’actualité, donnés par des chercheurs confirmés du domaine renforcent la partie formation de l’atelier

Interim research assessment 2003-2005 - Computer Science

This report primarily serves as a source of information for the 2007 Interim Research Assessment Committee for Computer Science at the three technical universities in the Netherlands. The report also provides information for others interested in our research activities

A Survey of Green Networking Research

Reduction of unnecessary energy consumption is becoming a major concern in wired networking, because of the potential economical benefits and of its expected environmental impact. These issues, usually referred to as "green networking", relate to embedding energy-awareness in the design, in the devices and in the protocols of networks. In this work, we first formulate a more precise definition of the "green" attribute. We furthermore identify a few paradigms that are the key enablers of energy-aware networking research. We then overview the current state of the art and provide a taxonomy of the relevant work, with a special focus on wired networking. At a high level, we identify four branches of green networking research that stem from different observations on the root causes of energy waste, namely (i) Adaptive Link Rate, (ii) Interface proxying, (iii) Energy-aware infrastructures and (iv) Energy-aware applications. In this work, we do not only explore specific proposals pertaining to each of the above branches, but also offer a perspective for research.Comment: Index Terms: Green Networking; Wired Networks; Adaptive Link Rate; Interface Proxying; Energy-aware Infrastructures; Energy-aware Applications. 18 pages, 6 figures, 2 table

Energy-Aware Base Stations: The Effect of Planning, Management, and Femto Layers

We compare the performance of three base station management schemes on three different network topologies. In addition, we explore the effect of offloading traffic to heterogeneous femtocell layer upon energy savings taking into account the increase of base station switch-off time intervals. Fairness between mobile operator and femtocell owners is maintained since current femtocell technologies present flat power consumption curves with respect to served traffic. We model two different user-to-femtocell association rules in order to capture realistic and maximum gains from the heterogeneous network. To provide accurate findings and a holistic overview of the techniques, we explore a real urban district where channel estimations and power control are modeled using deterministic algorithms. Finally, we explore energy efficiency metrics that capture savings in the mobile network operator, the required watts per user and watts per bitrate. It is found that the newly established pseudo distributed management scheme is the most preferable solution for practical implementations and together with the femotcell layer the network can handle dynamic load control that is regarded as the basic element of future demand response programs

Lifetime and availability of data stored on a P2P system: Evaluation of redundancy and recovery schemes

International audienceThis paper studies the performance of Peer-to-Peer storage and backup systems (P2PSS). These systems are based on three pillars: data fragmentation and dissemination among the peers, redundancy mechanisms to cope with peers churn and repair mechanisms to recover lost or temporarily unavailable data. Usually, redundancy is achieved either by using replication or by using erasure codes. A new class of network coding (regenerating codes) has been proposed recently. Therefore, we will adapt our work to these three redundancy schemes. We introduce two mechanisms for recovering lost data and evaluate their performance by modeling them through absorbing Markov chains. Specifically, we evaluate the quality of service provided to users in terms of durability and availability of stored data for each recovery mechanism and deduce the impact of its parameters on the system performance. The first mechanism is centralized and based on the use of a single server that can recover multiple losses at once. The second mechanism is distributed: reconstruction of lost fragments is iterated sequentially on many peers until that the required level of redundancy is attained. The key assumptions made in this work, in particular, the assumptions made on the recovery process and peer on-times distribution, are in agreement with the analysis in [1] and in [2] respectively. The models are thereby general enough to be applicable to many distributed environments as shown through numerical computations. We find that, in stable environments such as local area or research institute networks where machines are usually highly available, the distributed-repair scheme in erasure-coded systems offers a reliable, scalable and cheap storage/backup solution. For the case of highly dynamic environments, in general, the distributed-repair scheme is inefficient, in particular to maintain high data availability, unless the data redundancy is high. Using regenerating codes overcomes this limitation of the distributed-repair scheme. P2PSS with centralized-repair scheme are efficient in any environment but have the disadvantage of relying on a centralized authority. However, the analysis of the overhead cost (e.g. computation, bandwidth and complexity cost) resulting from the different redundancy schemes with respect to their advantages (e.g. simplicity), is left for future work

Energy Efficiency and Coverage Trade-Off in 5G for Eco-Friendly and Sustainable Cellular Networks

Recently, cellular networks’ energy efficiency has garnered research interest from academia and industry because of its considerable economic and ecological effects in the near future. This study proposes an approach to cooperation between the Long-Term Evolution (LTE) and next-generation wireless networks. The fifth-generation (5G) wireless network aims to negotiate a trade-off between wireless network performance (sustaining the demand for high speed packet rates during busy traffic periods) and energy efficiency (EE) by alternating 5G base stations’ (BSs) switching off/on based on the traffic instantaneous load condition and, at the same time, guaranteeing network coverage for mobile subscribers by the remaining active LTE BSs. The particle swarm optimization (PSO) algorithm was used to determine the optimum criteria of the active LTE BSs (transmission power, total antenna gain, spectrum/channel bandwidth, and signal-to-interference-noise ratio) that achieves maximum coverage for the entire area during the switch-off session of 5G BSs. Simulation results indicate that the energy savings can reach 3.52 kW per day, with a maximum data rate of up to 22.4 Gbps at peak traffic hours and 80.64 Mbps during a 5G BS switched-off session along with guaranteed full coverage over the entire region by the remaining active LTE BSs