Conflict Detection in Call Control using First-Order Logic Model Checking

Feature interaction detection methods, whether online or offline, depend on previous knowledge of conflicts between the actions executed by the features. This knowledge is usually assumed to be given in the application domain. A method is proposed for identifying potential conflicts in call control actions, based on analysis of their pre/post-conditions. First of all, pre/postconditions for call processing actions are defined. Then, conflicts among the pre/post-conditions are defined. Finally, action conflicts are identified as a result of these conflicts. These cover several possibilities where the actions could be simultaneous or sequential. A first-order logic model-checking tool is used for automated conflict detection. As a case study, the APPEL call control language is used to illustrate the approach, with the Alloy tool serving as the model checker for automated conflict detection. This case study focuses on pre/post-conditions describing call control state and media state. The results of the method are evaluated by a domain expert with pragmatic understanding of the system’s behavior. The method, although computationally expensive, is fairly general and can be used to study conflicts in other domains

Managing Distributed Feature Interactions in Enterprise SIP Application Servers

Several trends in SIP application server deployments exacerbate the classic problem of feature interaction in large enterprise telephony environments: use of distributed feature servers, mixing of legacy and green-field feature servers, and the co-existence of multiple third-party feature implementations provisioned in the same environment. Next-generation SIP application servers will include an application router (AR) to provide more control over feature sequencing. As we discuss here, the AR can be augmented to incorporate feature interaction detection and resolution logic. We describe a novel design for run-time feature interaction detection and resolution in an environment of distributed feature servers using a SIP application server with application routing function, such as that defined in JSR 289. The approach is based on the algorithm of the Kolberg-Magill (K-M) method for feature interaction detection. Here we extend the notation of the algorithm to cover advanced call control services, enable the algorithm to work in topologies involving B2BUAs and SBCs, and test the approach with a substantial feature set of 32 features

CIAO: A Component Model and its OSGi Framework for Dynamically Adaptable Telephony Applications

International audienceIn recent years, thanks to new IP protocols like SIP, telephony applications and services have evolved to other and combine a variety of communication forms including presence status, instant messaging and videoconference. As a result, advanced telephony applications now consist of distributed entities that are involved into multiple heterogeneous, stateful and long-running interactions (sessions). This evolution complicated significantly applications development and calls for more effective solutions. In this paper, we explore the adoption of components for addressing this issue, focusing specifically on the management and coordination of the numerous and various sessions occurring in such applications. The paper presents CIAO, a domain-specific and hierarchical component model for SIP applications. CIAO combines three kinds of component that are Actor, SessionPart and Role and manage them dynamically in accordance with real SIP sessions. By using these features, we are able to break the complexity of SIP entities and provide flexibility for their development. CIAO is implemented above OSGi to experiment the building of concrete SIP applications and enable their dynamic adaptation

Initialisation Problems in Feature Composition

Composing features that have inconsistent requirements may lead to feature interactions that violate requirements satisfied by each feature in isolation. These interactions manifest themselves as conflicts on shared resources. Arbitration is a common approach to resolving such conflicts that uses prioritisation to decide which feature has access to resources when there is a conflict. However, arbitration alone does not guarantee satisfaction of the requirement of the feature that eventually gains access to a resource. This is because arbitration does not take into account that the resource may be in a state that is inconsistent with that expected by the feature. We call this the initialisation problem. In this thesis we propose an approach to addressing the initialisation problem which combines arbitration with contingencies. Contingency means having several specifications per feature satisfying the same requirement, depending on the current resource state. We illustrate and validate our approach by applying it to resolving conflicts between features in smart home and automotive domains. The validation shows that contingencies complement arbitration by enabling satisfaction of the requirement of the feature that eventually gains access to a shared resource, regardless of the current state of the resource. The main contribution of this thesis is an approach to analysing initialisation concerns in feature composition. At the core of our approach is an explicit consideration of all possible states of a resource as potential initial states. Given each initial state we then derive corresponding specifications that would enable a feature to satisfy its requirement in those states. We show that our approach to initialisation problems is relevant to addressing the feature interaction problem by characterising some types of conflicts as initialisation concerns

A System for Controlling, Monitoring and Programming the Home

As technology becomes ever more pervasive, the challenges of home automation are increasingly apparent. Seamless home control, home monitoring and home programming by the end user have yet to enter the mainstream. This could be attributed to the challenge of developing a fully autonomous and extensible home system that can support devices and technologies of differing protocols and functionalities. In order to offer programming facilities to the user, the underlying rule system must be fully independent, allowing support for current and future devices. Additional challenges arise from the need to detect and handle conflicts that may arise among user rules and yield undesirable results. Non-technical individuals typically struggle when faced with a programming task. It is therefore vital to encourage and ease the process of programming the home. This thesis presents Homer, a home system that has been developed to support three key features of a home system: control, monitoring and programming. Homer supports any third-party hardware or software service that can expose its functionality through Java and conform to the Homer interface. Stand-alone end user interfaces can be written by developers to offer any of Homer's functionality. Where policies (i.e. rules) for the home are concerned, Homer offers a fully independent policy system. The thesis presents a custom policy language, Homeric, that has been designed specifically for writing home rules. The Homer policy system detects overlaps and conflicts among rules using constraint satisfaction and the effect on environment variables. The thesis also introduces the notion of perspectives to ease user interactivity. These have been integrated into Homer to accommodate the range of ways in which a user may think about different aspects and features of their home. These perspectives include location, device type, time and people-oriented points of view. Design guidelines are also discussed to aid end user programming of the home. The work presented in this thesis demonstrates a system that supports control, monitoring and programming of the home. Developers can quickly and easily add functionality to the home through components. Conflicts can be detected amongst rules within the home. Finally, design guidelines and a prototype interface have been developed to allow both technically minded and non-technical people to program their home

A Goal-Directed and Policy-Based Approach to System Management

This thesis presents a domain-independent approach to dynamic system management using goals and policies. A goal is a general, high-level aim a system must continually work toward achieving. A policy is a statement of how a system should behave for a given set of detectable events and conditions. Combined, goals may be realised through the selection and execution of policies that contribute to their aims. In this manner, a system may be managed using a goal-directed, policy-based approach. The approach is a collection of related techniques and tools: a policy language and policy system, goal definition and refinement via policy selection, and conflict filtering among policies. Central to these themes, ontologies are used to model application domains, and incorporate domain knowledge within the system. The ACCENT policy system (Advanced Component Control Enhancing Network Technologies, http://www.cs.stir.ac.uk/accent) is used as a base for the approach, while goals and policies are defined using an extension of APPEL (Adaptable and Programmable Policy Environment and Language, http://www.cs.stir.ac.uk/appel). The approach differs from existing work in that it reduces system state, goals and policies to a numerical rather than logical form. This is more user-friendly as the goal domain may be expressed without any knowledge of formal methods. All developed techniques and tools are entirely domain-independent, allowing for reuse with other event-driven systems. The ability to express a system aim as a goal provides more powerful and proactive high-level management than was previously possible using policies alone. The approach is demonstrated and evaluated within this thesis for the domains of Internet telephony and sensor network/wind turbine management

Automated Creation and Provisioning of Value-added Telecommunication Services

The subject of this research is to find a continuous solution, which allows the description, the creation, the provisioning, and the execution of value-added telecommunication services. This work proposes a framework for an easy and timesaving creation and provisioning of value-added telecommunication services in Next Generation Networks. As research method, feasibility, comparative methods are used in this study. Criteria and requirements for service description, service creation, service execution, and service provisioning, are defined and existing technologies are compared with each other and evaluated regarding these criteria and requirements. Extensions to the selected technologies are proposed and possibilities to combine these technologies are researched. From the results of the previous steps, a framework is defined which offers a continuous solution for the description, creation, provisioning and execution of value-added services. In order to test the proof of concept, this framework is prototypically implemented. For a qualitative analysis of the research targets and the proof of concept, an example service is created and executed within the framework prototype. Furthermore, in order to examine the validity of the quantitative aims and objectives of this research work, a second example service is created, and its characteristics are measured and analysed. The result of this research is a novel continuous approach for the creation of value-added telecommunication services. This research introduces new possibilities for the service description, service creation, service provisioning, and service execution through an extension of the common telecommunication real-time execution environment JAIN SLEE. Value-added services are described by using the business process execution language BPEL. This language facilitates a simple and fast service design. The service can automatically be composed from pre-defined and pre-deployed components