Scipediacontent: Scipediacontent moved page Draft Content 920518479 to Rougier Larroca 2009a

2021-02-03T15:57:18Z

Scipediacontent moved page Draft Content 920518479 to Rougier Larroca 2009a

Scipediacontent: Created page with " == Abstract == Current data network scenario makes traffic engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts..."

2021-02-03T15:57:14Z

Created page with " == Abstract == Current data network scenario makes traffic engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts..."

New page

== Abstract ==

Current data network scenario makes traffic engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more variable and unpredictable traffic patterns. By providing origin-destination pairs with several possible paths, load-balancing has proved itself an excellent tool to face this uncertainty. In particular, mechanisms where routers greedily minimize a path cost function (thus requiring minimum coordination) have been studied from a game-theoretic perspective in what is known as a routing game (RG). The contribution of this paper is twofold. We first propose a new RG specifically designed for elastic traffic, where we maximize the total utility through load-balancing only. Secondly, we consider several important RGs from a TE perspective and, using several real topologies and traffic demands, present a thorough comparison of their performance. This paper brings insight into several RGs, which will help one in choosing an adequate dynamic load-balancing mechanism. The comparison shows that the performance gain of the proposed game can be important.

== Original document ==

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

* [http://iie.fing.edu.uy/%7Eflarroca/papers/icc09/paper_icc_v2.pdf http://iie.fing.edu.uy/%7Eflarroca/papers/icc09/paper_icc_v2.pdf]

* [http://xplorestaging.ieee.org/ielx5/5198563/5198564/05199427.pdf?arnumber=5199427 http://xplorestaging.ieee.org/ielx5/5198563/5198564/05199427.pdf?arnumber=5199427],
: [http://dx.doi.org/10.1109/icc.2009.5199427 http://dx.doi.org/10.1109/icc.2009.5199427]

* [https://dblp.uni-trier.de/db/conf/icc/icc2009.html#LarrocaR09 https://dblp.uni-trier.de/db/conf/icc/icc2009.html#LarrocaR09],
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005199427 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005199427],
: [https://doi.org/10.1109/ICC.2009.5199427 https://doi.org/10.1109/ICC.2009.5199427],
: [http://doi.org/10.1109/ICC.2009.5199427 http://doi.org/10.1109/ICC.2009.5199427],
: [https://ieeexplore.ieee.org/document/5199427 https://ieeexplore.ieee.org/document/5199427],
: [https://academic.microsoft.com/#/detail/2119967960 https://academic.microsoft.com/#/detail/2119967960]

← Older revision	Revision as of 15:57, 3 February 2021
(No difference)

Rougier Larroca 2009a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 920518479 to Rougier Larroca 2009a

Scipediacontent: Created page with " == Abstract == Current data network scenario makes traffic engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts..."