Cart (Loading....) | Create Account
Close category search window

Reroute sequence planning for protected traffic flows in GMPLS networks

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

1 Author(s)
Balazs Gabor Jozsa ; Traffic Anal. & Network Performance Lab., Ericsson Res. Hungary, Budapest, Hungary

This paper aims the solution of the reroute sequence planning problem for protected traffic flows. This problem arises when a service provider recalculates the path set by a global optimization tool in order to achieve a better resource utilization. In this case a sequence of the one-by-one reconfiguration of the traffic flows from their original paths to the optimized paths has to be found, with the constraint that the link capacities should not be violated at any time during the rerouting process. This optimization problem is related to discrepancy theory and it is NP-complete. It is computationally hard in realworld situations because of the large amount of routers and traffic flows in the network, therefore exact and approximation algorithms have little practical relevance. We present a number of heuristic approaches, which are tested on various network situations. We assume generalized multi-protocol label switching context but the methods can be applied for other types of networks as well. The results show that in most cases these methods are appropriate for calculating the reroute sequence, mainly when the objective of the path optimization is load balancing.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:5 )

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.