Li et al 2007a - Revision history

Scipediacontent at 14:15, 21 January 2021

2021-01-21T14:15:52Z

Scipediacontent: Scipediacontent moved page Draft Content 846062127 to Li et al 2007a

2020-10-14T12:51:00Z

Scipediacontent moved page Draft Content 846062127 to Li et al 2007a

Scipediacontent: Created page with " == Abstract == Intra-domain traffic engineering is essential for the operation of an Internet Service Provider. Demand-oblivious routing [2] promises excellent performance g..."

2020-10-14T12:50:58Z

Created page with " == Abstract == Intra-domain traffic engineering is essential for the operation of an Internet Service Provider. Demand-oblivious routing [2] promises excellent performance g..."

New page

== 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.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_846062127-beopen644-6993-document.pdf</pdf>

== 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]

← Older revision		Revision as of 14:15, 21 January 2021
Line 3:		Line 3:

	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.		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.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_846062127-beopen644-6993-document.pdf</pdf>~~


Line 15:		Line 10:

	* [http://www.cs.ualberta.ca/~holte/Publications/itc07.pdf http://www.cs.ualberta.ca/~holte/Publications/itc07.pdf]		* [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]

← Older revision	Revision as of 12:51, 14 October 2020
(No difference)