By Topic

A machine learning based algorithm for routing bandwidth-guaranteed paths in MPLS TE: Improvements and performance assessment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D'Andreti, P. ; DAEIIMI, Univ. degli Studi di Cassino, Cassino, Italy ; Tortorella, F.

The RRATE algorithm opened a new class of solutions for the computation of bandwidth-guaranteed paths in MPLS networks giving significant increase in both path selection speed and efficiency. Nevertheless, analyzing RRATE behavior while dealing with complex and big (in terms of nodes and link number) networks, has been shown that are possible more enhancements if changes are made to the core function that evaluates the “goodness” of a path over other paths. That function takes into account the critical links and the residual bandwidths available on the network. More specifically, changes have been made to the way those values are computed taking into account no more the scalar value of residual bandwidths and critical links but a ranking of the first values and an appropriate weighting of the second parameters. The obtained results reveal steady performance gains over the original RRATE algorithm and, in larger extent, over legacy algorithms like MIRA.

Published in:

Measurements and Networking Proceedings (M&N), 2011 IEEE International Workshop on

Date of Conference:

10-11 Oct. 2011