Loading [MathJax]/extensions/MathMenu.js
Scalable approaches for path computation | IEEE Conference Publication | IEEE Xplore

Scalable approaches for path computation


Abstract:

Optimal and fast approaches for path computation are of paramount importance especially for the path computation elements (PCE) of generalized multi-protocol label switch...Show More

Abstract:

Optimal and fast approaches for path computation are of paramount importance especially for the path computation elements (PCE) of generalized multi-protocol label switching (GMPLS) networks. To overcome the computational complexity, optimality must be traded for the execution time, enabling scalable computation. This paper considers the typical routing problems addressed by PCE and compares different optimization approaches based on integer linear programming (ILP) formulation and its relaxation, with the objective of assessing optimality and scalability of the approaches.
Date of Conference: 05-09 July 2015
Date Added to IEEE Xplore: 13 August 2015
Electronic ISBN:978-1-4673-7880-2

ISSN Information:

Conference Location: Budapest, Hungary

References

References is not available for this document.