A BDD Approach to the Feature Subscription Problem

Abstract

Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important since it enhances the users’ experience considerably. However, regardless how service providers organise their catalogues of features, they cannot achieve complete configurability due to the existence of feature interactions. Distributed Feature Composition (DFC) provides a comprehensive methodology, underpinned by a formal architecture model to address this issue. In this paper we present an approach based on using Binary Decision Diagrams (BDD) to find optimal reconfigurations of features when a user’s preferences violate the technical constraints defined by a set of DFC rules. In particular, we propose hybridizing constraint programming and standard BDD compilation techniques in order to scale the construction of a BDD for larger size catalogues. Our approach outperforms the standard BDD techniques by reducing the memory requirements by as much as five orders-ofmagnitude and compiles the catalogues for which the standard techniques ran out of memory.

DOI: 10.3233/978-1-58603-891-5-698

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Hadzic2008ABA, title={A BDD Approach to the Feature Subscription Problem}, author={Tarik Hadzic and David Lesaint and Deepak Mehta and Barry O'Sullivan and Luis Quesada and Nic Wilson}, booktitle={ECAI}, year={2008} }