University of Stirling    STORRE: Stirling Online Research Repository University Circle Images   Research Led, Student Focused  
 

STORRE >
School of Natural Sciences >
Computing Science and Mathematics >
Computing Science and Mathematics Conference Papers and Proceedings >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/3218

Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Peer Review Status: Refereed
Author(s): Kolberg, Mario
Buford, John
Dhara, Kishore
Wu, Xiaotao
Krishnaswamy, Venky
Contact Email: mko@cs.stir.ac.uk
Title: Managing Distributed Feature Interactions in Enterprise SIP Application Servers
Citation: Kolberg M, Buford J, Dhara K, Wu X & Krishnaswamy V (2009) Managing Distributed Feature Interactions in Enterprise SIP Application Servers In: IEEE International Conference on Communications, 2009. ICC '09, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). IEEE International Conference on Communication (ICC), 2009. ICC '09, pp. 1-6.
Issue Date: Jun-2009
Series/Report no.: IEEE International Conference on Communications (ICC)
Conference Name: IEEE International Conference on Communication (ICC), 2009. ICC '09
Abstract: 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.
Type: Conference Paper
Status: Author Version
Rights: Published in IEEE International Conference on Communications, 2009. ICC '09 by Institute of Electrical and Electronics Engineers (IEEE).; © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
URI: http://hdl.handle.net/1893/3218
Affiliation: Computing Science - CSM Dept
Avaya Labs Research
Avaya Labs Research
Avaya Labs Research
Avaya Labs Research

Files in This Item:

File Description SizeFormat
icc2009-fi.pdf226.41 kBAdobe PDFView/Open


This item is protected by original copyright

Recommend this item

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.

 

Valid XHTML 1.0! Repository Service Operated by Information Services, University of Stirling
Powered by DSpace Software Copyright © 2002-2010  Duraspace - Feedback