<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445871113</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145511.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11107-010-0294-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11107-010-0294-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Adaptive load-balancing in WDM mesh networks with performance guarantees</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Rui Dai, Lemin Li, Sheng Wang]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In nowadays, wavelength-division multiplexing (WDM) networks, on the one hand, increasingly more users expect the network to provide high-priority QoS services demanding no congestion and low latency. On the other hand, it is significantly more difficult for network operators to forecast future traffic demands, as the packet traffic running over WDM networks fluctuates over time for a variety of reasons. Confronted with a rough understanding of traffic patterns as well as the increasing number of time-sensitive applications, most networks today are grossly over-provisioned. Thus, designing cost-effective WDM networks in an uncertain traffic environment, which includes network planning and robust routing, is both an important and a challenging task. In this paper, we explore adaptive load-balancing to investigate the problems of network planning and robust routing for WDM mesh networks under varying traffic matrices. We first propose an efficient heuristic algorithm called Maximizing Network Capability (MNC) to provision congestion-free and cost-effective WDM networks based on load-balancing to deal with traffic uncertainty. Then, a novel traffic grooming algorithm called Adding Direct Traffic (ADT) is proposed to implement robust routing with partial traffic information. Finally, we demonstrate by simulation that MNC consumes less resources than previous methods and performs quite close to the optimal solution, while ADT achieves the desirable performance in delay, jitter (delay variation), and throughput compared with existing robust routing and traffic grooming algorithms.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">WDM</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Adaptive load-balancing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Traffic uncertainty</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Robust routing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Traffic grooming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Dai</subfield>
   <subfield code="D">Rui</subfield>
   <subfield code="u">Communication and Automation Center, Sichuan Electric Power Corporation, State Grid Corporation of China, South Renmin Road, 610041, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Li</subfield>
   <subfield code="D">Lemin</subfield>
   <subfield code="u">Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Jian She Road, 610054, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wang</subfield>
   <subfield code="D">Sheng</subfield>
   <subfield code="u">Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Jian She Road, 610054, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Photonic Network Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">21/3(2011-06-01), 215-227</subfield>
   <subfield code="x">1387-974X</subfield>
   <subfield code="q">21:3&lt;215</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">21</subfield>
   <subfield code="o">11107</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11107-010-0294-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11107-010-0294-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dai</subfield>
   <subfield code="D">Rui</subfield>
   <subfield code="u">Communication and Automation Center, Sichuan Electric Power Corporation, State Grid Corporation of China, South Renmin Road, 610041, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Li</subfield>
   <subfield code="D">Lemin</subfield>
   <subfield code="u">Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Jian She Road, 610054, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Wang</subfield>
   <subfield code="D">Sheng</subfield>
   <subfield code="u">Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Jian She Road, 610054, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Photonic Network Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">21/3(2011-06-01), 215-227</subfield>
   <subfield code="x">1387-974X</subfield>
   <subfield code="q">21:3&lt;215</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">21</subfield>
   <subfield code="o">11107</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
