{"title":"Planning-based configuration and management of distributed systems","authors":"Kyriaki Levanti, A. Ranganathan","doi":"10.1109/INM.2009.5188788","DOIUrl":"https://doi.org/10.1109/INM.2009.5188788","url":null,"abstract":"The configuration and runtime management of distributed systems is often complex due to the presence of a large number of configuration options and dependencies between interacting sub-systems. Inexperienced users usually choose default configurations because they are not aware of the possible configurations and/or their effect on the systems' operation. In doing so, they are unable to take advantage of the potentially wide range of system capabilities. Furthermore, managing inter-dependent sub-systems frequently involves performing a set of actions to get the overall system to the desired final state. In this paper, we propose a new approach for configuring and managing distributed systems based on AI planning. We use a goal-driven, tag-based user interaction paradigm to shield users from the complexities of configuring and managing systems. The key idea behind our approach is to package different configuration options and system management actions into reusable modules that can be automatically composed into workflows based on the user's goals. It also allows capturing the inter-dependencies between different configuration options, management actions and system states. We evaluate our approach in a case study involving three inter-dependent sub-systems. Our initial experiences indicate that this planning-based approach holds great promise in simplifying configuration and management tasks.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"47 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":"125966469","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":"PCE-based hierarchical segment restoration","authors":"Mohamed Abouelela, M. El-Darieby","doi":"10.1109/INM.2009.5188806","DOIUrl":"https://doi.org/10.1109/INM.2009.5188806","url":null,"abstract":"Providing network QoS involves, among other things, ensuring network survivability in spite of network faults. Fault recovery mechanisms should reduce recovery time, especially for real-time and mission-critical applications while guaranteeing QoS requirements, in terms of bandwidth and delay constraints and maximizing network resources utilization. In this paper, we propose a scalable recovery mechanism based on hierarchical networks. The proposed mechanism is based on inter-domain segmental restoration and is performed by a recovery module (RM) introduced for each domain of the hierarchy. The RM cooperates with Path Computation Element (PCE) to perform recovery while maintaining QoS. Segmental restoration ensures faster recovery time by trying to recover failed paths as close as possible to where the fault occurred. The recovery mechanism aggregates fault notification messages to reduce the size of the signaling storm. In addition, the recovery mechanism ranks failed paths to reduce recovery time for high-priority traffic. We present simulation results conducted for different network sizes and hierarchy structures. Two metrics were considered: recovery time and signaling storm size. A significant decrease in the recovery time with increasing number of hierarchical levels for the same network size is observed. The larger the number of hierarchy levels, the smaller the number of network nodes in each domain and, generally, the faster the routing computations and routing tables search times. In addition, the recovery mechanism results in reducing recovery time for high priority traffic by nearly 90% over that of lower priority traffic. However, increasing the number of hierarchical levels results in a linear increase in signaling storm size.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"26 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":"127658964","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":"Multi-tenant solution for IT service management: A quantitative study of benefits","authors":"L. Shwartz, Y. Diao, G. Grabarnik","doi":"10.1109/INM.2009.5188879","DOIUrl":"https://doi.org/10.1109/INM.2009.5188879","url":null,"abstract":"The very competitive business climate dictates efficient and cost effective delivery and support of IT services. Compounded by complexity of IT environments and criticality of IT to business success, IT service providers seek multi-tenant solutions to reduce operational cost and improve service quality. In this paper we consider a multi-tenant solution for IT service management and examine its critical aspects for realizing business benefits. We conduct a quantitative study of its benefits using a complexity based value assessment methodology. By regarding complexity as a substitute for potential labor cost, we estimate the business value of the multi-tenant solution before its actual deployment.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"10 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":"123935150","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}
F. Fusco, Felipe Huici, L. Deri, S. Niccolini, Thilo Ewald
{"title":"Enabling high-speed and extensible real-time communications monitoring","authors":"F. Fusco, Felipe Huici, L. Deri, S. Niccolini, Thilo Ewald","doi":"10.1109/INM.2009.5188834","DOIUrl":"https://doi.org/10.1109/INM.2009.5188834","url":null,"abstract":"The use of the Internet as a medium for real-time communications has grown significantly over the past few years. However, the best-effort model of this network is not particularly well-suited to the demands of users who are familiar with the reliability, quality and security of the Public Switched Telephone Network. If the growth is to continue, monitoring and real time analysis of communication data will be needed in order to ensure good call quality, and should degradation occur, to take corrective action. Writing this type of monitoring application is difficult and time consuming: VoIP traffic not only tends to use dynamic ports, but its real-time nature, along with the fact that its packets tend to be small, impose non-trivial performance requirements. In this paper we present RTC-Mon, the Real-Time Communications Monitoring framework, which provides an extensible platform for the quick development of high-speed, real-time monitoring applications. While the focus is on VoIP traffic, the framework is general and is capable of monitoring any type of real-time communications traffic. We present testbed performance results for the various components of RTC-Mon, showing that it can monitor a large number of concurrent flows without losing packets. In addition, we implemented a proof-of-concept application that can not only track statistics about a large number of calls and their users, but that consists of only 800 lines of code, showing that the framework is efficient and that it also significantly reduces development time.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"17 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":"124150079","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":"Performance of distributed reservation control in wavelength-routed all-optical WDM networks with Adaptive Alternate Routing","authors":"Iyad A. Katib, D. Medhi","doi":"10.1109/INM.2009.5188855","DOIUrl":"https://doi.org/10.1109/INM.2009.5188855","url":null,"abstract":"In this work, we consider the performance benefits of distribution reservation control schemes in partially-connected wavelength-routed all-optical WDM networks. In particular, we propose a new distributed reservation control scheme designed to work for general topology wavelength-routed WDM networks. In this new scheme, capacity reservation is invoked by always using the first shortest path if the direct route does not exist between all node (demand) pairs. Through our study, we show that our proposed scheme in the presence of distributed adaptive routing is much more fair on pairwise blocking than the conventional reservation method in general topology wavelength-routed WDM networks, especially in the presence of wavelength converters and overload situations.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"77 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":"125531713","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":"Rate-based SIP flow management for SLA satisfaction","authors":"Jing Sun, Ruixiong Tian, Jinfeng Hu, Bo Yang","doi":"10.1109/INM.2009.5188798","DOIUrl":"https://doi.org/10.1109/INM.2009.5188798","url":null,"abstract":"SIP flow management should respect the specific characteristics of SIP protocol applied in multimedia or telecom services for meeting stringent quality of service (QoS) requirement. The specific characteristics include explicit session structure for correlating a series of SIP messages, stringent response time required by real-time applications, extra overhead imposed by SIP message retransmission, service differentiation for meeting different business demands. We designed a front-end flow management (FEFM) system for SIP application servers to address these issues. We present the overall architecture of FEFM, the functionalities of primary modules in FEFM and the evaluation results in this paper. The evaluation results show that FEFM has the ability to achieve the tradeoffs among overload protection, QoS assurance and service differentiation.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"1 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":"125846510","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":"A user-centric network management framework for high-density Wireless LANs","authors":"Yanfeng Zhu, Qian Ma, C. Bisdikian, Chun Ying","doi":"10.1109/INM.2009.5188813","DOIUrl":"https://doi.org/10.1109/INM.2009.5188813","url":null,"abstract":"With the ever increasing deployment density of Wireless Local Area Networks (WLANs), more and more access points (APs) are deployed within users' vicinity. The effective management of these APs to optimize users' eventual throughput becomes an important challenge in the high-density deployment environment. In this paper, we propose a user-centric network management framework to optimize the throughput of users operating in the high-density WLANs taking into consideration the network conditions sensed by users and their access priorities. The proposed framework is built around an information pipeline that facilitates the sharing of the information needed for optimal management of communication resources. Theoretical analysis and extensive simulations are presented on two major management activities: AP association and channel selection, and demonstrate that the proposed user-centric network management framework significantly outperforms traditional network management framework in the high-density deployment environment.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"37 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":"127915243","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":"Experiences in using MUWS for scalable distributed monitoring","authors":"Aimilios Chourmouziadis, O. Gonzalez, G. Pavlou","doi":"10.1109/INM.2009.5188862","DOIUrl":"https://doi.org/10.1109/INM.2009.5188862","url":null,"abstract":"Efficient Web Services (WS) based network monitoring of managed devices is a difficult task due to the relatively big overhead WS impose. In the past we proposed mechanisms to perform distributed monitoring efficiently, minimizing the relevant overhead. Standardization of WS operations is also important in order to achieve interoperability. The WS Resource Framework (WSRF) tries to standardize the messages exchanged with resources representing the state of a device. Adopting WSRF's concepts, the Management Using Web Services (MUWS) standard aims to support device management in an interoperable manner. In this paper we propose methods to use the mechanisms introduced in our previous work combined with MUWS in order to establish the means to retrieve management information efficiently and at the same time achieve interoperability. We also present our experiences in using custom as well as standardized solutions for monitoring devices that range from small to large resource-capable systems. We describe the motivations for this research and present ideas on techniques that need to be adopted for WS based monitoring based on what we have learned in the process.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"47 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":"125728538","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":"Robust and scalable trust management for collaborative intrusion detection","authors":"Carol J. Fung, Jie Zhang, I. Aib, R. Boutaba","doi":"10.1109/INM.2009.5188784","DOIUrl":"https://doi.org/10.1109/INM.2009.5188784","url":null,"abstract":"The accuracy of detecting intrusions within an Intrusion Detection Network (IDN) depends on the efficiency of collaboration between the peer Intrusion Detection Systems (IDSes) as well as the security itself of the IDN against insider threats. In this paper, we study host-based IDNs and introduce a Dirichlet-based model to measure the level of trustworthiness among peer IDSes according to their mutual experience. The model has strong scalability properties and is robust against common insider threats, such as a compromised or malfunctioning peer. We evaluate our system based on a simulated collaborative host-based IDS network. The experimental results demonstrate the improved robustness, efficiency, and scalability of our system in detecting intrusions in comparison with existing models.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"53 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":"125942457","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":"Managing responsiveness of virtual desktops using passive monitoring","authors":"Rajdeep Bhowmik, Andrzej Kochut, K. Beaty","doi":"10.1109/INM.2009.5188831","DOIUrl":"https://doi.org/10.1109/INM.2009.5188831","url":null,"abstract":"Desktop virtualization is a new computing approach to application delivery and management. It leverages OS virtualization and remoting protocols to provide users with remote access to virtual machines running in a centralized data center. It promises significant benefits in terms of improved data security, reduced management complexity, and more efficient and flexible resource usage. However, it brings a lot of management challenges typical for centralized systems, with performance and quality of service management being one of the most important. This paper proposes a management algorithm suitable for efficient resource allocation in virtualized desktop environments and takes application performance QoS features into consideration. It proposes a novel, non-intrusive method for application and remoting protocol agnostic desktop responsiveness monitoring. Moreover, it is based on studies of desktop workload usage which enabled us to discover and leverage workload patterns that can lead to increased efficiency both in terms of desktop responsiveness and resource usage. We have prototyped the system and discuss several case studies validating the approach and illustrating the most important features of the solution.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"25 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":"127599079","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}