Scipediacontent: Scipediacontent moved page Draft Content 517949796 to Leduc Balon 2006a

2021-02-02T02:21:29Z

Scipediacontent moved page Draft Content 517949796 to Leduc Balon 2006a

Scipediacontent: Created page with " == Abstract == In this paper we propose a new method to approach optimal Traffic Engineering routing. The method consists of dividing the traffic matrix into $N$ sub-matrice..."

2021-02-02T02:21:24Z

Created page with " == Abstract == In this paper we propose a new method to approach optimal Traffic Engineering routing. The method consists of dividing the traffic matrix into $N$ sub-matrice..."

New page

== Abstract ==

In this paper we propose a new method to approach optimal Traffic Engineering routing. The method consists of dividing the traffic matrix into $N$ sub-matrices, called strata, and route each of these independently. We propose two different implementations of our method in routers. Our method can also be used to compute a very precise approximation of the optimal value of a given objective function for comparison to heuristic Traffic Engineering algorithms. For this application, our algorithm is very efficient on large topologies compared to an LP formulation. Peer reviewed

== Original document ==

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

* [http://totem.info.ucl.ac.be/publications/papers-elec-versions/ICON2006-Balon.pdf http://totem.info.ucl.ac.be/publications/papers-elec-versions/ICON2006-Balon.pdf]

* [https://orbi.uliege.be/handle/2268/3382 https://orbi.uliege.be/handle/2268/3382]

* [http://xplorestaging.ieee.org/ielx5/4087640/4065007/04087763.pdf?arnumber=4087763 http://xplorestaging.ieee.org/ielx5/4087640/4065007/04087763.pdf?arnumber=4087763],
: [http://dx.doi.org/10.1109/icon.2006.302619 http://dx.doi.org/10.1109/icon.2006.302619]

* [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004087763 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004087763],
: [https://dblp.uni-trier.de/db/conf/icon/icon2006.html#BalonL06 https://dblp.uni-trier.de/db/conf/icon/icon2006.html#BalonL06],
: [https://ieeexplore.ieee.org/document/4087763 https://ieeexplore.ieee.org/document/4087763],
: [https://orbi.uliege.be/handle/2268/3382 https://orbi.uliege.be/handle/2268/3382],
: [https://academic.microsoft.com/#/detail/2092267200 https://academic.microsoft.com/#/detail/2092267200]

← Older revision	Revision as of 02:21, 2 February 2021
(No difference)

Leduc Balon 2006a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 517949796 to Leduc Balon 2006a

Scipediacontent: Created page with " == Abstract == In this paper we propose a new method to approach optimal Traffic Engineering routing. The method consists of dividing the traffic matrix into $N$ sub-matrice..."