A. Vashist, S. Mau, A. Poylisher, R. Chadha, Abhrajit Ghosh
{"title":"Leveraging social network for predicting demand and estimating available resources for communication network management","authors":"A. Vashist, S. Mau, A. Poylisher, R. Chadha, Abhrajit Ghosh","doi":"10.1109/INM.2011.5990558","DOIUrl":"https://doi.org/10.1109/INM.2011.5990558","url":null,"abstract":"Computer networks exist to provide a communication medium for social networks, and information from social networks can help in estimating their communication needs. Despite this, current network management ignores the information from social networks. On the other hand, due to their limited and fluctuating bandwidth, mobile ad hoc networks are inherently resource-constrained. As traffic load increases, we need to decide when and how to throttle the traffic to maximize user satisfaction while keeping the network operational. The state-of-the-art for making these decisions is based on network measurements and so employs a reactive approach to deteriorating network state by reducing the amount of traffic admitted into the network. However, a better approach is to avoid congestion before it occurs, by (a) monitoring the network for early onset signals of congestive phase transition, and (b) predicting future network traffic using user and application information from the overlaying social network. We use machine learning methods to predict the amount of traffic load that can be admitted without transitioning the network to a congestive phase and to predict the source and destination of near future traffic load. These two predictions when fed into an admission control component ensure better management of constrained network resources while maximizing the quality of user experience.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570926","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":"LTE relay node self-configuration","authors":"Péter Szilágyi, H. Sanneck","doi":"10.1109/INM.2011.5990493","DOIUrl":"https://doi.org/10.1109/INM.2011.5990493","url":null,"abstract":"Relays are mobile network base stations, which connect to the network via an in-band wireless backhaul link instead of using a dedicated wired or microwave backhaul link as regular base stations do. Connecting through a wireless backhaul raises difficulties when it comes to accessing the operator's Operation, Administration and Maintenance (OAM) System, since prior to the appearance of relay nodes, wireless access was reserved solely for user equipments and not used by network elements at all. However, after deploying a relay node, establishing an initial OAM access is essential in any kind of configuration, particularly when considering an automated configuration process known as self-configuration in principle. Self-configuration is gaining more importance for regular base stations as well as relays as automation of OAM processes is seen as a major contributor to reduce complexity and cost in network operation. In this paper, we introduce a conceptual separation of the initial configuration phase and the operational phase and present a detailed concept for automatic connectivity establishment to the OAM system. The transition from configuration to operational phase is also covered. The results have been verified by an event-driven packet based simulator and the proposed method has been accepted by the 3rd Generation Partnership Project (3GPP) as the baseline solution for configuring relays in the next generation radio access technology, Long Term Evolution (LTE).","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130090462","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":"An open architecture for distributed IP traffic analysis (DITA)","authors":"C. Morariu, B. Stiller","doi":"10.1109/INM.2011.5990528","DOIUrl":"https://doi.org/10.1109/INM.2011.5990528","url":null,"abstract":"This thesis investigated how performance of today's IP traffic metering and analysis applications can be improved by moving from a centralized, high-performance infrastructure, which executes these tasks, to distributed mechanisms, which combine available resources of multiple devices. The results achieved show that distributed IP traffic metering and analysis leverages bottleneck problems. The distributed IP traffic approach DITA does not solve all problems of handling such large amounts of data in very short time by itself, but proposes an orthogonal approach to existing solutions. DITA revelas that combining distributed IP traffic metering and analysis reaches better and higher performance sampling and aggregation mechanisms, which do provide a very flexible and the open solution to analyzing IP traffic in future high-speed networks. This has been achieved by the facts that all mechanisms designed for DITA — and their prototypical implementations — are based on standard protocols and open-source technologies. DITA determines the first approach to distributed IP traffic metering and analysis known today, which (a) addresses the different bottlenecks of traffic analysis in a generic way, and (b) is self-organizing, offering a scalable solution to regular traffic increases.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134382572","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 maturity model for tool landscapes of IT service providers","authors":"Christian Richter, T. Schaaf","doi":"10.1109/INM.2011.5990503","DOIUrl":"https://doi.org/10.1109/INM.2011.5990503","url":null,"abstract":"In the last years, several approaches and models for IT service management (ITSM) have emerged from research under the business-driven IT management (BDIM) paradigm as well as from industry initiatives. Effective and comprehensive tool support for ITSM is still one of the big remaining challenges. Nowadays, many IT service providers face the problem, that they are using dozens to hundreds of different tools to manage their infrastructure and services. Although such management tools are intended to increase the efficiency of ITSM processes, very complex and heterogeneous tool environments may have an inverse impact. This paper presents an approach to addresses this problem area. It aims at providing guidance in assessing and improving existing tool landscapes based on a global maturity model and specific capability models to be applied to the different topic areas in ITSM.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131402397","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 component-based orchestration management framework for multidomain SOA","authors":"F. Baude, V. L. Contes","doi":"10.1109/INM.2011.5990576","DOIUrl":"https://doi.org/10.1109/INM.2011.5990576","url":null,"abstract":"Business Process Outsourcing is nowadays common in companies. In particular, the distribution of such business processes encompasses the inclusion of external service providers in the overall process as well as the usage of external infrastructures like clouds. Both of these approaches lead to decentralization and outsourcing of a part of the global workflow, resulting in a complexified management of the global orchestration. As a matter of fact, the overall management data are decentralized among different domains and must, most of the time, be gathered manually. This paper presents a framework that eases multi-domain orchestration management. Our approach extracts, gathers and digests data from the decentralized processes in order to provide an unified and global view of a distributed orchestration.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"8 Suppl 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124353321","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":"Adaptive post-failure load balancing in fast reroute enabled IP networks","authors":"Ning Wang, Abubaker Fagear, G. Pavlou","doi":"10.1109/INM.2011.5990548","DOIUrl":"https://doi.org/10.1109/INM.2011.5990548","url":null,"abstract":"Fast reroute (FRR) techniques have been designed and standardised in recent years for supporting sub-50-millisecond failure recovery in operational ISP networks. On the other hand, if the provisioning of FRR protection paths does not take into account traffic engineering (TE) requirements, customer traffic may still get disrupted due to post-failure traffic congestion. Such a situation could be more severe in operational networks with highly dynamic traffic patterns. In this paper we propose a distributed technique that enables adaptive control of FRR protection paths against dynamic traffic conditions, resulting in self-optimisation in addition to the self-healing capability. Our approach is based on the Loop-free Alternates (LFA) mechanism that allows non-deterministic provisioning of protection paths. The idea is for repairing routers to periodically re-compute LFA alternative next-hops using a lightweight algorithm for achieving and maintaining optimised post-failure traffic distribution in dynamic network environments. Our experiments based on a real operational network topology and traffic traces across 24 hours have shown that such an approach is able to significantly enhance relevant network performance compared to both TE-agnostic and static TE-aware FRR solutions.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114772138","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}
R. Santos, Juliano Araujo Wickboldt, R. C. Lunardi, B. Dalmazo, L. Granville, L. Gaspary, C. Bartolini, M. Hickey
{"title":"A solution for identifying the root cause of problems in IT change management","authors":"R. Santos, Juliano Araujo Wickboldt, R. C. Lunardi, B. Dalmazo, L. Granville, L. Gaspary, C. Bartolini, M. Hickey","doi":"10.1109/INM.2011.5990563","DOIUrl":"https://doi.org/10.1109/INM.2011.5990563","url":null,"abstract":"The reuse of knowledge acquired by operators to diagnose failures in Information Technology (IT) infrastructures has potential to decrease the recurrence of failures and, consequently, reduce possible losses and maintenance costs. Nevertheless, existing solutions to support failure diagnosis lack of flexibility to adapt to a constantly changing IT environment. As a result, diagnostic is performed in an ad hoc and static fashion, which hampers the reuse of knowledge to solve similar failures affecting different elements of an IT infrastructure. To bridge this gap, in this paper we propose an extension of Common Information Model (CIM), supported by a conceptual solution for the identification of the root causes of problems, adaptable to changes in the target infrastructure and applicable to similar failures. Experiments carried out considering typical failures during the deployment of IT changes provide evidence about the efficacy of the proposed solution1.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116913814","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":"SLA-driven applicability analysis for patch management","authors":"Bo Yang, Sai Zeng, Naga Ayachitula, Rajeev Puri","doi":"10.1109/INM.2011.5990544","DOIUrl":"https://doi.org/10.1109/INM.2011.5990544","url":null,"abstract":"To strengthen patch management, organizations are required not only to focus on sole patch management on single server, machine or application servers, but also to consider other IT system management processes as well because patch management relies on them to be efficient. Processes such as inventory, system configurations, risk management, change management, system audit, and business cost on policy and SLA should be evaluated and enhanced together with patch management; appropriate applicability assessment of patch should be built in and coordinated with all these processes to make patch management a safe, reliable and efficient process to carry out its high profile tasks. This paper presents a patch management framework based on SLA-driven patch applicability analysis. It provides automatic patch applicability analysis and risk assessment for supporting business-impact analysis and logical control during patch process. Experimental results collected from the simulation on realistic business services case study show that SLA-driven patch applicability analysis based patch management outperforms traditional patch management.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116943830","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 declarative approach for global network security configuration verification and evaluation","authors":"M. Rahman, E. Al-Shaer","doi":"10.1109/INM.2011.5990556","DOIUrl":"https://doi.org/10.1109/INM.2011.5990556","url":null,"abstract":"With the increasing number of security devices and rules in the network, the complexity of detecting and tracing network security configuration errors become a very challenging task. This in turn increases the potential of security breaches due to rule conflicts, requirement violations or lack of security hardening. Most of the existing tools are either limited in scope as they do not offer a global analysis of different network devices or hard to comprehensively use because these tools are not declarative. Declarative logic programming can readily express network configurations and security requirements for verification analysis. In this paper, we use Prolog to model the entire network security configurations including topology, routing, firewall and IPSec. This is implemented in a tool called ConfigAnalyzer, which was also evaluated with large network and policy sizes. The tool allows for verifying reachability and security properties in flexible and expressive manner. It also allows for evaluating security configurations in terms of accessibilities credentials and rules.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000258","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}
C. R. P. D. Santos, R. S. Bezerra, L. Granville, L. Bertholdo, Winnie Cheng, Nikos Anerousis
{"title":"A data confidentiality architecture for developing management mashups","authors":"C. R. P. D. Santos, R. S. Bezerra, L. Granville, L. Bertholdo, Winnie Cheng, Nikos Anerousis","doi":"10.1109/INM.2011.5990673","DOIUrl":"https://doi.org/10.1109/INM.2011.5990673","url":null,"abstract":"Mashups are powerful applications created from accessing and composing multiple and distributed information sources. Their ease-of-use and modularity allow users at any skill level to construct, share and integrate their own applications. However, data security concerns remain a hindering factor in its widespread adoption, in particular, for network management. In this paper, we propose a novel development methodology and system architecture called Maestro that allows developers to express their data privacy concerns and enforce policies during mashup executions. We evaluated Maestro by building two mashup applications for managing live networks and by running performance tests that show that our runtime has negligible overhead.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125867450","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}