Optimization of TFRC loss history initialization
Identifieur interne : 009428 ( Main/Exploration ); précédent : 009427; suivant : 009429Optimization of TFRC loss history initialization
Auteurs : Guillaume Jourjon [Australie] ; Emmanuel Lochin [Australie] ; Laurent Dairaine [France]Source :
- IEEE communications letters [ 1089-7798 ] ; 2007.
Descripteurs français
- Pascal (Inist)
- Optimisation, Protocole TCP, Régulation débit, Algorithme, Perte transmission, Commutation paquet, Taux perte, Temps calcul, Méthode Newton, Méthode numérique, Débit information, Protocole transmission, Régulation trafic, Transmission donnée, Transmission information, Gestion trafic, Télétrafic, Perte retour.
English descriptors
- KwdEn :
- Algorithm, Computation time, Data transmission, Flow rate regulation, Information rate, Information transmission, Loss rate, Newton method, Numerical method, Optimization, Packet switching, Return loss, Teletraffic, Traffic control, Traffic management, Transmission control protocol, Transmission loss, Transmission protocol.
Abstract
This letter deals with the initialization of the loss history structure in the TFRC (TCP-Friendly Rate Control) mechanism. This initialization occurs after the detection of the first loss event after every slowstart phase. The loss history is crucial for the algorithm since it returns the packet loss rate estimation. This estimation is used in the TFRC equation to compute the sending rate. In this letter, we propose a new method to compute the packet loss rate which is more computationally efficient and remains as accurate as the classical commonly used method. The motivation of this work is to reduce the computation time and formulate a unified computation scheme. This method is based on the Newton's algorithm issued from numerical analysis of the TCP throughput equation. This proposal is evaluated analytically and the results show a significant improvement in terms of the computation time.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 003D43
- to stream PascalFrancis, to step Curation: 002345
- to stream PascalFrancis, to step Checkpoint: 003722
- to stream Main, to step Merge: 009E34
- to stream Main, to step Curation: 009428
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Optimization of TFRC loss history initialization</title><author><name sortKey="Jourjon, Guillaume" sort="Jourjon, Guillaume" uniqKey="Jourjon G" first="Guillaume" last="Jourjon">Guillaume Jourjon</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National ICT Australia Ltd</s1><s2>Alexandria, NSW 1435</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>National ICT Australia Ltd</wicri:noRegion></affiliation></author><author><name sortKey="Lochin, Emmanuel" sort="Lochin, Emmanuel" uniqKey="Lochin E" first="Emmanuel" last="Lochin">Emmanuel Lochin</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National ICT Australia Ltd</s1><s2>Alexandria, NSW 1435</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>National ICT Australia Ltd</wicri:noRegion></affiliation></author><author><name sortKey="Dairaine, Laurent" sort="Dairaine, Laurent" uniqKey="Dairaine L" first="Laurent" last="Dairaine">Laurent Dairaine</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University of Toulouse</s1><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>University of Toulouse</wicri:noRegion><wicri:noRegion>University of Toulouse</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">07-0157949</idno><date when="2007">2007</date><idno type="stanalyst">PASCAL 07-0157949 INIST</idno><idno type="RBID">Pascal:07-0157949</idno><idno type="wicri:Area/PascalFrancis/Corpus">003D43</idno><idno type="wicri:Area/PascalFrancis/Curation">002345</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">003722</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">003722</idno><idno type="wicri:doubleKey">1089-7798:2007:Jourjon G:optimization:of:tfrc</idno><idno type="wicri:Area/Main/Merge">009E34</idno><idno type="wicri:Area/Main/Curation">009428</idno><idno type="wicri:Area/Main/Exploration">009428</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Optimization of TFRC loss history initialization</title><author><name sortKey="Jourjon, Guillaume" sort="Jourjon, Guillaume" uniqKey="Jourjon G" first="Guillaume" last="Jourjon">Guillaume Jourjon</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National ICT Australia Ltd</s1><s2>Alexandria, NSW 1435</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>National ICT Australia Ltd</wicri:noRegion></affiliation></author><author><name sortKey="Lochin, Emmanuel" sort="Lochin, Emmanuel" uniqKey="Lochin E" first="Emmanuel" last="Lochin">Emmanuel Lochin</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National ICT Australia Ltd</s1><s2>Alexandria, NSW 1435</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>National ICT Australia Ltd</wicri:noRegion></affiliation></author><author><name sortKey="Dairaine, Laurent" sort="Dairaine, Laurent" uniqKey="Dairaine L" first="Laurent" last="Dairaine">Laurent Dairaine</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University of Toulouse</s1><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>University of Toulouse</wicri:noRegion><wicri:noRegion>University of Toulouse</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">IEEE communications letters</title><title level="j" type="abbreviated">IEEE commun. lett.</title><idno type="ISSN">1089-7798</idno><imprint><date when="2007">2007</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">IEEE communications letters</title><title level="j" type="abbreviated">IEEE commun. lett.</title><idno type="ISSN">1089-7798</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Computation time</term><term>Data transmission</term><term>Flow rate regulation</term><term>Information rate</term><term>Information transmission</term><term>Loss rate</term><term>Newton method</term><term>Numerical method</term><term>Optimization</term><term>Packet switching</term><term>Return loss</term><term>Teletraffic</term><term>Traffic control</term><term>Traffic management</term><term>Transmission control protocol</term><term>Transmission loss</term><term>Transmission protocol</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Optimisation</term><term>Protocole TCP</term><term>Régulation débit</term><term>Algorithme</term><term>Perte transmission</term><term>Commutation paquet</term><term>Taux perte</term><term>Temps calcul</term><term>Méthode Newton</term><term>Méthode numérique</term><term>Débit information</term><term>Protocole transmission</term><term>Régulation trafic</term><term>Transmission donnée</term><term>Transmission information</term><term>Gestion trafic</term><term>Télétrafic</term><term>Perte retour</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This letter deals with the initialization of the loss history structure in the TFRC (TCP-Friendly Rate Control) mechanism. This initialization occurs after the detection of the first loss event after every slowstart phase. The loss history is crucial for the algorithm since it returns the packet loss rate estimation. This estimation is used in the TFRC equation to compute the sending rate. In this letter, we propose a new method to compute the packet loss rate which is more computationally efficient and remains as accurate as the classical commonly used method. The motivation of this work is to reduce the computation time and formulate a unified computation scheme. This method is based on the Newton's algorithm issued from numerical analysis of the TCP throughput equation. This proposal is evaluated analytically and the results show a significant improvement in terms of the computation time.</div></front></TEI><affiliations><list><country><li>Australie</li><li>France</li></country></list><tree><country name="Australie"><noRegion><name sortKey="Jourjon, Guillaume" sort="Jourjon, Guillaume" uniqKey="Jourjon G" first="Guillaume" last="Jourjon">Guillaume Jourjon</name></noRegion><name sortKey="Lochin, Emmanuel" sort="Lochin, Emmanuel" uniqKey="Lochin E" first="Emmanuel" last="Lochin">Emmanuel Lochin</name></country><country name="France"><noRegion><name sortKey="Dairaine, Laurent" sort="Dairaine, Laurent" uniqKey="Dairaine L" first="Laurent" last="Dairaine">Laurent Dairaine</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009428 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009428 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:07-0157949
|texte= Optimization of TFRC loss history initialization
}}
| This area was generated with Dilib version V0.6.33. |  |