Implementation of a traffic engineering technique that preserves IP Fast Reroute in COMET

Tue, 05/11/2010 - 15:12 by Olivier Bonaventure

Abstract

With Intradomain Routing Protocols, by optimizing the configuration (Trafic Engineering -TE) of link weights, operators can significantly improve the load of their links, which is known to be an NP-hard problem. Another emerging issue for ISP networks is the fast restoration of IP services in the case of failures. Recently, Fast Reroute techniques have been proposed for pure IP networks. The Loop Free Alternates (LFA) is one of the most promising technique. An LFA for a router A, for a destination d, is a neighbor C of A which does not use A to reach d, so that A can prepare itself to directly reroute the traffic destined to d along its link with C upon the failure of the link that A is using to reach d. Our objective is to provide a TE technique that takes the coverage of LFAs into account during the network resource usage optimization. Constraint Programming and Constraint-Based Local Search are well suited for solving such complex combinatorial problems. Especially in COMET, some classical problems can be modeled in only about a dozen lines of code. So, we have chosen a local search algorithm implemented in COMET for solving our traffic engineering problem.

Authors
Ho Trong Viet, Pierre Francois, Yves Deville and Olivier Bonaventure
Source
Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Algotel (2009), 2009.
Full text
pdf    (193.93 KB)
Cite it
BibTex
Copyright
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.