Latest revision as of 14:48, 21 January 2021

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.

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

• http://link.springer.com/content/pdf/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,

https://link.springer.com/chapter/10.1007/3-540-47828-0_13,

https://core.ac.uk/display/24547816,

https://www.scipedia.com/public/Wang_et_al_2007a,

https://dblp.uni-trier.de/db/conf/phsn/phsn2002.html#WangPWL02,

https://rd.springer.com/chapter/10.1007%2F3-540-47828-0_13,

https://dl.acm.org/citation.cfm?id=669002,

http://www.comm.toronto.edu/~jorg/archive/papers/pfhsn2002.pdf,

https://academic.microsoft.com/#/detail/1555353998