Abstract
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem domain is of huge practical importance, but it also provides us with interesting, complex problem structures. CP directly competes with MILP and local search approaches to these problems, with best results often obtained by a combination of different solution techniques. Teams at Parc Technologies and IC-Parc have been working in this field over the last years, with a number of applications now embedded in commercial products.
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
Le Pape, C., Perron, L., Regin, J., Shaw, P.: Robust and parallel solving of a network design problem. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 633. Springer, Heidelberg (2002)
Chabrier, A.: Heuristic branch-and-price-and-cut to solve a network design problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (2003)
Cronholm, W., Ajili, F.: Strong cost-based filtering for Lagrange decomposition applied to network design. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 726–730. Springer, Heidelberg (2004)
Smith, B.: Search strategies for optimization: Modelling the SONET problem. In: 2nd International Workshop on Reformulating Constraint Satisfaction Problems, Kinsale, Ireland (2003)
Ros, L., Creemers, T., Tourouta, E., Riera, J.: A global constraint model for integrated routeing and scheduling on a transmission network. In: 7th International Conference on Information Networks, Systems and Technologies (2001)
Ouaja, W.: Integrating Lagrangian Relaxation and Constraint Programming for Multicommodity Network Routing. PhD thesis, IC-Parc, Imperial College London, University of London (2004)
Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks 43(3), 125–140 (2004)
Kamarainen, O., El Sakkout, H.: Local probing applied to network routing. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France (2004)
Kamarainen, O.: Local Probing - A New Framework for Combining Local Search with Backtrack Search. PhD thesis, IC-Parc, Imperial College London, University of London (2003)
Liatsos, V., Novello, S., El Sakkout, H.: A probe backtrack search algorithm for network routing. In: Proceedings of the Third International Workshop on Cooperative Solvers in Constraint Programming, CoSolv 2003, Kinsale, Ireland (2003)
Lever, J.: A local search/constraint propagation hybrid for a network routing problem. In: The 17th International FLAIRS Conference (FLAIRS 2004), Miami Beach, Florida (2004)
Frei, C., Faltings, B.: Resource allocation in networks using abstraction and constraint satisfaction techniques. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 204–218. Springer, Heidelberg (1999)
Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrices estimation: Existing techniques and new directions. In: ACM SIGCOMM 2002, Pittsburgh, PA (2002)
Yorke-Smith, N., Gervet, C.: On constraint problems with incomplete or erroneuos data. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 766. Springer, Heidelberg (2002)
Yorke-Smith, N.: Reliable Constraint Reasoning with Uncertain Data. PhD thesis, IC-Parc, Imperial College London, University of London (2004)
Simonis, H.: Resilience analysis in MPLS networks. Technical report, Parc Technologies Ltd (2003) (submitted for publication)
Xia, Q., Eremin, A., Wallace, M.: Problem decomposition for traffic diversions. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France, pp. 348–363 (2004)
Lauvergne, M., David, P., Bauzimault, P.: Connections reservation with rerouting for ATM networks: A hybrid approach with constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 649. Springer, Heidelberg (2002)
Loudni, S., David, P., Boizumault, P.: On-line resource allocation for ATM networks with rerouting. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simonis, H. (2004). Challenges for Constraint Programming in Networking. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive