On the energy cost of robustness and resiliency in IP networks
Identifieur interne : 000010 ( PascalFrancis/Checkpoint ); précédent : 000009; suivant : 000011On the energy cost of robustness and resiliency in IP networks
Auteurs : B. Addis [France] ; A. Capone [Italie] ; G. Carello [Italie] ; L. G. Gianoli [Italie, Canada] ; B. Sanso [Canada]Source :
- Computer networks : (1999) [ 1389-1286 ] ; 2014.
Descripteurs français
- Pascal (Inist)
- Protocole internet, Internet, Développement durable, Qualité service, Tolérance faute, Disponibilité, Sensibilité contexte, Système tolérant les pannes, Multiprotocole, Protocole transmission, Consommation énergie, Gestion réseau, Télétrafic, Gestion trafic, Gestion de la qualité, Coût énergie, Robustesse, Service réseau, Résilience, Panne, Optimisation, Modélisation, Stabilité, Méthode heuristique, Economies d'énergie, ., Protocole routage.
- Wicri :
- topic : Développement durable.
English descriptors
- KwdEn :
- Availability, Breakdown, Context aware, Energy consumption, Energy cost, Energy savings, Fault tolerance, Fault tolerant system, Heuristic method, Internet, Internet protocol, Modeling, Multiprotocol, Network management, Network service, Optimization, Quality management, Resilience, Robustness, Routing protocols, Service quality, Stability, Sustainable development, Teletraffic, Traffic management, Transmission protocol.
Abstract
Despite the growing concern for the energy consumption of the Internet, green strategies for network and traffic management cannot undermine Quality of Service (QoS) and network survivability. In particular, two very important issues that may be affected by green networking techniques are resilience to node and link failures, and robustness to traffic variations. In this paper, we study how achieving different levels of resiliency and robustness impacts the network energy-aware efficiency. We propose novel optimization models to minimize the energy consumption of IP networks that explicitly guarantee network survivability to failures and robustness to traffic variations. Energy consumption is reduced by putting in sleep mode idle line cards and nodes according to traffic variations in different periods of the day. To guarantee network survivability we consider two different schemes, dedicated and shared protection, which assign a backup path to each traffic demand and some spare capacity on the links along the path. Robustness to traffic variations is provided by tuning the capacity margin on active links in order to accommodate load variations of different magnitude. Furthermore, we impose some inter-period constraints to guarantee network stability and preserve device lifetime. Both exact and heuristic methods are proposed. Experimentations carried out on realistic networks operated with flow-based routing protocols (like MPLS) allow us to quantitatively analyze the trade-off between energy cost and level of protection and robustness. Results show that significant savings, up to 30%, may be achieved even when both survivability and robustness are fully guaranteed, both with exact and heuristic approaches.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:15-0025640Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On the energy cost of robustness and resiliency in IP networks</title><author><name sortKey="Addis, B" sort="Addis, B" uniqKey="Addis B" first="B." last="Addis">B. Addis</name><affiliation wicri:level="4"><inist:fA14 i1="02"><s1>LORIA (UMR 7503 CNRS), Université de Lorraine, INRIA Nancy-Grand Est</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>INRIA Nancy-Grand Est</wicri:noRegion><wicri:noRegion>LORIA (UMR 7503 CNRS), Université de Lorraine, INRIA Nancy-Grand Est</wicri:noRegion><orgName type="university">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName></affiliation></author><author><name sortKey="Capone, A" sort="Capone, A" uniqKey="Capone A" first="A." last="Capone">A. Capone</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></inist:fA14><country>Italie</country><wicri:noRegion>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</wicri:noRegion></affiliation></author><author><name sortKey="Carello, G" sort="Carello, G" uniqKey="Carello G" first="G." last="Carello">G. Carello</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></inist:fA14><country>Italie</country><wicri:noRegion>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</wicri:noRegion></affiliation></author><author><name sortKey="Gianoli, L G" sort="Gianoli, L G" uniqKey="Gianoli L" first="L. G." last="Gianoli">L. G. Gianoli</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></inist:fA14><country>Italie</country><wicri:noRegion>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</wicri:noRegion></affiliation><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>École Polytechnique de Montréal, Département de Génie Électrique</s1><s3>CAN</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>Canada</country><wicri:noRegion>École Polytechnique de Montréal, Département de Génie Électrique</wicri:noRegion></affiliation></author><author><name sortKey="Sanso, B" sort="Sanso, B" uniqKey="Sanso B" first="B." last="Sanso">B. Sanso</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>École Polytechnique de Montréal, Département de Génie Électrique</s1><s3>CAN</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>Canada</country><wicri:noRegion>École Polytechnique de Montréal, Département de Génie Électrique</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">15-0025640</idno><date when="2014">2014</date><idno type="stanalyst">PASCAL 15-0025640 INIST</idno><idno type="RBID">Pascal:15-0025640</idno><idno type="wicri:Area/PascalFrancis/Corpus">000004</idno><idno type="wicri:Area/PascalFrancis/Curation">000999</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000010</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000010</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On the energy cost of robustness and resiliency in IP networks</title><author><name sortKey="Addis, B" sort="Addis, B" uniqKey="Addis B" first="B." last="Addis">B. Addis</name><affiliation wicri:level="4"><inist:fA14 i1="02"><s1>LORIA (UMR 7503 CNRS), Université de Lorraine, INRIA Nancy-Grand Est</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>INRIA Nancy-Grand Est</wicri:noRegion><wicri:noRegion>LORIA (UMR 7503 CNRS), Université de Lorraine, INRIA Nancy-Grand Est</wicri:noRegion><orgName type="university">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName></affiliation></author><author><name sortKey="Capone, A" sort="Capone, A" uniqKey="Capone A" first="A." last="Capone">A. Capone</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></inist:fA14><country>Italie</country><wicri:noRegion>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</wicri:noRegion></affiliation></author><author><name sortKey="Carello, G" sort="Carello, G" uniqKey="Carello G" first="G." last="Carello">G. Carello</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></inist:fA14><country>Italie</country><wicri:noRegion>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</wicri:noRegion></affiliation></author><author><name sortKey="Gianoli, L G" sort="Gianoli, L G" uniqKey="Gianoli L" first="L. G." last="Gianoli">L. G. Gianoli</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></inist:fA14><country>Italie</country><wicri:noRegion>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</wicri:noRegion></affiliation><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>École Polytechnique de Montréal, Département de Génie Électrique</s1><s3>CAN</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>Canada</country><wicri:noRegion>École Polytechnique de Montréal, Département de Génie Électrique</wicri:noRegion></affiliation></author><author><name sortKey="Sanso, B" sort="Sanso, B" uniqKey="Sanso B" first="B." last="Sanso">B. Sanso</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>École Polytechnique de Montréal, Département de Génie Électrique</s1><s3>CAN</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>Canada</country><wicri:noRegion>École Polytechnique de Montréal, Département de Génie Électrique</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Computer networks : (1999)</title><title level="j" type="abbreviated">Comput. netw. : (1999)</title><idno type="ISSN">1389-1286</idno><imprint><date when="2014">2014</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computer networks : (1999)</title><title level="j" type="abbreviated">Comput. netw. : (1999)</title><idno type="ISSN">1389-1286</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Availability</term><term>Breakdown</term><term>Context aware</term><term>Energy consumption</term><term>Energy cost</term><term>Energy savings</term><term>Fault tolerance</term><term>Fault tolerant system</term><term>Heuristic method</term><term>Internet</term><term>Internet protocol</term><term>Modeling</term><term>Multiprotocol</term><term>Network management</term><term>Network service</term><term>Optimization</term><term>Quality management</term><term>Resilience</term><term>Robustness</term><term>Routing protocols</term><term>Service quality</term><term>Stability</term><term>Sustainable development</term><term>Teletraffic</term><term>Traffic management</term><term>Transmission protocol</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Protocole internet</term><term>Internet</term><term>Développement durable</term><term>Qualité service</term><term>Tolérance faute</term><term>Disponibilité</term><term>Sensibilité contexte</term><term>Système tolérant les pannes</term><term>Multiprotocole</term><term>Protocole transmission</term><term>Consommation énergie</term><term>Gestion réseau</term><term>Télétrafic</term><term>Gestion trafic</term><term>Gestion de la qualité</term><term>Coût énergie</term><term>Robustesse</term><term>Service réseau</term><term>Résilience</term><term>Panne</term><term>Optimisation</term><term>Modélisation</term><term>Stabilité</term><term>Méthode heuristique</term><term>Economies d'énergie</term><term>.</term><term>Protocole routage</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Développement durable</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Despite the growing concern for the energy consumption of the Internet, green strategies for network and traffic management cannot undermine Quality of Service (QoS) and network survivability. In particular, two very important issues that may be affected by green networking techniques are resilience to node and link failures, and robustness to traffic variations. In this paper, we study how achieving different levels of resiliency and robustness impacts the network energy-aware efficiency. We propose novel optimization models to minimize the energy consumption of IP networks that explicitly guarantee network survivability to failures and robustness to traffic variations. Energy consumption is reduced by putting in sleep mode idle line cards and nodes according to traffic variations in different periods of the day. To guarantee network survivability we consider two different schemes, dedicated and shared protection, which assign a backup path to each traffic demand and some spare capacity on the links along the path. Robustness to traffic variations is provided by tuning the capacity margin on active links in order to accommodate load variations of different magnitude. Furthermore, we impose some inter-period constraints to guarantee network stability and preserve device lifetime. Both exact and heuristic methods are proposed. Experimentations carried out on realistic networks operated with flow-based routing protocols (like MPLS) allow us to quantitatively analyze the trade-off between energy cost and level of protection and robustness. Results show that significant savings, up to 30%, may be achieved even when both survivability and robustness are fully guaranteed, both with exact and heuristic approaches.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1389-1286</s0></fA01><fA03 i2="1"><s0>Comput. netw. : (1999)</s0></fA03><fA05><s2>75</s2></fA05><fA06><s3>p. a</s3></fA06><fA08 i1="01" i2="1" l="ENG"><s1>On the energy cost of robustness and resiliency in IP networks</s1></fA08><fA11 i1="01" i2="1"><s1>ADDIS (B.)</s1></fA11><fA11 i1="02" i2="1"><s1>CAPONE (A.)</s1></fA11><fA11 i1="03" i2="1"><s1>CARELLO (G.)</s1></fA11><fA11 i1="04" i2="1"><s1>GIANOLI (L. G.)</s1></fA11><fA11 i1="05" i2="1"><s1>SANSO (B.)</s1></fA11><fA14 i1="01"><s1>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</s1><s3>ITA</s3><sZ>2 aut.</sZ><sZ>3 aut.</sZ><sZ>4 aut.</sZ></fA14><fA14 i1="02"><s1>LORIA (UMR 7503 CNRS), Université de Lorraine, INRIA Nancy-Grand Est</s1><s3>FRA</s3><sZ>1 aut.</sZ></fA14><fA14 i1="03"><s1>École Polytechnique de Montréal, Département de Génie Électrique</s1><s3>CAN</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></fA14><fA20><s1>239-259</s1></fA20><fA21><s1>2014</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA43 i1="01"><s1>INIST</s1><s2>17220</s2><s5>354000503580850160</s5></fA43><fA44><s0>0000</s0><s1>© 2015 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>52 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>15-0025640</s0></fA47><fA60><s1>P</s1></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Computer networks : (1999)</s0></fA64><fA66 i1="01"><s0>GBR</s0></fA66><fC01 i1="01" l="ENG"><s0>Despite the growing concern for the energy consumption of the Internet, green strategies for network and traffic management cannot undermine Quality of Service (QoS) and network survivability. In particular, two very important issues that may be affected by green networking techniques are resilience to node and link failures, and robustness to traffic variations. In this paper, we study how achieving different levels of resiliency and robustness impacts the network energy-aware efficiency. We propose novel optimization models to minimize the energy consumption of IP networks that explicitly guarantee network survivability to failures and robustness to traffic variations. Energy consumption is reduced by putting in sleep mode idle line cards and nodes according to traffic variations in different periods of the day. To guarantee network survivability we consider two different schemes, dedicated and shared protection, which assign a backup path to each traffic demand and some spare capacity on the links along the path. Robustness to traffic variations is provided by tuning the capacity margin on active links in order to accommodate load variations of different magnitude. Furthermore, we impose some inter-period constraints to guarantee network stability and preserve device lifetime. Both exact and heuristic methods are proposed. Experimentations carried out on realistic networks operated with flow-based routing protocols (like MPLS) allow us to quantitatively analyze the trade-off between energy cost and level of protection and robustness. Results show that significant savings, up to 30%, may be achieved even when both survivability and robustness are fully guaranteed, both with exact and heuristic approaches.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0></fC02><fC02 i1="02" i2="X"><s0>001D04B02B</s0></fC02><fC02 i1="03" i2="X"><s0>001D04B03A</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Protocole internet</s0><s5>06</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Internet protocol</s0><s5>06</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Protocolo internet</s0><s5>06</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Internet</s0><s5>07</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Internet</s0><s5>07</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Internet</s0><s5>07</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Développement durable</s0><s5>08</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Sustainable development</s0><s5>08</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Desarrollo sostenible</s0><s5>08</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Qualité service</s0><s5>09</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Service quality</s0><s5>09</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Calidad servicio</s0><s5>09</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Tolérance faute</s0><s5>10</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Fault tolerance</s0><s5>10</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Tolerancia falta</s0><s5>10</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Disponibilité</s0><s5>11</s5></fC03><fC03 i1="06" i2="X" l="ENG"><s0>Availability</s0><s5>11</s5></fC03><fC03 i1="06" i2="X" l="SPA"><s0>Disponibilidad</s0><s5>11</s5></fC03><fC03 i1="07" i2="X" l="FRE"><s0>Sensibilité contexte</s0><s5>12</s5></fC03><fC03 i1="07" i2="X" l="ENG"><s0>Context aware</s0><s5>12</s5></fC03><fC03 i1="07" i2="X" l="SPA"><s0>Sensibilidad contexto</s0><s5>12</s5></fC03><fC03 i1="08" i2="X" l="FRE"><s0>Système tolérant les pannes</s0><s5>13</s5></fC03><fC03 i1="08" i2="X" l="ENG"><s0>Fault tolerant system</s0><s5>13</s5></fC03><fC03 i1="08" i2="X" l="SPA"><s0>Sistema tolerando faltas</s0><s5>13</s5></fC03><fC03 i1="09" i2="X" l="FRE"><s0>Multiprotocole</s0><s5>14</s5></fC03><fC03 i1="09" i2="X" l="ENG"><s0>Multiprotocol</s0><s5>14</s5></fC03><fC03 i1="09" i2="X" l="SPA"><s0>Multiprotocolo</s0><s5>14</s5></fC03><fC03 i1="10" i2="X" l="FRE"><s0>Protocole transmission</s0><s5>15</s5></fC03><fC03 i1="10" i2="X" l="ENG"><s0>Transmission protocol</s0><s5>15</s5></fC03><fC03 i1="10" i2="X" l="SPA"><s0>Protocolo transmisión</s0><s5>15</s5></fC03><fC03 i1="11" i2="X" l="FRE"><s0>Consommation énergie</s0><s5>18</s5></fC03><fC03 i1="11" i2="X" l="ENG"><s0>Energy consumption</s0><s5>18</s5></fC03><fC03 i1="11" i2="X" l="SPA"><s0>Consumo energía</s0><s5>18</s5></fC03><fC03 i1="12" i2="X" l="FRE"><s0>Gestion réseau</s0><s5>19</s5></fC03><fC03 i1="12" i2="X" l="ENG"><s0>Network management</s0><s5>19</s5></fC03><fC03 i1="12" i2="X" l="SPA"><s0>Gestión red</s0><s5>19</s5></fC03><fC03 i1="13" i2="X" l="FRE"><s0>Télétrafic</s0><s5>20</s5></fC03><fC03 i1="13" i2="X" l="ENG"><s0>Teletraffic</s0><s5>20</s5></fC03><fC03 i1="13" i2="X" l="SPA"><s0>Teletráfico</s0><s5>20</s5></fC03><fC03 i1="14" i2="X" l="FRE"><s0>Gestion trafic</s0><s5>21</s5></fC03><fC03 i1="14" i2="X" l="ENG"><s0>Traffic management</s0><s5>21</s5></fC03><fC03 i1="14" i2="X" l="SPA"><s0>Gestión tráfico</s0><s5>21</s5></fC03><fC03 i1="15" i2="X" l="FRE"><s0>Gestion de la qualité</s0><s5>22</s5></fC03><fC03 i1="15" i2="X" l="ENG"><s0>Quality management</s0><s5>22</s5></fC03><fC03 i1="15" i2="X" l="SPA"><s0>Gestión de calidad</s0><s5>22</s5></fC03><fC03 i1="16" i2="X" l="FRE"><s0>Coût énergie</s0><s5>23</s5></fC03><fC03 i1="16" i2="X" l="ENG"><s0>Energy cost</s0><s5>23</s5></fC03><fC03 i1="16" i2="X" l="SPA"><s0>Coste energía</s0><s5>23</s5></fC03><fC03 i1="17" i2="X" l="FRE"><s0>Robustesse</s0><s5>24</s5></fC03><fC03 i1="17" i2="X" l="ENG"><s0>Robustness</s0><s5>24</s5></fC03><fC03 i1="17" i2="X" l="SPA"><s0>Robustez</s0><s5>24</s5></fC03><fC03 i1="18" i2="X" l="FRE"><s0>Service réseau</s0><s5>25</s5></fC03><fC03 i1="18" i2="X" l="ENG"><s0>Network service</s0><s5>25</s5></fC03><fC03 i1="18" i2="X" l="SPA"><s0>Servicio de red</s0><s5>25</s5></fC03><fC03 i1="19" i2="X" l="FRE"><s0>Résilience</s0><s5>26</s5></fC03><fC03 i1="19" i2="X" l="ENG"><s0>Resilience</s0><s5>26</s5></fC03><fC03 i1="19" i2="X" l="SPA"><s0>Resiliencia</s0><s5>26</s5></fC03><fC03 i1="20" i2="X" l="FRE"><s0>Panne</s0><s5>27</s5></fC03><fC03 i1="20" i2="X" l="ENG"><s0>Breakdown</s0><s5>27</s5></fC03><fC03 i1="20" i2="X" l="SPA"><s0>Pana</s0><s5>27</s5></fC03><fC03 i1="21" i2="X" l="FRE"><s0>Optimisation</s0><s5>28</s5></fC03><fC03 i1="21" i2="X" l="ENG"><s0>Optimization</s0><s5>28</s5></fC03><fC03 i1="21" i2="X" l="SPA"><s0>Optimización</s0><s5>28</s5></fC03><fC03 i1="22" i2="X" l="FRE"><s0>Modélisation</s0><s5>29</s5></fC03><fC03 i1="22" i2="X" l="ENG"><s0>Modeling</s0><s5>29</s5></fC03><fC03 i1="22" i2="X" l="SPA"><s0>Modelización</s0><s5>29</s5></fC03><fC03 i1="23" i2="X" l="FRE"><s0>Stabilité</s0><s5>30</s5></fC03><fC03 i1="23" i2="X" l="ENG"><s0>Stability</s0><s5>30</s5></fC03><fC03 i1="23" i2="X" l="SPA"><s0>Estabilidad</s0><s5>30</s5></fC03><fC03 i1="24" i2="X" l="FRE"><s0>Méthode heuristique</s0><s5>31</s5></fC03><fC03 i1="24" i2="X" l="ENG"><s0>Heuristic method</s0><s5>31</s5></fC03><fC03 i1="24" i2="X" l="SPA"><s0>Método heurístico</s0><s5>31</s5></fC03><fC03 i1="25" i2="X" l="FRE"><s0>Economies d'énergie</s0><s5>41</s5></fC03><fC03 i1="25" i2="X" l="ENG"><s0>Energy savings</s0><s5>41</s5></fC03><fC03 i1="25" i2="X" l="SPA"><s0>Ahorros energía</s0><s5>41</s5></fC03><fC03 i1="26" i2="X" l="FRE"><s0>.</s0><s4>INC</s4><s5>82</s5></fC03><fC03 i1="27" i2="X" l="FRE"><s0>Protocole routage</s0><s4>CD</s4><s5>96</s5></fC03><fC03 i1="27" i2="X" l="ENG"><s0>Routing protocols</s0><s4>CD</s4><s5>96</s5></fC03><fC03 i1="27" i2="X" l="SPA"><s0>Protocolo de enrutamiento</s0><s4>CD</s4><s5>96</s5></fC03><fN21><s1>040</s1></fN21><fN44 i1="01"><s1>OTO</s1></fN44><fN82><s1>OTO</s1></fN82></pA></standard></inist><affiliations><list><country><li>Canada</li><li>France</li><li>Italie</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Metz</li><li>Nancy</li></settlement><orgName><li>Université de Lorraine</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Addis, B" sort="Addis, B" uniqKey="Addis B" first="B." last="Addis">B. Addis</name></region></country><country name="Italie"><noRegion><name sortKey="Capone, A" sort="Capone, A" uniqKey="Capone A" first="A." last="Capone">A. Capone</name></noRegion><name sortKey="Carello, G" sort="Carello, G" uniqKey="Carello G" first="G." last="Carello">G. Carello</name><name sortKey="Gianoli, L G" sort="Gianoli, L G" uniqKey="Gianoli L" first="L. G." last="Gianoli">L. G. Gianoli</name></country><country name="Canada"><noRegion><name sortKey="Gianoli, L G" sort="Gianoli, L G" uniqKey="Gianoli L" first="L. G." last="Gianoli">L. G. Gianoli</name></noRegion><name sortKey="Sanso, B" sort="Sanso, B" uniqKey="Sanso B" first="B." last="Sanso">B. Sanso</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000010 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000010 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:15-0025640
|texte= On the energy cost of robustness and resiliency in IP networks
}}
| This area was generated with Dilib version V0.6.33. |  |