Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Introduction to algorithms
Distributed Feature Composition: A Virtual Architecture for Telecommunications Services
IEEE Transactions on Software Engineering
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
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
A BDD-based polytime algorithm for cost-bounded interactive configuration
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Distance constraints in constraint satisfaction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Experience with component-based development of a telecommunication service
CBSE'05 Proceedings of the 8th international conference on Component-Based Software Engineering
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Decision diagrams: fast and flexible support for case retrieval and recommendation
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
| Hi-index | 0.00 |
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-of-magnitude and compiles the catalogues for which the standard techniques ran out of memory.