descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jul 2015Publisher:IEEEJournal:2015 17th International Conference on Transparent Optical Networks (ICTON)

Authors: CERUTTI, Isabella; Bruno, G.; Lazzeri, F.; Nijhof, J.; CASTOLDI, Piero;

doi: 10.1109/icton.2015.7193457

handle: 11382/508502

Scalable approaches for path computation

- Summary
- Subjects
- Metrics

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.

Related Organizations

Sant'Anna School of Advanced Studies
Italy
Ericsson (Sweden)
Sweden

Keywords

Complex networks; Integer programming; Routing protocols; Telecommunication networks ILP formulation; Multi-commodity flow; Path computation elements; Relaxation; Routing

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average