{"title":"Real-time root cause analysis in OSS for a multilayer and multi-domain network using a hierarchical circuit model and scanning algorithm","authors":"M. Miyazawa, T. Otani","doi":"10.1109/INM.2009.5188802","DOIUrl":"https://doi.org/10.1109/INM.2009.5188802","url":null,"abstract":"One of the major issues for telecom operators today is how to rapidly identify the cause of failure and affected services within a multi-layer and multi-domain network to achieve high-quality service on an end-to-end basis. To assess this issue, this paper describes a real-time root cause analysis mechanism, which can pinpoint an accurate root cause and identify the influence on services. We investigated an interworking mechanism; based on a web service interface between an inventory and fault management systems and developed prototypes of them as part of an operation support system (OSS), which is capable of managing not only a core network and a metro ring network, but also a customer network. By introducing a hierarchical circuit model in the inventory management system and the proposed scanning algorithm over multiple layers and domains implemented in the fault management system, our developed root cause analysis was successfully verified using the testbed network environment; indicating relatively fast and scalable operation.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Haiyang Qian, Chandra Sekhar Surapaneni, S. Dispensa, D. Medhi
{"title":"Service management architecture and system capacity design for PhoneFactor™—A two-factor authentication service","authors":"Haiyang Qian, Chandra Sekhar Surapaneni, S. Dispensa, D. Medhi","doi":"10.1109/INM.2009.5188789","DOIUrl":"https://doi.org/10.1109/INM.2009.5188789","url":null,"abstract":"PhoneFactor™ is a token-less two-factor authentication service for user remote logons [13]. This allows users of an organization to be authenticated through an automated phone call to the user's phone before access is allowed. In this paper, we present the service management architecture of PhoneFactor that depends on both the Internet and the public switched telephone network (PSTN), and we identify two key quality of service parameters, the system response time and call blocking probability, where the latter can impact the former. Furthermore, through traffic analysis of the measurement data from the deployed PhoneFactor service, we found that the inter-arrival time of requests follows the Generalized Pareto distribution while the system response time and the call duration (for the authentication part through the phone call) follow the log-normal distribution. Given these distributions, we then present system capacity design methodologies by comparing them to known results for systems that are analytically derivable.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Problem classification method to enhance the ITIL incident and problem","authors":"Yang Song, A. Sailer, Hidayatullah Shaikh","doi":"10.1109/INM.2009.5188825","DOIUrl":"https://doi.org/10.1109/INM.2009.5188825","url":null,"abstract":"Problem determination and resolution PDR is the process of detecting anomalies in a monitored system, locating the problems responsible for the issue, determining the root cause and fixing the cause of the problem. The cost of PDR represents a substantial part of operational costs, and faster, more effective PDR can contribute to a substantial reduction in system administration costs. In this paper, we propose to automate the process of PDR by leveraging machine learning methods. The main focus is to effectively categorize the problem a user experiences by recognizing the problem specificity leveraging all available training data such like the performance data and the logs data. Specifically, we transform the structure of the problem into a hierarchy which can be determined by existing taxonomy in advance. We then propose an efficient hierarchical incremental learning algorithm which is capable of adjusting its internal local classifier parameters in real-time. Comparing to the traditional batch learning algorithms, this online learning framework can significantly decrease the computational complexity of the training process by learning from new instances on an incremental fashion. In the same time this reduces the amount of memory required to store the training instances. We demonstrate the efficiency of our approach by learning hierarchical problem patterns for several issues occurring in distributed web applications. Experimental results show that our approach substantially outperforms previous methods.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116610747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Management of SOA based NGN service exposure, service discovery and service composition","authors":"N. Blum, T. Magedanz, F. Schreiner","doi":"10.1109/INM.2009.5188845","DOIUrl":"https://doi.org/10.1109/INM.2009.5188845","url":null,"abstract":"Next generation telecommunication network operators securely opening up their network capabilities and services to third party service providers require flexible service delivery platforms. Policy based service exposure, service discovery and service composition mechanisms are required to offer chargeable services and service building blocks to external entities in a customizable way. Based on research and developments conducted while prototyping solutions for the Open SOA Telco Playground, a unique IMS based NGN testbed for realizing SOA based NGN service delivery platforms, this work proposes the eXtended POlicy based, Semantically enabled sErvice bRoker (XPOSER). XPOSER provides novel NGN service exposition mechanisms. It enables intent-based NGN service discovery and allows for user-centric, automated service composition. Utilizing SOA based Operation Support Systems this work explains requirements and solutions for dynamically managing NGN service compositions by tightly linking service creation, service fulfillment and service assurance mechanisms already at service composition time.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117017955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Weverton Cordeiro, Guilherme Sperb Machado, F. Andreis, Juliano Araujo Wickboldt, R. C. Lunardi, A. O. D. Santos, C. Both, L. Gaspary, L. Granville, David Trastour, C. Bartolini
{"title":"CHANGEMINER: A solution for discovering IT change templates from past execution traces","authors":"Weverton Cordeiro, Guilherme Sperb Machado, F. Andreis, Juliano Araujo Wickboldt, R. C. Lunardi, A. O. D. Santos, C. Both, L. Gaspary, L. Granville, David Trastour, C. Bartolini","doi":"10.1109/INM.2009.5188792","DOIUrl":"https://doi.org/10.1109/INM.2009.5188792","url":null,"abstract":"The main goal of change management is to ensure that standardized methods and procedures are used for the efficient and prompt handling of changes in IT systems, in order to minimize change-related incidents and service-delivery disruption. To meet this goal, it is of paramount importance reusing the experience acquired from previous changes in the design of subsequent ones. Two distinct approaches may be usefully combined to this end. In a top-down approach, IT operators may manually design change templates based on the knowledge owned/acquired in the past. Considering a reverse, bottom-up perspective, these templates could be discovered from past execution traces gathered from IT provisioning tools. While the former has been satisfactorily explored in previous investigations, the latter - despite its undeniable potential to result in accurate templates in a reduced time scale - has not been subject of research, as far as the authors are aware of, by the service operations and management community. To fill in this gap, this paper proposes a solution, inspired on process mining techniques, to discover change templates from past changes. The solution is analyzed through a prototypical implementation of a change template miner subsystem called CHANGEMINER, and a set of experiments based on a real-life scenario.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Tursunova, T. Son, Bong-Kyun Lee, Eunyoung Cho, Youhyeon Jeong, Young-Tak Kim
{"title":"Enhanced cognitive resource management for QoS-guaranteed service provisioning in home/office network","authors":"S. Tursunova, T. Son, Bong-Kyun Lee, Eunyoung Cho, Youhyeon Jeong, Young-Tak Kim","doi":"10.1109/INM.2009.5188853","DOIUrl":"https://doi.org/10.1109/INM.2009.5188853","url":null,"abstract":"In this paper, we propose an enhanced cognitive resource management for QoS-aware service provisioning in wired and wireless home/office network. We enhance QoS-aware customer network management (Q-CNM) system. The Q-CNM controls overall management process in home/office network, gathers network information, and processes incoming requests through QoS-aware resource allocation with connection admission control (CAC) function. Especially the cognitive management process at the Q-CNM provides load redistribution, optimized resource utilization for QoS-guaranteed differentiated service provisioning based on obtained knowledge about network. The detailed analysis of QoS-aware resource allocation and cognitive management process at the Q-CNM are explained. The network performance and QoS parameters are analyzed based on experimental implementation of the proposed management scheme in a real testbed environment and ns-2 network simulator.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115399243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computing histograms of local variables for real-time monitoring using aggregation trees","authors":"D. Jurca, R. Stadler","doi":"10.1109/INM.2009.5188837","DOIUrl":"https://doi.org/10.1109/INM.2009.5188837","url":null,"abstract":"In this paper we present a protocol for the continuous monitoring of a local network state variable. Our aim is to provide a management station with the value distribution of the local variables across the network, by means of partial histogram aggregation, with minimum protocol overhead. Our protocol is decentralized and asynchronous to achieve robustness and scalability, and it executes on an overlay interconnecting management processes in network devices. On this overlay, the protocol maintains a spanning tree and updates the histogram of the network state variables through incremental aggregation. The protocol allows to control the trade-off between protocol overhead and a global accuracy objective. This functionality is implemented by a dynamic configuration of local error filters that control whether an update is sent towards the management station or not. We evaluate our protocol by means of simulations. Our results demonstrate the controllability of our method in a wide selection of scenarios, and the scalability of our protocol for large-scale networks.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysing Joost peer to peer IPTV protocol","authors":"Mehdi Nafaa, N. Agoulmine","doi":"10.1109/INM.2009.5188824","DOIUrl":"https://doi.org/10.1109/INM.2009.5188824","url":null,"abstract":"After Kazaa and Skype, Niklas Zennstrom and Janus Friis released Joost: A peer to peer TV client. Joost claims that it can work seamlessly and has better video quality than existing p2p video streaming applications and even approaching number of traditional TV broadcasted channels. In this paper, we present an experimental analysis of the Joost p2p television protocol. After months of packet monitoring, we have gathered valuable data traffic that is analysed. We show the results of Joost insights and describe its key components and networking model. Our objective is to analyse its management protocol, considering it like a closed-box, without any a-priori, knowledge on its internal implementation. We focused also on the peer life in the Joost network.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Monitoring probabilistic SLAs in Web service orchestrations","authors":"Sidney Rosario, A. Benveniste, C. Jard","doi":"10.1109/INM.2009.5188851","DOIUrl":"https://doi.org/10.1109/INM.2009.5188851","url":null,"abstract":"Web services are software applications that are published over the Web, and can be searched and invoked by other programs. New Web services can be formed by composing elementary services, such composite services are called Web service orchestrations. Quality of Service (QoS) issues for Web service orchestrations deeply differ from corresponding QoS issues in network management. In an open world of Web services, service level agreements (SLAs) play an important role. They are contracts defining the obligations and rights between the provider of a Web service and a client with respect to the services' function and quality.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130558511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ede Silva, A. Santin, Edgard Jamhour, C. Maziero, Emir Toktar
{"title":"Applying quorum role in network management","authors":"Ede Silva, A. Santin, Edgard Jamhour, C. Maziero, Emir Toktar","doi":"10.1109/INM.2009.5188866","DOIUrl":"https://doi.org/10.1109/INM.2009.5188866","url":null,"abstract":"This work presents a proposal for extending the Role-Based Access control (RBAC) model to support activities that demand runtime mutability in their authorization attributes. Such activities cannot be subdivided in a set of subtasks executed sequentially neither can be accomplished by a single role. The approach presented allows the creation of quorum roles, which can only be activated in a session with the endorsement of a quorum of other roles. A prototype illustrates the application of our proposal in a network management scenario. In the illustrative scenario, a previously defined set of roles, by endorsement, activates a quorum role to perform a management task without the participation of the network administrator role.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131505034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}