Abstract
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].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boizumault, P., David, P, Djellab, D.: Resource allocation in a mobile telephone network: A constructive repair algorithm. In G. Finke, J. F. Maurras, and P. Tolla, editors, RAIRO Recherche Operationnelle, special issue. Hermes. 2000.
Bryant, RE.: Graph-based algorithms for boolean function manipulation. IEEE, Transaction on Computers, C-35(8):677–691. 1986.
Crowcroft, J., Wang, Z.: Quality of service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 17(7):1228–1234. 1996.
David, P.: A constraint-based approach for examination timetabling using local repair techniques. N 1408 in LNCS, pages 169–186. Springer Verlag. Selected papers (extended version) from the Second International Conference on the Practice And Theory of Automated Timetabling. 1997.
Frei, C., Faltings, B.:Resource allocation in networks using abstraction and constraint satisfaction techniques. CP-99, LNCS 1713, pages 204–218. Springer. 1999.
Frei, C.:Abstaction Techniques for Resource Allocation in Communication Networks. PhD thesis, Ecole Polytechnique Federale de Lausanne. 2000.
Freuder, EC.: Partial constraint satisfaction. Artificial Intelligence, 58(1-3):21–70. 1989.
Glover, F.: Tabu search. I. ORSA Journal of Computing, 1(3):190–206. 1989.
Glover, F.: Tabu search. II. ORSA Journal on Computing,, 2(1):4–32. 1990.
Kirkpatrick, S.: Optimization by simulated annealing: quantitative studies. Journal of Statistical Physics, 34(5). 1984.
Kirkpatrick, S., Gelatt, CD., Vecchi, MP.: Optimization by simulated annealing. Science, (220). 1983.
Laburthe, F., Caseau, Y.: SALSA, a language for search algorithms. In CP’98, LNCS 1520, pages 310–324. Springer. 1998.
Lauvergne, M.: PhD Thesis: Connections Reservation with Rerouting for ATM Networks: a hybrid approach with constraints. Ecole des Mines de Nantes. 2002.
Lauvergne, M., David, P., Boizumault, P.: Resources Allocation in ATM networks: A Hybrid Approach. Integration of AI and OR Techniques for Combinatorial Problems (CPAIOR). 2001.
Loudni, S., Boizumault, P.: A new hybrid method for solving on constraint optimization problems on anytime contexts. ICTAI. 2001.
Minton, S., Johnston, MD., Philips, AB., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1-3):161–205. 1992.
Pesant, G., Gendreau, M.: A view of local search in constraint programming. In CP-96, LNCS 1118, pages 353–366. Springer. 1996.
Nahrstedt, K., Chen, S.: An overview of quality of service routing for the next generation high-speed networks: Problems and solutions. IEEE Special issue on transmission and distribution of digital video. 1998.
Schaerf, A.: Combining local search and look-ahead for scheduling and const raint satisfaction problems. In Proc. of the 15th International Joint Conference on Artificia l Intelligence (IJCAI-97), pages 1254–1259, Nagoya, Japan. Morgan Kaufmann. 1997.
Verfaillie, G., Schiex, T.: Solution reuse in dynamic constraint satisfaction problems. In AAAI’94, pages 307–312, Seattle, WA. 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lauvergne, M., David, P., Boizumault, P. (2002). Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive