Pub Date : 2011-05-23DOI: 10.1109/INM.2011.5990499
Weichao Li, W. Fok, Edmond W. W. Chan, Xiapu Luo, R. Chang
Many new methods and tools have been developed to measure the quality of network paths for the last ten years. However, there are relatively few works that consider deploying these methods for collaborative network measurement: a number of measuring points belonging to different autonomous systems collaborate on monitoring and diagnosing their network performance. In this paper, we present Planetopus, a distributed system for facilitating collaborative network monitoring. Planetopus provides a single platform for configuring and scheduling measurement tasks performed on a set of distributed measuring points. Planetopus currently performs measurement mainly using OneProbe and tcptraceroute. Moreover, we introduce two useful facilities for analyzing the measurement data: a new metric for quantifying route changes and a heatmap-based visualization method for discovering patterns and anomalies from a set of path measurements. We demonstrate the utility of Planetopus through several case studies in which poor routes are identified and corrected, different ISPs' network services are compared, and network performance problems are diagnosed.
{"title":"Planetopus: A system for facilitating collaborative network monitoring","authors":"Weichao Li, W. Fok, Edmond W. W. Chan, Xiapu Luo, R. Chang","doi":"10.1109/INM.2011.5990499","DOIUrl":"https://doi.org/10.1109/INM.2011.5990499","url":null,"abstract":"Many new methods and tools have been developed to measure the quality of network paths for the last ten years. However, there are relatively few works that consider deploying these methods for collaborative network measurement: a number of measuring points belonging to different autonomous systems collaborate on monitoring and diagnosing their network performance. In this paper, we present Planetopus, a distributed system for facilitating collaborative network monitoring. Planetopus provides a single platform for configuring and scheduling measurement tasks performed on a set of distributed measuring points. Planetopus currently performs measurement mainly using OneProbe and tcptraceroute. Moreover, we introduce two useful facilities for analyzing the measurement data: a new metric for quantifying route changes and a heatmap-based visualization method for discovering patterns and anomalies from a set of path measurements. We demonstrate the utility of Planetopus through several case studies in which poor routes are identified and corrected, different ISPs' network services are compared, and network performance problems are diagnosed.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"36 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":"129034942","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 : 2011-05-23DOI: 10.1109/INM.2011.5990508
Silvia Knittl, M. Brenner
Services provided in hybrid cloud deployments are often composed of service parts from various providers. Managing such services effectively requires acquiring and relating configuration information from all participating organizations. This configuration information is usually not only gathered and stored with different tools - different service provider organizations also develop widely differing information models for their Configuration Management Databases (CMDB). As establishing a common, universally accepted, ‘silver bullet’ information model for CMDBs in the near future seems increasingly unrealistic, this paper argues for a pragmatic approach that adopts the ‘Core Components’ concept developed in the context of UN/CEFACT.
{"title":"Towards a Configuration Management System for hybrid cloud deployments","authors":"Silvia Knittl, M. Brenner","doi":"10.1109/INM.2011.5990508","DOIUrl":"https://doi.org/10.1109/INM.2011.5990508","url":null,"abstract":"Services provided in hybrid cloud deployments are often composed of service parts from various providers. Managing such services effectively requires acquiring and relating configuration information from all participating organizations. This configuration information is usually not only gathered and stored with different tools - different service provider organizations also develop widely differing information models for their Configuration Management Databases (CMDB). As establishing a common, universally accepted, ‘silver bullet’ information model for CMDBs in the near future seems increasingly unrealistic, this paper argues for a pragmatic approach that adopts the ‘Core Components’ concept developed in the context of UN/CEFACT.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"29 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":"124445796","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 : 2011-05-23DOI: 10.1109/INM.2011.5990578
Xingyu Zheng, P. Maillé, C. Le, Stephane Morucci
The concept of trust has recently been introduced in the context of peer-to-peer networks, in order to deal with uncertainty regarding the behavior of imperfectly known agents. In this paper, we apply the notion of trust to situations of collaborative work, more precisely of document editing. We suggest to use trust to compute a satisfaction score for each participant, in order to help select the successive editors of the document so as to avoid unnecessary readings by all collaborators after each modification. We assume that the document development process ends when all collaborators are satisfied with the quality of the document. Two mechanisms using trust to improve that process are proposed, and compared to the situation without trust. Extensive simulations suggest that trust can improve the efficiency of the collaborative work, while it can be implemented in a distributed manner.
{"title":"Improving the efficiency of collaborative work with trust management","authors":"Xingyu Zheng, P. Maillé, C. Le, Stephane Morucci","doi":"10.1109/INM.2011.5990578","DOIUrl":"https://doi.org/10.1109/INM.2011.5990578","url":null,"abstract":"The concept of trust has recently been introduced in the context of peer-to-peer networks, in order to deal with uncertainty regarding the behavior of imperfectly known agents. In this paper, we apply the notion of trust to situations of collaborative work, more precisely of document editing. We suggest to use trust to compute a satisfaction score for each participant, in order to help select the successive editors of the document so as to avoid unnecessary readings by all collaborators after each modification. We assume that the document development process ends when all collaborators are satisfied with the quality of the document. Two mechanisms using trust to improve that process are proposed, and compared to the situation without trust. Extensive simulations suggest that trust can improve the efficiency of the collaborative work, while it can be implemented in a distributed manner.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"27 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":"117076607","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 : 2011-05-23DOI: 10.1109/INM.2011.5990706
P. A. P. R. Duarte, J. Nobre, L. Granville, L. Tarouco
The introduction of self-* properties over distributed network management infrastructures has been proving to be a feasible approach for the new demands of modern network management. Among the properties of the self-* management vision, self-healing figures as key property in improving the dependability of the managed infrastructures. An interesting possibility to materialize self-* support - and self-healing support as well - in network management is through the employment of peer-to-peer (P2P) management overlays. Considering this scenario, we introduce in this paper a self-healing service provided by a prototype P2P-Based Network Management (P2PBNM) system. Such a service is expected to be contracted by human administrators interested in monitoring and recovering their IT infrastructures. In addition, an experimental evaluation of the self-healing service is performed considering a case study where a Host-based Intrusion Detection System (HIDS) needs to be constantly observed and eventually healed to keep the underlying communication network protected.
{"title":"A P2P-Based self-healing service for network maintenance","authors":"P. A. P. R. Duarte, J. Nobre, L. Granville, L. Tarouco","doi":"10.1109/INM.2011.5990706","DOIUrl":"https://doi.org/10.1109/INM.2011.5990706","url":null,"abstract":"The introduction of self-* properties over distributed network management infrastructures has been proving to be a feasible approach for the new demands of modern network management. Among the properties of the self-* management vision, self-healing figures as key property in improving the dependability of the managed infrastructures. An interesting possibility to materialize self-* support - and self-healing support as well - in network management is through the employment of peer-to-peer (P2P) management overlays. Considering this scenario, we introduce in this paper a self-healing service provided by a prototype P2P-Based Network Management (P2PBNM) system. Such a service is expected to be contracted by human administrators interested in monitoring and recovering their IT infrastructures. In addition, an experimental evaluation of the self-healing service is performed considering a case study where a Host-based Intrusion Detection System (HIDS) needs to be constantly observed and eventually healed to keep the underlying communication network protected.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"53 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":"116382581","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 : 2011-05-23DOI: 10.1109/INM.2011.5990670
F. Eyermann, G. Rodosek
Service Level Agreements (SLAs) are well-known from a large variety of business branches. However, despite the increasing importance of the Internet and electronic communication, a fairly low dissemination of IP carrying SLAs is observed. IP carrying SLAs are offered by Internet Service Providers (ISPs) documenting network service levels such as maximum packet loss, maximum packet delay, or availability. Among the reasons for the low dissemination are certainly the difficult monitoring and measurement possibilities in a multi-provider environment. This paper presents an architecture for a multi-domain auditing system, which is able to monitor the fulfillment of service levels documented in SLAs across several domains. With the already proposed MeSA protocol this architecture presents a comprehensive solution. We conclude the paper with a detailed assessment, including simulation results that are based on real trace input data, showing the validity of the overall approach.
{"title":"An auditing system for multi-domain IP carrying Service Level Agreements","authors":"F. Eyermann, G. Rodosek","doi":"10.1109/INM.2011.5990670","DOIUrl":"https://doi.org/10.1109/INM.2011.5990670","url":null,"abstract":"Service Level Agreements (SLAs) are well-known from a large variety of business branches. However, despite the increasing importance of the Internet and electronic communication, a fairly low dissemination of IP carrying SLAs is observed. IP carrying SLAs are offered by Internet Service Providers (ISPs) documenting network service levels such as maximum packet loss, maximum packet delay, or availability. Among the reasons for the low dissemination are certainly the difficult monitoring and measurement possibilities in a multi-provider environment. This paper presents an architecture for a multi-domain auditing system, which is able to monitor the fulfillment of service levels documented in SLAs across several domains. With the already proposed MeSA protocol this architecture presents a comprehensive solution. We conclude the paper with a detailed assessment, including simulation results that are based on real trace input data, showing the validity of the overall approach.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"18 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":"116119810","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 : 2011-05-23DOI: 10.1109/INM.2011.5990664
Lei Xu, Lei Shi, Runxin Wang, B. Jennings
Constructing composite services by using of services offered by third parties is an attractive and inexpensive way for service brokers and aggregators to enhance differentiation from their competitors. When multiple services provide the same or similar functionalities, selecting those that satisfy users' non-functional requirements is crucial. In many cases, non-functional properties of services are heavily dependent on the activity of the network delivering those services whilst the network activity follows certain time-sensitive rules. We present a service selection algorithm that takes into account time-sensitive variations of non-functional propensities of services to identify a service combination offering the highest quality within a specified time interval.
{"title":"A multiple criteria service composition selection algorithm supporting time-sensitive rules","authors":"Lei Xu, Lei Shi, Runxin Wang, B. Jennings","doi":"10.1109/INM.2011.5990664","DOIUrl":"https://doi.org/10.1109/INM.2011.5990664","url":null,"abstract":"Constructing composite services by using of services offered by third parties is an attractive and inexpensive way for service brokers and aggregators to enhance differentiation from their competitors. When multiple services provide the same or similar functionalities, selecting those that satisfy users' non-functional requirements is crucial. In many cases, non-functional properties of services are heavily dependent on the activity of the network delivering those services whilst the network activity follows certain time-sensitive rules. We present a service selection algorithm that takes into account time-sensitive variations of non-functional propensities of services to identify a service combination offering the highest quality within a specified time interval.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"6 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":"125770829","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 : 2011-05-23DOI: 10.1109/INM.2011.5990498
P. Mullarkey, Mike Johns, S. Rooney
Tools for monitoring the performance and behavior of modern large networks produce an abundance of data, resulting in considerable interest in the ability to bring the most critical facets to the attention of human operators. While the coverage and sophistication of data being collected is expanding greatly to be comprehensive and detailed enough to solve hard problems, methods for analyzing this data tend to be either 1) too simplistic, resulting in too much information for users to process, many of which are false positives, or 2) too computationally intensive to keep up with the volume of data generated by large networks. We introduce a system that seeks a middle ground between these extremes using probability-based thresholding and temporal correlation of targeted, domain-specific network behavior metrics, resulting in fewer, higher-quality, more actionable events presented to users. In this paper we outline the problem area, present some of the mechanisms used, and then share two real examples of using anomaly detection to help large enterprises solve network problems.
{"title":"Discovering anomalous behavior in large networked systems","authors":"P. Mullarkey, Mike Johns, S. Rooney","doi":"10.1109/INM.2011.5990498","DOIUrl":"https://doi.org/10.1109/INM.2011.5990498","url":null,"abstract":"Tools for monitoring the performance and behavior of modern large networks produce an abundance of data, resulting in considerable interest in the ability to bring the most critical facets to the attention of human operators. While the coverage and sophistication of data being collected is expanding greatly to be comprehensive and detailed enough to solve hard problems, methods for analyzing this data tend to be either 1) too simplistic, resulting in too much information for users to process, many of which are false positives, or 2) too computationally intensive to keep up with the volume of data generated by large networks. We introduce a system that seeks a middle ground between these extremes using probability-based thresholding and temporal correlation of targeted, domain-specific network behavior metrics, resulting in fewer, higher-quality, more actionable events presented to users. In this paper we outline the problem area, present some of the mechanisms used, and then share two real examples of using anomaly detection to help large enterprises solve network problems.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"13 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":"126824837","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 : 2011-05-23DOI: 10.1109/INM.2011.5990678
P. D. Maciel, F. Brasileiro, R. Lopes, Marcus Carvalho, M. Mowbray
The cloud computing market has emerged as an alternative for the provisioning of resources on a pay-as-you-go basis. This flexibility potentially allows clients of cloud computing solutions to reduce the total cost of ownership of their Information Technology infrastructures. On the other hand, this market-based model is not the only way to reduce costs. Among other solutions proposed, peer-to-peer (P2P) grid computing has been suggested as a way to enable a simpler economy for the trading of idle resources. In this paper, we consider an IT infrastructure which benefits from both of these strategies. In such a hybrid infrastructure, computing power can be obtained from in-house dedicated resources, from resources acquired from cloud computing providers, and from resources received as donations from a P2P grid. We take a business-driven approach to the problem and try to maximise the profit that can be achieved by running applications in this hybrid infrastructure. The execution of applications yields utility, while costs may be incurred when resources are used to run the applications, or even when they sit idle. We assume that resources made available from cloud computing providers can be either reserved in advance, or bought on-demand. We study the impact that long-term contracts established with the cloud computing providers have on the profit achieved. Anticipating the optimal contracts is not possible due to the many uncertainties in the system, which stem from the prediction error on the workload demand, the lack of guarantees on the quality of service of the P2P grid, and fluctuations in the future prices of on-demand resources. However, we show that the judicious planning of long term contracts can lead to profits close to those given by an optimal contract set. In particular, we model the planning problem as an optimisation problem and show that the planning performed by solving this optimization problem is robust to the inherent uncertainties of the system, producing profits that for some scenarios can be more than double those achieved by following some common rule-of-thumb approaches to choosing reservation contracts.
{"title":"Evaluating the impact of planning long-term contracts on the management of a hybrid IT infrastructure","authors":"P. D. Maciel, F. Brasileiro, R. Lopes, Marcus Carvalho, M. Mowbray","doi":"10.1109/INM.2011.5990678","DOIUrl":"https://doi.org/10.1109/INM.2011.5990678","url":null,"abstract":"The cloud computing market has emerged as an alternative for the provisioning of resources on a pay-as-you-go basis. This flexibility potentially allows clients of cloud computing solutions to reduce the total cost of ownership of their Information Technology infrastructures. On the other hand, this market-based model is not the only way to reduce costs. Among other solutions proposed, peer-to-peer (P2P) grid computing has been suggested as a way to enable a simpler economy for the trading of idle resources. In this paper, we consider an IT infrastructure which benefits from both of these strategies. In such a hybrid infrastructure, computing power can be obtained from in-house dedicated resources, from resources acquired from cloud computing providers, and from resources received as donations from a P2P grid. We take a business-driven approach to the problem and try to maximise the profit that can be achieved by running applications in this hybrid infrastructure. The execution of applications yields utility, while costs may be incurred when resources are used to run the applications, or even when they sit idle. We assume that resources made available from cloud computing providers can be either reserved in advance, or bought on-demand. We study the impact that long-term contracts established with the cloud computing providers have on the profit achieved. Anticipating the optimal contracts is not possible due to the many uncertainties in the system, which stem from the prediction error on the workload demand, the lack of guarantees on the quality of service of the P2P grid, and fluctuations in the future prices of on-demand resources. However, we show that the judicious planning of long term contracts can lead to profits close to those given by an optimal contract set. In particular, we model the planning problem as an optimisation problem and show that the planning performed by solving this optimization problem is robust to the inherent uncertainties of the system, producing profits that for some scenarios can be more than double those achieved by following some common rule-of-thumb approaches to choosing reservation contracts.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"36 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":"128373368","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 : 2011-05-23DOI: 10.1109/INM.2011.5990661
N. Kamiyama, R. Kawahara, Tatsuya Mori, H. Hasegawa
In Video on Demand (VoD) services, the demand for content items greatly changes daily, so reducing the server load at the peak time is an important issue for ISPs to reduce the server cost. To achieve this goal, we proposed to reduce the server load by multicasting popular content items to all users independently of actual requests as well as providing on-demand unicast delivery. In this solution, however, the hit ratio of pre-distributed content items is small, and a large-capacity storage is required at set-top box (STB). We might be able to cope with this problem by limiting the number of pre-distributed content items or clustering users based on the history of viewing. We evaluate the effect of these techniques using actual VoD access log data. We clarify that the required storage capacity at STB can be halved while keeping the effect of server load reduction to about 80% by limiting pre-distributed content items, and user clustering is effective only when the cluster count is about two.
在视频点播(Video on Demand, VoD)业务中，用户对内容的需求每天都有很大的变化，因此如何在高峰时段降低服务器的负载是网络服务提供商降低服务器成本的一个重要问题。为了实现这一目标，我们建议通过独立于实际请求向所有用户广播流行内容项目以及提供按需单播交付来减少服务器负载。但该方案中预分发内容项的命中率较小，且需要机顶盒上的大容量存储。我们可以通过限制预分发内容项的数量或基于浏览历史对用户进行聚类来解决这个问题。我们使用实际的视频点播访问日志数据来评估这些技术的效果。我们明确指出，通过限制预分发的内容项，可以将机顶盒所需的存储容量减半，同时将服务器负载减少到80%左右，并且只有当集群数量约为两个时，用户集群才有效。
{"title":"Limiting pre-distribution and clustering users on multicast pre-distribution VoD","authors":"N. Kamiyama, R. Kawahara, Tatsuya Mori, H. Hasegawa","doi":"10.1109/INM.2011.5990661","DOIUrl":"https://doi.org/10.1109/INM.2011.5990661","url":null,"abstract":"In Video on Demand (VoD) services, the demand for content items greatly changes daily, so reducing the server load at the peak time is an important issue for ISPs to reduce the server cost. To achieve this goal, we proposed to reduce the server load by multicasting popular content items to all users independently of actual requests as well as providing on-demand unicast delivery. In this solution, however, the hit ratio of pre-distributed content items is small, and a large-capacity storage is required at set-top box (STB). We might be able to cope with this problem by limiting the number of pre-distributed content items or clustering users based on the history of viewing. We evaluate the effect of these techniques using actual VoD access log data. We clarify that the required storage capacity at STB can be halved while keeping the effect of server load reduction to about 80% by limiting pre-distributed content items, and user clustering is effective only when the cluster count is about two.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"6 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":"128489645","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 : 2011-05-23DOI: 10.1109/INM.2011.5990524
Stefan Wallin
Formal data-models are one of the corner-stones of automatic network management. We need semantic models that can be automatically interpreted by management applications. At the same time, human domain-experts need to be able to understand the models. This dualistic requirement has lead standard organizations to pick modeling approaches that prioritize either humans or automatic software. YANG is a semantically rich data-modeling language. We have defined a mapping of YANG to UML and a tool that renders UML diagrams from YANG models. This enables the benefits of formal languages for defining interfaces and automatically maintained UML diagrams to involve domain experts.
{"title":"UML visualization of YANG models","authors":"Stefan Wallin","doi":"10.1109/INM.2011.5990524","DOIUrl":"https://doi.org/10.1109/INM.2011.5990524","url":null,"abstract":"Formal data-models are one of the corner-stones of automatic network management. We need semantic models that can be automatically interpreted by management applications. At the same time, human domain-experts need to be able to understand the models. This dualistic requirement has lead standard organizations to pick modeling approaches that prioritize either humans or automatic software. YANG is a semantically rich data-modeling language. We have defined a mapping of YANG to UML and a tool that renders UML diagrams from YANG models. This enables the benefits of formal languages for defining interfaces and automatically maintained UML diagrams to involve domain experts.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"16 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":"127041627","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
扫码关注我们
求助内容：
应助结果提醒方式：