On-line resources allocation for ATM networks with rerouting

This paper presents an application we developed for France Telecom R&D to solve a difficult real-life network problem. The problem takes place in an Asynchronous Transfer Mode (ATM) network administration context and consists in planning demands of connection over a period of 1 year. A new demand is accepted if both bandwidth and Quality of Service (QoS) requirements are satisfied. Demands are not known prior to the assignment and must be performed on-line according to their arrival. Moreover, the acceptance or the reject of a demand must be decided within a given time of 1 min.First, we look for a route satisfying the new demand. In case of failure, we try to reroute some already accepted connections in order to satisfy this new demand. Rerouting has been modelled as a Weighted Constraint Satisfaction Problem (wcsp) and solved by VNS/LDS + CP, a hybrid method well suited for solving wcsps in on-line contexts. Experiments show that our rerouting enables to accept an average of 67% of demands that would be rejected otherwise.

[1]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

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

[3]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[4]  Andrea Lodi,et al.  Local Search and Constraint Programming , 2003, Handbook of Metaheuristics.

[5]  Michel Gendreau,et al.  A Constraint Programming Framework for Local Search Methods , 1999, J. Heuristics.

[6]  Pierre Gerard,et al.  Towards an on-line optimisation framework , 2001 .

[7]  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.

[8]  Johnny W. Wong,et al.  Resource management with virtual paths in ATM networks , 1996 .

[9]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[10]  Mark S. Boddy,et al.  Deliberation Scheduling for Problem Solving in Time-Constrained Environments , 1994, Artif. Intell..

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

[12]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

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

[15]  Samir Loudni.  Conception et mise en oeuvre d'algorithmes anytime : une approche à base de contraintes , 2002 .

[16]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[17]  François Laburhe.  CHOCO: implementing a CP kernel , 2007 .

[18]  Krzysztof R. Apt,et al.  Search and imperative programming , 1997, POPL '97.

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

[20]  Muriel Lauvergne.  Réservation de connexions avec reroutage pour les réseaux ATM : une approche hybride par programmation par contraintes , 2002 .

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

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

[23]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[24]  François Laburthe,et al.  CLAIRE: combining sets, search and rules to better express algorithms , 1999, Theory and Practice of Logic Programming.

[25]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[26]  Ren-Hung Hwang,et al.  Routing in ATM networks with multiple classes of QoS , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[27]  Zhisheng Niu,et al.  A QoS routing algorithm for hierarchical ATM networks , 1999, Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference on Communications,.

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

[29]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[30]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[31]  Patrice Boizumault,et al.  Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints , 2002, CP.

[32]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[33]  Qingming Ma.  Quality-of-Service Routing in Integrated Services Networks , 1998 .

[34]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

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

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

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

[38]  Witold Pedrycz,et al.  Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques , 2003, IEEE Trans. Syst. Man Cybern. Part C.