<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445296704</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142544.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20100401xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s12243-010-0159-1</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s12243-010-0159-1</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Equation-based end-to-end single-rate multicast congestion control</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Wafa Kammoun, Habib Youssef]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Among the recently proposed single-rate multicast congestion control protocols is transmission control protocol-friendly multicast congestion control (TFMCC; Widmer and Handley 2001; Floyd et al. 2000; Widmer et al. IEEE Netw 15:28-37, 2001), which is an equation-based single-rate protocol that extends the mechanisms of the unicast TCP-friendly rate control (TFRC) protocol into the multicast domain. In TFMCC, each receiver estimates its throughput using an equation that estimates the steady-state throughput of a TCP source. The source then adjusts its sending rate according to the slowest receiver within the session (a.k.a., current-limiting receiver, CLR). TFMCC is a relatively simple, scalable, and TCP-friendly multicast congestion control protocol. However, TFMCC is hindering its throughput performance by adopting an equation derived from the unicast TFRC protocol. Further, TFMCC is slow to react to congestion conditions that usually result in a change of the CLR. This paper is motivated by these two observations and proposes an improved version of TFMCC, which we refer to as hybrid-TFMCC (or H-TFMCC for short). First, each receiver estimates its throughput using an equation that models the steady-state throughput of a multicast source controlled according to the additive increase multiplicative decrease (AIMD) approach. The second modification consists of adopting a hybrid sender/receiver-based rate control strategy, where the sending rate can be adjusted by the source or initiated by the current or a new CLR. The source monitors RTT variations on the CLR path, in order to rapidly adjust the sending rate to network conditions. Simulation results show that these modifications result in remarkable performance improvement with respect to throughput, time to react, and magnitude of oscillations. We also show that H-TFMCC remains TCP-friendly and achieves a higher fairness index than that achieved by TFMCC.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Institut TELECOM and Springer-Verlag, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multicast transport protocols</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Equation-based</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Single-rate multicast congestion control</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">AIMD</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kammoun</subfield>
   <subfield code="D">Wafa</subfield>
   <subfield code="u">Research Unit PRINCE, ISITCom H-Sousse, University of Sousse, Sousse, Tunisia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Youssef</subfield>
   <subfield code="D">Habib</subfield>
   <subfield code="u">Research Unit PRINCE, ISITCom H-Sousse, University of Sousse, Sousse, Tunisia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">annals of telecommunications - annales des télécommunications</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">65/3-4(2010-04-01), 219-231</subfield>
   <subfield code="x">0003-4347</subfield>
   <subfield code="q">65:3-4&lt;219</subfield>
   <subfield code="1">2010</subfield>
   <subfield code="2">65</subfield>
   <subfield code="o">12243</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s12243-010-0159-1</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/s12243-010-0159-1</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">Kammoun</subfield>
   <subfield code="D">Wafa</subfield>
   <subfield code="u">Research Unit PRINCE, ISITCom H-Sousse, University of Sousse, Sousse, Tunisia</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">Youssef</subfield>
   <subfield code="D">Habib</subfield>
   <subfield code="u">Research Unit PRINCE, ISITCom H-Sousse, University of Sousse, Sousse, Tunisia</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">annals of telecommunications - annales des télécommunications</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">65/3-4(2010-04-01), 219-231</subfield>
   <subfield code="x">0003-4347</subfield>
   <subfield code="q">65:3-4&lt;219</subfield>
   <subfield code="1">2010</subfield>
   <subfield code="2">65</subfield>
   <subfield code="o">12243</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>
