Balancing by preflex congestion aware traffic engineering


== Abstract ==

Part 3: Resource Allocation; International audience; There has long been a need for a robust and reliable system which distributes traffic across multiple paths. In particular such a system must rarely reorder packets, must not require per-flow state, must cope with different paths having different bandwidths and must be self-tuning in a variety of network contexts. PREFLEX, proposed herein, uses estimates of loss rate to balance congestion. This paper describes a method of automatically adjusting how PREFLEX will split traffic in order to balance loss across multiple paths in a variety of network conditions.Equations are derived for the automatic tuning of the time scale and traffic split at a decision point. The algorithms described allow the load balancer to self-tune to network conditions. The calculations are simple and do not place a large burden on a router which would implement the algorithm. The algorithm is evaluated by simulation using ns-3 and is shown to perform well under a variety of circumstances. The resulting adaptive, end-to-end traffic balancing architecture provides the necessary framework to meet the increasing demands of users while simultaneously offering edge networks more fine-grained control at far shorter timescales.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Joao_et_al_2011a-beopen2723-7836-document.pdf</pdf>


== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.1007/978-3-642-20798-3_11 http://dx.doi.org/10.1007/978-3-642-20798-3_11]

* [https://link.springer.com/content/pdf/10.1007%2F978-3-642-20798-3_11.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-642-20798-3_11.pdf]

* [http://link.springer.com/content/pdf/10.1007/978-3-642-20798-3_11.pdf http://link.springer.com/content/pdf/10.1007/978-3-642-20798-3_11.pdf],
: [http://dx.doi.org/10.1007/978-3-642-20798-3_11 http://dx.doi.org/10.1007/978-3-642-20798-3_11]

* [https://hal.inria.fr/hal-01597978 https://hal.inria.fr/hal-01597978],
: [https://hal.inria.fr/hal-01597978/document https://hal.inria.fr/hal-01597978/document],
: [https://hal.inria.fr/hal-01597978/file/978-3-642-20798-3_11_Chapter.pdf https://hal.inria.fr/hal-01597978/file/978-3-642-20798-3_11_Chapter.pdf] under the license http://creativecommons.org/licenses/by/

* [https://link.springer.com/chapter/10.1007/978-3-642-20798-3_11 https://link.springer.com/chapter/10.1007/978-3-642-20798-3_11],
: [http://www.richardclegg.org/sites/default/files/papers/ifip_nets1.pdf http://www.richardclegg.org/sites/default/files/papers/ifip_nets1.pdf],
: [https://www.scipedia.com/public/Joao_et_al_2011a https://www.scipedia.com/public/Joao_et_al_2011a],
: [https://dl.acm.org/citation.cfm?id=2008840 https://dl.acm.org/citation.cfm?id=2008840],
: [https://dblp.uni-trier.de/db/conf/networking/networking2011-2.html#AraujoCGRP11 https://dblp.uni-trier.de/db/conf/networking/networking2011-2.html#AraujoCGRP11],
: [https://rd.springer.com/chapter/10.1007/978-3-642-20798-3_11 https://rd.springer.com/chapter/10.1007/978-3-642-20798-3_11],
: [http://discovery.ucl.ac.uk/1360110 http://discovery.ucl.ac.uk/1360110],
: [https://academic.microsoft.com/#/detail/1812228731 https://academic.microsoft.com/#/detail/1812228731]