Abstract
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation. In this paper, we show that this problem is NP-hard and we present a constraint programming formulation using the variable weighted constraint satisfaction problem framework. We also present simple formulations using partial weighted maximum satisfiability and integer linear programming. We experimentally compare our formulations of the different approaches; the results suggest that our constraint programming approach is the best of the three overall.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bond, G.W., Cheung, E., Purdy, H., Zave, P., Ramming, C.: An Open Architecture for Next-Generation Telecommunication Services. ACM Transactions on Internet Technology 4(1), 83–123 (2004)
Jackson, M., Zave, P.: Distributed Feature Composition: a Virtual Architecture for Telecommunications Services. IEEE TSE 24(10), 831–847 (1998)
Jackson, M., Zave, P.: The DFC Manual. AT&T (November 2003)
Bessiere, C.: Constraint propagation. Technical Report 06020, LIRMM, Montpellier,France (March 2006)
Zave, P., Goguen, H., Smith, T.M.: Component Coordination: a Telecommunication Case Study. Computer Networks 45(5), 645–664 (2004)
Zave, P.: An Experiment in Feature Engineering. In: McIver, A., Morgan, C. (eds.) Programming Methodology, pp. 353–377. Springer, Heidelberg (2003)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge (1990)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the The Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Wallace, M.: Practical applications of constraint programming. Constraints Journal 1(1), 139–168 (1996)
Dooms, G., Deville, Y., Dupont, P.: CP(Graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211–225. Springer, Heidelberg (2005)
Bessiere, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artificial Intelligence (2007)
Debruyne, R., Bessiére, C.: Some practical filtering techniques for the constraint satifaction problem. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, Nagoya, Japan, pp. 412–417 (1997)
Prosser, P., Stergiou, K., Walsh, T.: Singleton Consistencies. In: CP 2000, pp. 353–368 (September 2000)
Lecoutre, C., Patrick, P.: Maintaining singleton arc consistency. In: Proceedings of the 3rd International Workshop on Constraint Propagation And Implementation (CPAI 2006) held with CP 2006, Nantes, France, pp. 47–61 (September 2006)
Hawkins, P., Lagoon, V., Stuckey, P.J.: Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research 24, 109–156 (2005)
Laburthe, F., Jussien, N.: JChoco: A java library for constraint programming
Le Berre, D.: SAT4J: An efficient library of SAT solvers in java
ILOG: CPLEX solver 10.1, http://www.ilog.com/products/cplex/
Bond, G.W., Cheung, E., Goguen, H., Hanson, K.J., Henderson, D., Karam, G.M., Purdy, K.H., Smith, T.M., Zave, P.: Experience with Component-Based Development of a Telecommunication Service. In: Heineman, G.T., Crnković, I., Schmidt, H.W., Stafford, J.A., Szyperski, C.A., Wallnau, K. (eds.) CBSE 2005. LNCS, vol. 3489, pp. 298–305. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lesaint, D., Mehta, D., O’Sullivan, B., Quesada, L., Wilson, N. (2008). Solving a Telecommunications Feature Subscription Configuration Problem. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)