Scipediacontent: Scipediacontent moved page Draft Content 947399877 to Kashyap et al 2007a

2021-02-01T22:36:11Z

Scipediacontent moved page Draft Content 947399877 to Kashyap et al 2007a

Scipediacontent: Created page with " == Abstract == In this paper, we present an algorithm for intra-domain traffic engineering. We assume that the traffic matrix, which specifies traffic load between every sou..."

2021-02-01T22:36:07Z

Created page with " == Abstract == In this paper, we present an algorithm for intra-domain traffic engineering. We assume that the traffic matrix, which specifies traffic load between every sou..."

New page

== Abstract ==

In this paper, we present an algorithm for intra-domain traffic engineering. We assume that the traffic matrix, which specifies traffic load between every source-destination pair in the network, is unknown and varies with time, but that always lies inside an explicitly defined region. Our goal is to compute a fixed robust routing with best worst case performance for all traffic matrices inside the bounding region. We formulate this problem as a semi-infinite programming problem. Then, we focus on a special case with practical merits, where (1) the traffic matrix region is assumed to be a polytope specified by a finite set of linear inequalities, and (2) our objective is to find the routing that minimizes the maximum link utilization. Under these assumptions, the problem can be formulated as a polynomial size linear programming (LP) problem with finite number of constraints. We further consider two specific set of constraints for the traffic matrix region. The first set is based on the hose model and limits the total traffic rate of network point of presence (PoP) nodes. The second set is based on the pipe model and limits the traffic between source-destination pairs. We study the effectiveness of each set of constraints using extensive simulations.

== Original document ==

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

* [http://drum.lib.umd.edu/bitstream/1903/6590/1/TR_2006-9.pdf http://drum.lib.umd.edu/bitstream/1903/6590/1/TR_2006-9.pdf]

* [http://xplorestaging.ieee.org/ielx5/4215581/4215582/04215878.pdf?arnumber=4215878 http://xplorestaging.ieee.org/ielx5/4215581/4215582/04215878.pdf?arnumber=4215878],
: [http://dx.doi.org/10.1109/infcom.2007.296 http://dx.doi.org/10.1109/infcom.2007.296]

* [https://dblp.uni-trier.de/db/conf/infocom/infocom2007.html#TabatabaeeKBLS07 https://dblp.uni-trier.de/db/conf/infocom/infocom2007.html#TabatabaeeKBLS07],
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004215878 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004215878],
: [https://drum.lib.umd.edu/handle/1903/6590 https://drum.lib.umd.edu/handle/1903/6590],
: [https://drum.lib.umd.edu/bitstream/handle/1903/6590/TR_2006-9.pdf;sequence=1 https://drum.lib.umd.edu/bitstream/handle/1903/6590/TR_2006-9.pdf;sequence=1],
: [https://dl.acm.org/citation.cfm?id=2931599 https://dl.acm.org/citation.cfm?id=2931599],
: [https://drum.lib.umd.edu/bitstream/1903/6590/1/TR_2006-9.pdf https://drum.lib.umd.edu/bitstream/1903/6590/1/TR_2006-9.pdf],
: [https://www.isr.umd.edu/~vahidt/Robust-Routing-paper-02.pdf https://www.isr.umd.edu/~vahidt/Robust-Routing-paper-02.pdf],
: [https://academic.microsoft.com/#/detail/2124985325 https://academic.microsoft.com/#/detail/2124985325]

← Older revision	Revision as of 22:36, 1 February 2021
(No difference)

Kashyap et al 2007a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 947399877 to Kashyap et al 2007a

Scipediacontent: Created page with " == Abstract == In this paper, we present an algorithm for intra-domain traffic engineering. We assume that the traffic matrix, which specifies traffic load between every sou..."