Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints

This paper presents a hybrid method developed at France Telecom R&D to solve a difficult network problem. It takes place in an ATM network administration context and consists in planning connection demands over a period of one year.We introduce a new framework for solving this problem within the allowed computing time. This framework is based on two major elements: first a hybrid method which mixes shortest path algorithms, constraint propagation and repairing principles, then a model for the time dimension which is a critical issue in this ATM network administration problem.We compare our method with a greedy method (without rerouting) presently used in FTR&D upon realistic problems. The results of our experiments show that the difficult problem of rerouting can be solved with our method. Moreover, rerouting leads to accept of 46% of connections that are rejected with the greedy algorithm. This paper is a revised version of [14].

[1]  Patrice Boizumault,et al.  Resource allocation in a mobile telephone network: A constructive repair algorithm , 2001, RAIRO Oper. Res..

[2]  Philippe David.  A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques , 1997, PATAT.

[3]  Michel Gendreau,et al.  A View of Local Search in Constraint Programming , 1996, CP.

[4]  Boi Faltings,et al.  Resource Allocation and Constraint Satisfaction Techniques , 1999, CP.

[5]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[6]  Patrice Boizumault,et al.  New hybrid method for solving constraint optimization problems in anytime contexts , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

[7]  Andrea Schaerf,et al.  Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems , 1997, IJCAI.

[8]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[9]  Scott Kirkpatrick,et al.  Optimization by simulated annealing: Quantitative studies , 1984 .

[10]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[11]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[12]  François Laburthe,et al.  SALSA: A Language for Search Algorithms , 1998, CP.

[13]  Boi Faltings,et al.  Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques , 1999 .

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[16]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[17]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[18]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..