Stable and Robust Multipath Oblivious Routing for Traffic Engineering


== Abstract ==

Intra-domain traffic engineering is essential for the operation of an Internet Service Provider. Demand-oblivious routing [2] promises excellent performance guarantee with changing and uncertain traffic demands. However, it is difficult to implement it. We investigate an efficient and deployable implementation of oblivious routing. We study its performance by both numerical experiments and simulation. The performance study shows that the multipath implementation achieves a close approximation to oblivious routing [2], especially when approximate knowledge of traffic is available. The study also shows its robustness under varying traffic demands, link failures and an adversary attack. Its performance is excellent even with a 100% error in traffic estimation.


== Original document ==

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

* [http://www.cs.ualberta.ca/~holte/Publications/itc07.pdf http://www.cs.ualberta.ca/~holte/Publications/itc07.pdf]

* [http://www.springerlink.com/index/pdf/10.1007/978-3-540-72990-7_15 http://www.springerlink.com/index/pdf/10.1007/978-3-540-72990-7_15],
: [http://dx.doi.org/10.1007/978-3-540-72990-7_15 http://dx.doi.org/10.1007/978-3-540-72990-7_15]

* [https://webdocs.cs.ualberta.ca/~holte/Publications/itc07.pdf https://webdocs.cs.ualberta.ca/~holte/Publications/itc07.pdf],
: [https://link.springer.com/chapter/10.1007/978-3-540-72990-7_15 https://link.springer.com/chapter/10.1007/978-3-540-72990-7_15],
: [https://dblp.uni-trier.de/db/conf/teletraffic/itc2007.html#LiBHH07 https://dblp.uni-trier.de/db/conf/teletraffic/itc2007.html#LiBHH07],
: [https://www.scipedia.com/public/Li_et_al_2007a https://www.scipedia.com/public/Li_et_al_2007a],
: [https://doi.org/10.1007/978-3-540-72990-7_15 https://doi.org/10.1007/978-3-540-72990-7_15],
: [https://rd.springer.com/chapter/10.1007/978-3-540-72990-7_15 https://rd.springer.com/chapter/10.1007/978-3-540-72990-7_15],
: [https://academic.microsoft.com/#/detail/1692527761 https://academic.microsoft.com/#/detail/1692527761]