Wang et al 2007a - Revision history

Scipediacontent at 12:48, 21 January 2021

2021-01-21T12:48:51Z

Scipediacontent: Scipediacontent moved page Draft Content 274745136 to Wang et al 2007a

2020-09-29T07:47:18Z

Scipediacontent moved page Draft Content 274745136 to Wang et al 2007a

Scipediacontent: Created page with " == Abstract == We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative comp..."

2020-09-29T07:47:16Z

Created page with " == Abstract == We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative comp..."

New page

== Abstract ==

We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative complexity. The aggregate traffic between a source and a destination, called a flow, is mapped to label switched paths (LSPs) across the network. Each flow is assigned a preferred ('primary') LSP, but traffic may be sent to other ('secondary') LSPs. Within this context, we define objectives for traffic engineering, such as fairness, efficiency, and preferred flow assignment to the primary LSP of a flow ('Primary Path First', PPF). We propose a distributed, feedback-based multipath routing algorithm that attempts to apply additive-increase and multiplicative-decrease (AIMD) to implement our traffic engineering objectives. The new algorithm is referred to as multipath-AIMD. We use ns-2 simulations to illustrate the fairness criteria and PPF property of our multipath-AIMD scheme in an MPLS network.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_274745136-beopen5062-7170-document.pdf</pdf>

== Original document ==

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

* [https://link.springer.com/content/pdf/10.1007%2F3-540-47828-0_13.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47828-0_13.pdf]

* [http://link.springer.com/content/pdf/10.1007/3-540-47828-0_13 http://link.springer.com/content/pdf/10.1007/3-540-47828-0_13],[http://dx.doi.org/10.1007/3-540-47828-0_13 http://dx.doi.org/10.1007/3-540-47828-0_13] under the license http://www.springer.com/tdm

* [http://niits.ru/public/2003/055.pdf http://niits.ru/public/2003/055.pdf],[https://link.springer.com/chapter/10.1007/3-540-47828-0_13 https://link.springer.com/chapter/10.1007/3-540-47828-0_13],[https://core.ac.uk/display/24547816 https://core.ac.uk/display/24547816],[https://rd.springer.com/chapter/10.1007%2F3-540-47828-0_13 https://rd.springer.com/chapter/10.1007%2F3-540-47828-0_13],[https://dl.acm.org/citation.cfm?id=669002 https://dl.acm.org/citation.cfm?id=669002],[https://academic.microsoft.com/#/detail/1555353998 https://academic.microsoft.com/#/detail/1555353998]

@@ Line 3: / Line 3: @@
 We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative complexity. The aggregate traffic between a source and a destination, called a flow, is mapped to label switched paths (LSPs) across the network. Each flow is assigned a preferred ('primary') LSP, but traffic may be sent to other ('secondary') LSPs. Within this context, we define objectives for traffic engineering, such as fairness, efficiency, and preferred flow assignment to the primary LSP of a flow ('Primary Path First', PPF). We propose a distributed, feedback-based multipath routing algorithm that attempts to apply additive-increase and multiplicative-decrease (AIMD) to implement our traffic engineering objectives. The new algorithm is referred to as multipath-AIMD. We use ns-2 simulations to illustrate the fairness criteria and PPF property of our multipath-AIMD scheme in an MPLS network.
@@ Line 16: / Line 11: @@
 * [https://link.springer.com/content/pdf/10.1007%2F3-540-47828-0_13.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47828-0_13.pdf]
-* [http://link.springer.com/content/pdf/10.1007/3-540-47828-0_13 http://link.springer.com/content/pdf/10.1007/3-540-47828-0_13],[http://dx.doi.org/10.1007/3-540-47828-0_13 http://dx.doi.org/10.1007/3-540-47828-0_13] under the license http://www.springer.com/tdm
+* [http://link.springer.com/content/pdf/10.1007/3-540-47828-0_13 http://link.springer.com/content/pdf/10.1007/3-540-47828-0_13],
-* [http://niits.ru/public/2003/055.pdf http://niits.ru/public/2003/055.pdf],[https://link.springer.com/chapter/10.1007/3-540-47828-0_13 https://link.springer.com/chapter/10.1007/3-540-47828-0_13],[https://core.ac.uk/display/24547816 https://core.ac.uk/display/24547816],[https://rd.springer.com/chapter/10.1007%2F3-540-47828-0_13 https://rd.springer.com/chapter/10.1007%2F3-540-47828-0_13],[https://dl.acm.org/citation.cfm?id=669002 https://dl.acm.org/citation.cfm?id=669002],[https://academic.microsoft.com/#/detail/1555353998 https://academic.microsoft.com/#/detail/1555353998]
+* [http://niits.ru/public/2003/055.pdf http://niits.ru/public/2003/055.pdf],

← Older revision	Revision as of 07:47, 29 September 2020
(No difference)