Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188844
B. Martini, F. Baroncelli, V. Martini, K. Torkman, P. Castoldi
Within the ITU-T Next Generation Network (NGN) architecture, the Resource Admission Control Function (RACF) has been designated to perform the application-driven QoS control across both access and core networks. However, an actual RACF implementation acting on MPLS metro-core networks does not exist since RACF lacks of the capability to configure QoS policies on MPLS network nodes. This prevents an effective end-to-end QoS control in a metro-core scenario on a per-application basis. This work presents a specific implementation of RACF operating over an MPLS network domain. This RACF implementation is applied to a testbed where a Video Client application requests a real-time video data transfer from a Video Server through an MPLS network. The admission control is performed upon service request based on video requirements and network resource availability. The differentiated traffic treatment on per-flow basis is realized through setting of MPLS DiffServ-aware Traffic Engineering (TE) capabilities using the NETCONF protocol. Effective traffic differentiation is achieved in a multi-service network scenario and thus it validates NETCONF as candidate protocol for policy provisioning in MPLS networks.
{"title":"ITU-T RACF implementation for application-driven QoS control in MPLS networks","authors":"B. Martini, F. Baroncelli, V. Martini, K. Torkman, P. Castoldi","doi":"10.1109/INM.2009.5188844","DOIUrl":"https://doi.org/10.1109/INM.2009.5188844","url":null,"abstract":"Within the ITU-T Next Generation Network (NGN) architecture, the Resource Admission Control Function (RACF) has been designated to perform the application-driven QoS control across both access and core networks. However, an actual RACF implementation acting on MPLS metro-core networks does not exist since RACF lacks of the capability to configure QoS policies on MPLS network nodes. This prevents an effective end-to-end QoS control in a metro-core scenario on a per-application basis. This work presents a specific implementation of RACF operating over an MPLS network domain. This RACF implementation is applied to a testbed where a Video Client application requests a real-time video data transfer from a Video Server through an MPLS network. The admission control is performed upon service request based on video requirements and network resource availability. The differentiated traffic treatment on per-flow basis is realized through setting of MPLS DiffServ-aware Traffic Engineering (TE) capabilities using the NETCONF protocol. Effective traffic differentiation is achieved in a multi-service network scenario and thus it validates NETCONF as candidate protocol for policy provisioning in MPLS networks.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"201 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":"115893008","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188815
Wang-Cheol Song, S. Rehman, H. Lutfiyya
Policy-based Network Management (PBNM) in Mobile Ad-hoc Networks (MANETs) requires additional reliable and efficient mechanisms over PBNM in wired networks. Thus, it is important that the management system in MANETs should cluster the moving nodes and manage their movements in an effective manner. In the paper, a scalable framework is proposed for the policy-based management in ad hoc networks in which we use k-hop clustering with extended COPS-PR. And, we discuss methods for Policy Enforcement Points (PEPs) to discover autonomously the Policy Decision Point (PDP) and set the management area in the framework. Also, three regions are suggested to effectively maintain PDP/PEP clusters in the PBNM system. Finally, we discuss the results achieved through simulations.
{"title":"A scalable PBNM framework for MANET management","authors":"Wang-Cheol Song, S. Rehman, H. Lutfiyya","doi":"10.1109/INM.2009.5188815","DOIUrl":"https://doi.org/10.1109/INM.2009.5188815","url":null,"abstract":"Policy-based Network Management (PBNM) in Mobile Ad-hoc Networks (MANETs) requires additional reliable and efficient mechanisms over PBNM in wired networks. Thus, it is important that the management system in MANETs should cluster the moving nodes and manage their movements in an effective manner. In the paper, a scalable framework is proposed for the policy-based management in ad hoc networks in which we use k-hop clustering with extended COPS-PR. And, we discuss methods for Policy Enforcement Points (PEPs) to discover autonomously the Policy Decision Point (PDP) and set the management area in the framework. Also, three regions are suggested to effectively maintain PDP/PEP clusters in the PBNM system. Finally, we discuss the results achieved through simulations.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"309 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":"115940360","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188874
G. Alptekin, A. Bener
The traditional static spectrum access approach, which assigns a fixed portion of the spectrum to a specific license holder for exclusive use, is unable to manage the spectrum efficiently any longer. In an effort to improve the efficiency of its usage, alternative spectrum allocation scenarios are being proposed. One of these technologies is the Dynamic Spectrum Access which enables wireless users to share a wide range of available spectrum in an opportunistic manner. In this paper, we study an architecture for a competitive spectrum exchange marketplace, a theoretic base, and the empirical work for spectrum price formation. The competitive spectrum exchange marketplace architecture considers short term sub-lease of unutilized spectrum bands to different service providers. Our proposed pricing model applies game theory as its mathematical base. The Nash equilibrium point tells the spectrum holders the ideal price values where profit is maximized at the highest level of customer satisfaction. Our empirical results prove that the service providers' demand depends on the price and QoS of that band as well as the price and QoS offering of its competitors.
{"title":"An efficient spectrum management mechanism for cognitive radio networks","authors":"G. Alptekin, A. Bener","doi":"10.1109/INM.2009.5188874","DOIUrl":"https://doi.org/10.1109/INM.2009.5188874","url":null,"abstract":"The traditional static spectrum access approach, which assigns a fixed portion of the spectrum to a specific license holder for exclusive use, is unable to manage the spectrum efficiently any longer. In an effort to improve the efficiency of its usage, alternative spectrum allocation scenarios are being proposed. One of these technologies is the Dynamic Spectrum Access which enables wireless users to share a wide range of available spectrum in an opportunistic manner. In this paper, we study an architecture for a competitive spectrum exchange marketplace, a theoretic base, and the empirical work for spectrum price formation. The competitive spectrum exchange marketplace architecture considers short term sub-lease of unutilized spectrum bands to different service providers. Our proposed pricing model applies game theory as its mathematical base. The Nash equilibrium point tells the spectrum holders the ideal price values where profit is maximized at the highest level of customer satisfaction. Our empirical results prove that the service providers' demand depends on the price and QoS of that band as well as the price and QoS offering of its competitors.","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":"114939395","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188793
Kazuya Odagiri, Rihito Yaegashi, M. Tadauchi, N. Ishii
As the work for managing a whole network effectively without a limited purpose, there is the work of PBNM (Policy-based network management). PBNM has two structural problems such as communication concentration from many clients to a communication control mechanism called PEP (Policy Enhancement Point) and the necessity of the network system updating at the time of introducing PBNM into LAN. Moreover, user support problems in campus-like computer networks such as trouble user support at updating a client's setups and coping with annoying communication can not be improved by PBNM. To improve these problems, we show a next generation PBNM which overcomes theses problems and has the function which does not exist in existing PBNM, and called it DACS (Destination Addressing Control System) Scheme. By DACS Scheme, communication concentration from many clients to PEP is solved, and system updating becomes unnecessary. Moreover, user support at updating the client's setups and coping with annoying communication by DACS Scheme becomes very effective.
{"title":"DACS scheme as next generation Policy-based network management scheme","authors":"Kazuya Odagiri, Rihito Yaegashi, M. Tadauchi, N. Ishii","doi":"10.1109/INM.2009.5188793","DOIUrl":"https://doi.org/10.1109/INM.2009.5188793","url":null,"abstract":"As the work for managing a whole network effectively without a limited purpose, there is the work of PBNM (Policy-based network management). PBNM has two structural problems such as communication concentration from many clients to a communication control mechanism called PEP (Policy Enhancement Point) and the necessity of the network system updating at the time of introducing PBNM into LAN. Moreover, user support problems in campus-like computer networks such as trouble user support at updating a client's setups and coping with annoying communication can not be improved by PBNM. To improve these problems, we show a next generation PBNM which overcomes theses problems and has the function which does not exist in existing PBNM, and called it DACS (Destination Addressing Control System) Scheme. By DACS Scheme, communication concentration from many clients to PEP is solved, and system updating becomes unnecessary. Moreover, user support at updating the client's setups and coping with annoying communication by DACS Scheme becomes very effective.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"13 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":"116848737","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188884
A. Prieto, R. Stadler
The focus of this thesis is continuous real-time monitoring, which is essential for the realization of adaptive management systems in large-scale dynamic environments. Real-time monitoring provides the necessary input to the decision-making process of network management. We have developed, implemented, and evaluated a design for real-time continuous monitoring of global metrics with performance objectives, such as monitoring overhead and estimation accuracy. Global metrics describe the state of the system as a whole, in contrast to local metrics, such as device counters or local protocol states, which capture the state of a local entity. Global metrics are computed from local metrics using aggregation functions, such as SUM, AVERAGE and MAX. A key part in the design is a model for the distributed monitoring process that relates performance metrics to parameters that tune the behavior of a monitoring protocol. The model has been instrumental in designing a monitoring protocol that is controllable and achieves given performance objectives. Our design has proved to be effective in meeting performance objectives, efficient, adaptive to changes in the networking conditions, controllable along different performance dimensions, and scalable. We have implemented a prototype on a testbed of commercial routers, which proves the feasibility of the design, and, more generally, the feasibility of effective and efficient real-time monitoring in large network environments.
{"title":"Adaptive real-time monitoring for large-scale networked systems","authors":"A. Prieto, R. Stadler","doi":"10.1109/INM.2009.5188884","DOIUrl":"https://doi.org/10.1109/INM.2009.5188884","url":null,"abstract":"The focus of this thesis is continuous real-time monitoring, which is essential for the realization of adaptive management systems in large-scale dynamic environments. Real-time monitoring provides the necessary input to the decision-making process of network management. We have developed, implemented, and evaluated a design for real-time continuous monitoring of global metrics with performance objectives, such as monitoring overhead and estimation accuracy. Global metrics describe the state of the system as a whole, in contrast to local metrics, such as device counters or local protocol states, which capture the state of a local entity. Global metrics are computed from local metrics using aggregation functions, such as SUM, AVERAGE and MAX. A key part in the design is a model for the distributed monitoring process that relates performance metrics to parameters that tune the behavior of a monitoring protocol. The model has been instrumental in designing a monitoring protocol that is controllable and achieves given performance objectives. Our design has proved to be effective in meeting performance objectives, efficient, adaptive to changes in the networking conditions, controllable along different performance dimensions, and scalable. We have implemented a prototype on a testbed of commercial routers, which proves the feasibility of the design, and, more generally, the feasibility of effective and efficient real-time monitoring in large network environments.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"57 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":"130161015","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188871
Jin Heo, Xiaoyun Zhu, Pradeep Padala, Zhikui Wang
The newly emergent cloud computing environments host hundreds to thousands of services on a shared resource pool. The sharing is enhanced by virtualization technologies allowing multiple services to run in different virtual machines (VMs) on a single physical node. Resource overbooking allows more services with time-varying demands to be consolidated reducing operational costs. In the past, researchers have studied dynamic control mechanisms for allocating CPU to virtual machines, when CPU is overbooked with respect to the sum of the peak demands from all the VMs. However, runtime re-allocation of memory among multiple VMs has not been widely studied, except on VMware platforms. In this paper, we present a case study where feedback control is used for dynamic memory allocation to Xen virtual machines in a consolidated environment. We illustrate how memory behaves differently from CPU in terms of its relationship to application-level performance, such as response times. We have built a prototype of a joint resource control system for allocating both CPU and memory resources to co-located VMs in real time. Experimental results show that our solution allows all the hosted applications to achieve the desired performance in spite of their time-varying CPU and memory demands, whereas a solution without memory control incurs significant service level violations.
{"title":"Memory overbooking and dynamic control of Xen virtual machines in consolidated environments","authors":"Jin Heo, Xiaoyun Zhu, Pradeep Padala, Zhikui Wang","doi":"10.1109/INM.2009.5188871","DOIUrl":"https://doi.org/10.1109/INM.2009.5188871","url":null,"abstract":"The newly emergent cloud computing environments host hundreds to thousands of services on a shared resource pool. The sharing is enhanced by virtualization technologies allowing multiple services to run in different virtual machines (VMs) on a single physical node. Resource overbooking allows more services with time-varying demands to be consolidated reducing operational costs. In the past, researchers have studied dynamic control mechanisms for allocating CPU to virtual machines, when CPU is overbooked with respect to the sum of the peak demands from all the VMs. However, runtime re-allocation of memory among multiple VMs has not been widely studied, except on VMware platforms. In this paper, we present a case study where feedback control is used for dynamic memory allocation to Xen virtual machines in a consolidated environment. We illustrate how memory behaves differently from CPU in terms of its relationship to application-level performance, such as response times. We have built a prototype of a joint resource control system for allocating both CPU and memory resources to co-located VMs in real time. Experimental results show that our solution allows all the hosted applications to achieve the desired performance in spite of their time-varying CPU and memory demands, whereas a solution without memory control incurs significant service level violations.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"98 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":"123693492","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188817
Hasan, P. Rácz, B. Stiller
Monitoring of Service Level Objectives (SLOs) determines an essential part of Service Level Agreement (SLA) management, since customers are to be reimbursed, if a provider fails to fulfil them. By automating this process, a timely detection of a violation is possible. The compliance approach must be flexible to adapt to potential changes, must be scalable with respect to the amount of data, and has to support multi-domain environments. This paper determines a Hosted Streaming Services scenario and defines relevant SLOs. Key requirements are derived, the respective architecture is designed, and the approach is implemented prototypically based on a generic auditing framework. Further-more, a new scheme is proposed that considers the degree and duration of SLO violations in calculating reimbursements.
{"title":"Monitoring of SLA compliances for Hosted Streaming Services","authors":"Hasan, P. Rácz, B. Stiller","doi":"10.1109/INM.2009.5188817","DOIUrl":"https://doi.org/10.1109/INM.2009.5188817","url":null,"abstract":"Monitoring of Service Level Objectives (SLOs) determines an essential part of Service Level Agreement (SLA) management, since customers are to be reimbursed, if a provider fails to fulfil them. By automating this process, a timely detection of a violation is possible. The compliance approach must be flexible to adapt to potential changes, must be scalable with respect to the amount of data, and has to support multi-domain environments. This paper determines a Hosted Streaming Services scenario and defines relevant SLOs. Key requirements are derived, the respective architecture is designed, and the approach is implemented prototypically based on a generic auditing framework. Further-more, a new scheme is proposed that considers the degree and duration of SLO violations in calculating reimbursements.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"72 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":"133007713","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188796
Ling Jin, Ping Pan, Chun Ying, Jin Hua Liu, Qiming Tian
The requirement of quickly creating new value-added telecom services is increasingly becoming a business imperative today. Telecom operators and service providers are facing the challenge how to reduce cost and time-to-market of creating new services. The reduction is expected to be 1 or 2 orders of magnitude from months or weeks to days, even hours. In traditional Service Creation Environment, a full lifecycle of requirements analyzing, design, development, testing and deployment always has to be undergone. Such way of services creation always results in poor reuse of software assets and involves mass resources. Some technologies have been developed to speed up steps in this lifecycle, such as BPEL or SCXML. These orchestration techniques and tools are already used to reduce cost in design and development stages but the creation procedure still rely on attendance of IT specialists. This paper presents a way to shorten and simplify the whole service creation lifecycle and to reach the reduction target by building a template based Service Creation Environment. A model is used to separate service work flow definition and service parameters configuration and to achieve rapid development for different roles. A prototype of template based service creation environment is also introduced in this paper.
{"title":"Rapid Service Creation Environment for service delivery platform based on service templates","authors":"Ling Jin, Ping Pan, Chun Ying, Jin Hua Liu, Qiming Tian","doi":"10.1109/INM.2009.5188796","DOIUrl":"https://doi.org/10.1109/INM.2009.5188796","url":null,"abstract":"The requirement of quickly creating new value-added telecom services is increasingly becoming a business imperative today. Telecom operators and service providers are facing the challenge how to reduce cost and time-to-market of creating new services. The reduction is expected to be 1 or 2 orders of magnitude from months or weeks to days, even hours. In traditional Service Creation Environment, a full lifecycle of requirements analyzing, design, development, testing and deployment always has to be undergone. Such way of services creation always results in poor reuse of software assets and involves mass resources. Some technologies have been developed to speed up steps in this lifecycle, such as BPEL or SCXML. These orchestration techniques and tools are already used to reduce cost in design and development stages but the creation procedure still rely on attendance of IT specialists. This paper presents a way to shorten and simplify the whole service creation lifecycle and to reach the reduction target by building a template based Service Creation Environment. A model is used to separate service work flow definition and service parameters configuration and to achieve rapid development for different roles. A prototype of template based service creation environment is also introduced in this paper.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"29 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":"125592799","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188801
S. Jordan
As part of the wider debate over net neutrality, traffic management practices of Internet Service Providers have become an issue of public concern. The Federal Communications Commission has asked for public input on whether deep packet inspection and other traffic management practices are reasonable forms of network management. Little attention has been paid to this issue within the academic networking community, and most Internet policy researchers have recommended a case-by-case analysis. This paper proposes four questions that can be used to determine whether a traffic management practice is reasonable or unreasonable.
{"title":"Four questions that determine whether traffic management is reasonable","authors":"S. Jordan","doi":"10.1109/INM.2009.5188801","DOIUrl":"https://doi.org/10.1109/INM.2009.5188801","url":null,"abstract":"As part of the wider debate over net neutrality, traffic management practices of Internet Service Providers have become an issue of public concern. The Federal Communications Commission has asked for public input on whether deep packet inspection and other traffic management practices are reasonable forms of network management. Little attention has been paid to this issue within the academic networking community, and most Internet policy researchers have recommended a case-by-case analysis. This paper proposes four questions that can be used to determine whether a traffic management practice is reasonable or unreasonable.","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":"123044625","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}
Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188872
Guilherme Sperb Machado, Weverton Cordeiro, A. O. D. Santos, Juliano Araujo Wickboldt, R. C. Lunardi, F. Andreis, C. Both, L. Gaspary, L. Granville, David Trastour, C. Bartolini
In order to deal with failures in the deployment of IT changes and to always leave IT infrastructures into consistent states, we proposed in a previous work, a solution to automate the generation of rollback plans in IT change management systems. The solution was based on a mechanism that treats Requests for Change (RFC) (or parts of them) as a single atomic transaction. In this work, we extend our previous investigation and present more flexible and fine grained treatment of failures. The paper first presents extensions to our conceptual model in order (i) to give IT operators some flexibility in defining rollback actions, for example, by allowing the rollback plan to not only be a reversed change plan; and (ii) to execute different recovery activities depending on the cause and location of a problem. The paper then focuses on a refined manner to handle and treat failures in change deployments. We follow the ITIL version 3 best practises which suggest that, depending on the RFC context, the human operator can classify activities as reversible or irreversible. Such classification allows change management systems to automatically generate more accurate remediation plans. The proposal takes into account not only a precise way to define how rollback plans will be generated, but also an intuitive method enabling the operator to define compensation activities in order to complete the RFC successfully, even with the occurrence of failures. To prove the concept and technical feasibility, we have materialized our solution in the CHANGELEDGE prototype that, using elements of the Business Process Execution Language (BPEL), is able to generate correct remediation plans to handle and treat failures in IT change management systems.
{"title":"Refined failure remediation for IT change management systems","authors":"Guilherme Sperb Machado, Weverton Cordeiro, A. O. D. Santos, Juliano Araujo Wickboldt, R. C. Lunardi, F. Andreis, C. Both, L. Gaspary, L. Granville, David Trastour, C. Bartolini","doi":"10.1109/INM.2009.5188872","DOIUrl":"https://doi.org/10.1109/INM.2009.5188872","url":null,"abstract":"In order to deal with failures in the deployment of IT changes and to always leave IT infrastructures into consistent states, we proposed in a previous work, a solution to automate the generation of rollback plans in IT change management systems. The solution was based on a mechanism that treats Requests for Change (RFC) (or parts of them) as a single atomic transaction. In this work, we extend our previous investigation and present more flexible and fine grained treatment of failures. The paper first presents extensions to our conceptual model in order (i) to give IT operators some flexibility in defining rollback actions, for example, by allowing the rollback plan to not only be a reversed change plan; and (ii) to execute different recovery activities depending on the cause and location of a problem. The paper then focuses on a refined manner to handle and treat failures in change deployments. We follow the ITIL version 3 best practises which suggest that, depending on the RFC context, the human operator can classify activities as reversible or irreversible. Such classification allows change management systems to automatically generate more accurate remediation plans. The proposal takes into account not only a precise way to define how rollback plans will be generated, but also an intuitive method enabling the operator to define compensation activities in order to complete the RFC successfully, even with the occurrence of failures. To prove the concept and technical feasibility, we have materialized our solution in the CHANGELEDGE prototype that, using elements of the Business Process Execution Language (BPEL), is able to generate correct remediation plans to handle and treat failures in IT change management systems.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"67 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":"121786910","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：