Scipediacontent: Scipediacontent moved page Draft Content 301186039 to Texier et al 2009a

2021-02-03T20:16:20Z

Scipediacontent moved page Draft Content 301186039 to Texier et al 2009a

Scipediacontent: Created page with " == Abstract == International audience; The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPL..."

2021-02-03T20:16:17Z

Created page with " == Abstract == International audience; The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPL..."

New page

== Abstract ==

International audience; The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPLS-TE networks. An efficient solution to this problem is a key element for providing services with guaranteed performance across domain boundaries. However, the inherent hardness of the multi-constrained path computation as well as inter-domain scalability and security constraints complicate the computation problem. We propose a novel algorithm named kID-MCP that tackles the computational complexity of the problem by reducing the number of paths included in the computation process. kID-MCP is compatible with existing techniques and fulfills the security requirements. We undergo a complexity analysis that shows that kID-MCP scales well. Moreover, a simulation study reveals that kID-MCP finds a solution in most situations. These results indicate that the computation of inter-domain multi-constrained paths is tractable in practice, which opens interesting perspectives for QoS routing and traffic engineering among multiple operators.

== Original document ==

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

* [https://hal.archives-ouvertes.fr/hal-00424319 https://hal.archives-ouvertes.fr/hal-00424319]

* [http://xplorestaging.ieee.org/ielx5/5175743/5175744/05175757.pdf?arnumber=5175757 http://xplorestaging.ieee.org/ielx5/5175743/5175744/05175757.pdf?arnumber=5175757],
: [http://dx.doi.org/10.1109/ngi.2009.5175757 http://dx.doi.org/10.1109/ngi.2009.5175757]

* [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005175757 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005175757],
: [https://hal.archives-ouvertes.fr/hal-00424319 https://hal.archives-ouvertes.fr/hal-00424319],
: [https://dblp.uni-trier.de/db/conf/ngi/ngi2009.html#BertrandLTM09 https://dblp.uni-trier.de/db/conf/ngi/ngi2009.html#BertrandLTM09],
: [https://academic.microsoft.com/#/detail/2115074685 https://academic.microsoft.com/#/detail/2115074685]

← Older revision	Revision as of 20:16, 3 February 2021
(No difference)

Texier et al 2009a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 301186039 to Texier et al 2009a

Scipediacontent: Created page with " == Abstract == International audience; The present paper proposes a novel method for computing inter-domain paths subject to multiple independent additive constraints in MPL..."