Pub Date : 2009-06-01DOI: 10.1109/INM.2009.5188861
A. Souza, Ana Luize de B. de P. Barros, A. S. S. Vieira, G. Campos, Jéssyca Alencar L. e Silva, J. Celestino, Joel Uchoa, L. Mendouga
With the emergence of new applications and requirements it became necessary to create new monitoring and reactive configuration mechanisms to try to meet the SLAs (Service Level Agreements). In WDM (Wavelength Division Multiplexing) optical networks, one way of trying to fulfill these agreements is by using pre-established protection paths. However, despite guaranteeing that traffic will be rapidly routed to its protection path in case of failure, there is no guarantee that the latter will be capable of meeting the contracted SLA in accordance with the bit error rate of its links. In this article we propose a scheme for monitoring and selecting the SRLG (Shared Risk Link Group) protection path disjointed from the main path using Genetic Algorithms, Fuzzy Logic in a PBM (Policy Based Management) platform denominated GAFUDI.
随着新应用程序和需求的出现，有必要创建新的监视和响应式配置机制，以尝试满足sla(服务水平协议)。在WDM(波分复用)光网络中，尝试实现这些协议的一种方法是使用预先建立的保护路径。然而，尽管保证在发生故障时将流量快速路由到其保护路径，但不能保证后者能够按照其链路的误码率满足合同SLA。在本文中，我们提出了一种在PBM (Policy Based Management)平台GAFUDI中使用遗传算法和模糊逻辑来监测和选择与主路径脱节的SRLG (Shared Risk Link Group)保护路径的方案。
{"title":"A management scheme of SRLG-disjoint protection path","authors":"A. Souza, Ana Luize de B. de P. Barros, A. S. S. Vieira, G. Campos, Jéssyca Alencar L. e Silva, J. Celestino, Joel Uchoa, L. Mendouga","doi":"10.1109/INM.2009.5188861","DOIUrl":"https://doi.org/10.1109/INM.2009.5188861","url":null,"abstract":"With the emergence of new applications and requirements it became necessary to create new monitoring and reactive configuration mechanisms to try to meet the SLAs (Service Level Agreements). In WDM (Wavelength Division Multiplexing) optical networks, one way of trying to fulfill these agreements is by using pre-established protection paths. However, despite guaranteeing that traffic will be rapidly routed to its protection path in case of failure, there is no guarantee that the latter will be capable of meeting the contracted SLA in accordance with the bit error rate of its links. In this article we propose a scheme for monitoring and selecting the SRLG (Shared Risk Link Group) protection path disjointed from the main path using Genetic Algorithms, Fuzzy Logic in a PBM (Policy Based Management) platform denominated GAFUDI.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"205 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":"122507906","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.5188888
Abdelkader Lahmadi, Laurent Andrey, O. Festor
The efficiency and the performance of management systems is becoming a hot research topic within the networks and services management community. This concern is due to the new challenges of large scale managed systems, where the management plane is integrated within the functional plane and where management activities have to carry accurate and up-to-date information.
{"title":"Performance of network and service monitoring frameworks","authors":"Abdelkader Lahmadi, Laurent Andrey, O. Festor","doi":"10.1109/INM.2009.5188888","DOIUrl":"https://doi.org/10.1109/INM.2009.5188888","url":null,"abstract":"The efficiency and the performance of management systems is becoming a hot research topic within the networks and services management community. This concern is due to the new challenges of large scale managed systems, where the management plane is integrated within the functional plane and where management activities have to carry accurate and up-to-date information.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"34 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":"132552255","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.5188808
A. Bandara, A. Kakas, Emil C. Lupu, A. Russo
Firewalls remain the main perimeter security protection for corporate networks. However, network size and complexity make firewall configuration and maintenance notoriously difficult. Tools are needed to analyse firewall configurations for errors, to verify that they correctly implement security requirements and to generate configurations from higher-level requirements. In this paper we extend our previous work on the use of formal argumentation and preference reasoning for firewall policy analysis and develop means to automatically generate firewall policies from higher-level requirements. This permits both analysis and generation to be done within the same framework, thus accommodating a wide variety of scenarios for authoring and maintaining firewall configurations. We validate our approach by applying it to both examples from the literature and real firewall configurations of moderate size (≈ 150 rules).
{"title":"Using argumentation logic for firewall configuration management","authors":"A. Bandara, A. Kakas, Emil C. Lupu, A. Russo","doi":"10.1109/INM.2009.5188808","DOIUrl":"https://doi.org/10.1109/INM.2009.5188808","url":null,"abstract":"Firewalls remain the main perimeter security protection for corporate networks. However, network size and complexity make firewall configuration and maintenance notoriously difficult. Tools are needed to analyse firewall configurations for errors, to verify that they correctly implement security requirements and to generate configurations from higher-level requirements. In this paper we extend our previous work on the use of formal argumentation and preference reasoning for firewall policy analysis and develop means to automatically generate firewall policies from higher-level requirements. This permits both analysis and generation to be done within the same framework, thus accommodating a wide variety of scenarios for authoring and maintaining firewall configurations. We validate our approach by applying it to both examples from the literature and real firewall configurations of moderate size (≈ 150 rules).","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"31 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":"133195935","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.5188849
N. Djarallah, Hélia Pouyllau
Providing inter-domain QoS guaranteed services is a huge challenge for operators and will bring new revenues to them. But, establishing end-to-end services requires a level of resource management that does not exist yet, even locally to an operator. Due to confidentiality and independence reasons, operators are afraid to cooperate which can not be avoided in the inter-domain context. We consider the existence of an alliance framework wherein operators would agree to cooperate. In this article, we address the issues of negotiating inter-domain services and propose efficient algorithms to determine the end-to-end QoS contract that will satisfy the QoS demand for a service.
{"title":"Algorithms for SLA composition to provide inter-domain services","authors":"N. Djarallah, Hélia Pouyllau","doi":"10.1109/INM.2009.5188849","DOIUrl":"https://doi.org/10.1109/INM.2009.5188849","url":null,"abstract":"Providing inter-domain QoS guaranteed services is a huge challenge for operators and will bring new revenues to them. But, establishing end-to-end services requires a level of resource management that does not exist yet, even locally to an operator. Due to confidentiality and independence reasons, operators are afraid to cooperate which can not be avoided in the inter-domain context. We consider the existence of an alliance framework wherein operators would agree to cooperate. In this article, we address the issues of negotiating inter-domain services and propose efficient algorithms to determine the end-to-end QoS contract that will satisfy the QoS demand for a service.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134178987","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.5188807
Abdelkader Lahmadi, O. Festor
SIP-based networks are becoming the de-facto standard for voice, video and instant messaging services. Being exposed to many threats while playing an major role in the operation of essential services, the need for dedicated security management approaches is rapidly increasing. In this paper we present an original security management approach based on a specific vulnerability aware SIP stateful firewall. Through known attack descriptions, we illustrate the power of the configuration language of the firewall which uses the capability to specify stateful objects that track data from multiple SIP elements within their lifetime. We demonstrate through measurements on a real implementation of the firewall its efficiency and performance.
{"title":"SecSip: A stateful firewall for SIP-based networks","authors":"Abdelkader Lahmadi, O. Festor","doi":"10.1109/INM.2009.5188807","DOIUrl":"https://doi.org/10.1109/INM.2009.5188807","url":null,"abstract":"SIP-based networks are becoming the de-facto standard for voice, video and instant messaging services. Being exposed to many threats while playing an major role in the operation of essential services, the need for dedicated security management approaches is rapidly increasing. In this paper we present an original security management approach based on a specific vulnerability aware SIP stateful firewall. Through known attack descriptions, we illustrate the power of the configuration language of the firewall which uses the capability to specify stateful objects that track data from multiple SIP elements within their lifetime. We demonstrate through measurements on a real implementation of the firewall its efficiency and performance.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"30 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":"133369485","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.5188814
Vivek Aseeja, Rong L. Zheng
As wireless mesh networks become more popular, there exists a need to provide centralized management solutions, which facilitate network administrators to control, troubleshoot and collect statistics from their networks. Managing wireless mesh networks poses unique challenges due to limited bandwidth resources and dynamic channel quality. A robust management solution should function despite network layer failure. In this paper, we propose MeshMan, a network layer agnostic, low overhead solution to network management to cope with unreliable wireless channels, link and network level dynamics in wireless mesh networks. It combines the concepts of source routing with hierarchical addressing, and provides a native efficient query interface. A prototype of MeshMan has been implemented as a user space daemon on Linux and evaluated using a 12-node wireless mesh network testbed. Experimental studies demonstrate that MeshMan has comparable or better performance than the Simple Network Management Protocol (SNMP) in management overhead and response times when the network is stable while having much better performance in presence network dynamics.
{"title":"MeshMan: A management framework for wireless mesh networks","authors":"Vivek Aseeja, Rong L. Zheng","doi":"10.1109/INM.2009.5188814","DOIUrl":"https://doi.org/10.1109/INM.2009.5188814","url":null,"abstract":"As wireless mesh networks become more popular, there exists a need to provide centralized management solutions, which facilitate network administrators to control, troubleshoot and collect statistics from their networks. Managing wireless mesh networks poses unique challenges due to limited bandwidth resources and dynamic channel quality. A robust management solution should function despite network layer failure. In this paper, we propose MeshMan, a network layer agnostic, low overhead solution to network management to cope with unreliable wireless channels, link and network level dynamics in wireless mesh networks. It combines the concepts of source routing with hierarchical addressing, and provides a native efficient query interface. A prototype of MeshMan has been implemented as a user space daemon on Linux and evaluated using a 12-node wireless mesh network testbed. Experimental studies demonstrate that MeshMan has comparable or better performance than the Simple Network Management Protocol (SNMP) in management overhead and response times when the network is stable while having much better performance in presence network dynamics.","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":"133831527","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.5188790
B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester
Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.
{"title":"Autonomic service hosting for large-scale distributed MOVE-services","authors":"B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/INM.2009.5188790","DOIUrl":"https://doi.org/10.1109/INM.2009.5188790","url":null,"abstract":"Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"17 3 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":"116061958","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.5188811
Bin Zhang, E. Al-Shaer
Constructing optimal event correlation architecture is crucial to large-scale event services. It plays an instrumental role in detecting composite events requested by different subscribers in scalable and timely manner. However, events generated from different sources might have different time and priority requirements. In addition, the network links and correlation servers might have different bandwidth and processing constraints respectively. In this work, we address the problem of optimizing distributed event correlation to maximize the correlation profit (benefit minus shipping and processing cost) of detecting composite events, while at the same time satisfying the network bandwidth, node capacity, and correlation tasks time constrains. We show that this problem is NP-hard and provide a heuristic approximation algorithm. We evaluate our heuristic approach with different network sizes, topologies under different event delivery and detection requirements. Our simulation study shows that the results obtained by our heuristic are close to the upper bound.
{"title":"Optimizing correlation structure of event services considering time and capacity constraints","authors":"Bin Zhang, E. Al-Shaer","doi":"10.1109/INM.2009.5188811","DOIUrl":"https://doi.org/10.1109/INM.2009.5188811","url":null,"abstract":"Constructing optimal event correlation architecture is crucial to large-scale event services. It plays an instrumental role in detecting composite events requested by different subscribers in scalable and timely manner. However, events generated from different sources might have different time and priority requirements. In addition, the network links and correlation servers might have different bandwidth and processing constraints respectively. In this work, we address the problem of optimizing distributed event correlation to maximize the correlation profit (benefit minus shipping and processing cost) of detecting composite events, while at the same time satisfying the network bandwidth, node capacity, and correlation tasks time constrains. We show that this problem is NP-hard and provide a heuristic approximation algorithm. We evaluate our heuristic approach with different network sizes, topologies under different event delivery and detection requirements. Our simulation study shows that the results obtained by our heuristic are close to the upper bound.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"91 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":"126172202","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.5188847
Juliano Araujo Wickboldt, Guilherme Sperb Machado, Weverton Cordeiro, R. C. Lunardi, A. O. D. Santos, F. Andreis, C. Both, L. Granville, L. Gaspary, C. Bartolini, David Trastour
The growing necessity of organizations in using technologies to support to their operations implies that managing IT resources became a mission-critical issue for the health of the primary companies' businesses. Thus, in order to minimize problems in the IT infrastructure, possibly affecting the daily business operations, risks intrinsic to the change process have to be analyzed and assessed. Risk Management is a widely discussed subject in several areas, although for IT Change Management it is quite a new discipline. The Information Technology Infrastructure Library (ITIL) introduces a set of best practices to conduct the management of IT infrastructures. According to ITIL, risks should be investigated, measured, and mitigated before any change is approved. Even with these guidelines, there is no default automatic method for risk assessment in IT Change Management. In this paper we introduce a risk analysis method based on the execution history of past changes. In addition, we propose a failure representation model to capture the feedback of the execution of changes over IT infrastructures.
{"title":"A solution to support risk analysis on IT Change Management","authors":"Juliano Araujo Wickboldt, Guilherme Sperb Machado, Weverton Cordeiro, R. C. Lunardi, A. O. D. Santos, F. Andreis, C. Both, L. Granville, L. Gaspary, C. Bartolini, David Trastour","doi":"10.1109/INM.2009.5188847","DOIUrl":"https://doi.org/10.1109/INM.2009.5188847","url":null,"abstract":"The growing necessity of organizations in using technologies to support to their operations implies that managing IT resources became a mission-critical issue for the health of the primary companies' businesses. Thus, in order to minimize problems in the IT infrastructure, possibly affecting the daily business operations, risks intrinsic to the change process have to be analyzed and assessed. Risk Management is a widely discussed subject in several areas, although for IT Change Management it is quite a new discipline. The Information Technology Infrastructure Library (ITIL) introduces a set of best practices to conduct the management of IT infrastructures. According to ITIL, risks should be investigated, measured, and mitigated before any change is approved. Even with these guidelines, there is no default automatic method for risk assessment in IT Change Management. In this paper we introduce a risk analysis method based on the execution history of past changes. In addition, we propose a failure representation model to capture the feedback of the execution of changes over IT infrastructures.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"89 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":"126045000","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.5188852
Yanfeng Zhu, Yibo Zhang, Chun Ying, W. Lu
Monitoring the end-to-end Quality-of-Service (QoS) is an important work for service providers' Operation Support System (OSS), because it is the fundamental requirement for QoS provisioning. However, it is in fact a challenging work, and there are few efficient approaches to address it. In this paper, for Multi-Protocol Label Switching (MPLS) Virtual Private Networks (VPNs), we propose a queuing model based end-to-end performance evaluation scheme for OSS to monitor the end-to-end delay, which is one of the important QoS metrics. By means of a queuing model, we deduce the relationship between the end-to-end delay and the information available in the Management Information Base (MIB) of routers, and then we present the evaluation scheme which avoids the costly per-packet measurement. The complexity of the proposed scheme is much lower than existing schemes. Extensive simulation results show that the proposed scheme can efficiently evaluate the end-to-end performance metrics (the estimation error is nearly 10%).
{"title":"Queuing model based end-to-end performance evaluation for MPLS Virtual Private Networks","authors":"Yanfeng Zhu, Yibo Zhang, Chun Ying, W. Lu","doi":"10.1109/INM.2009.5188852","DOIUrl":"https://doi.org/10.1109/INM.2009.5188852","url":null,"abstract":"Monitoring the end-to-end Quality-of-Service (QoS) is an important work for service providers' Operation Support System (OSS), because it is the fundamental requirement for QoS provisioning. However, it is in fact a challenging work, and there are few efficient approaches to address it. In this paper, for Multi-Protocol Label Switching (MPLS) Virtual Private Networks (VPNs), we propose a queuing model based end-to-end performance evaluation scheme for OSS to monitor the end-to-end delay, which is one of the important QoS metrics. By means of a queuing model, we deduce the relationship between the end-to-end delay and the information available in the Management Information Base (MIB) of routers, and then we present the evaluation scheme which avoids the costly per-packet measurement. The complexity of the proposed scheme is much lower than existing schemes. Extensive simulation results show that the proposed scheme can efficiently evaluate the end-to-end performance metrics (the estimation error is nearly 10%).","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"8 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":"121237228","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
扫码关注我们
求助内容：
应助结果提醒方式：