Solving a Telecommunications Feature Subscription Configuration Problem

Authors:
David Lesaint;Deepak Mehta;Barry O'Sullivan;Luis Quesada;Nic Wilson
Affiliations:
Intelligent Systems Research Centre, British Telecom, UK;Cork Constraint Computation Centre, University College Cork, Ireland;Cork Constraint Computation Centre, University College Cork, Ireland;Cork Constraint Computation Centre, University College Cork, Ireland;Cork Constraint Computation Centre, University College Cork, Ireland
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 10
Cited 3

Introduction to algorithms

Introduction to algorithms
Distributed Feature Composition: A Virtual Architecture for Telecommunications Services

IEEE Transactions on Software Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Singleton Consistencies

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
An experiment in feature engineering

Programming methodology
An open architecture for next-generation telecommunication services

ACM Transactions on Internet Technology (TOIT)
Component coordination: a telecommunication case study

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Directions in feature interaction research
Domain filtering consistencies for non-binary constraints

Artificial Intelligence
Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research
Experience with component-based development of a telecommunication service

CBSE'05 Proceedings of the 8th international conference on Component-Based Software Engineering

Telecommunications Feature Subscription as a Partial Order Constraint Problem

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A declarative encoding of telecommunications feature subscription in SAT

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Developing approaches for solving a telecommunications feature subscription problem

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

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.