Pub Date : 2014-11-21DOI: 10.1109/CNSM.2014.7014169
Radhika Garg, B. Stiller
An impact analysis of adopting any new technology for fulfilling IT requirements of an organization is a very crucial task. It enables the identification of effects such a technology change will have on the organization from the technical, economical, and organization perspective. In the context of cloud-based solutions these facets are typically more complicated and the impact analysis of such large IT architectures cannot be completed with much accuracy at a high level. Therefore, each major single component of such an architecture has to be evaluated with respect to relevant factors, which appropriately denote the success or failure of the newly adopted solution. This paper develops and evaluates in this context a new impact analysis methodology, termed Impact Analysis Methodology for Cloud-based Services (IAMClS), which estimates the impact for cloud-based solutions in quantifiable terms. IAMCIS is illustrated in conjunction with a representative use case obtained from a survey conducted with 10 organizations, who plan to adopt or have adopted cloud-based solutions for fulfilling their IT requirements.
{"title":"Design and evaluation of an Impact Analysis Methodology for the adoption of Cloud-based Services (IAMCIS)","authors":"Radhika Garg, B. Stiller","doi":"10.1109/CNSM.2014.7014169","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014169","url":null,"abstract":"An impact analysis of adopting any new technology for fulfilling IT requirements of an organization is a very crucial task. It enables the identification of effects such a technology change will have on the organization from the technical, economical, and organization perspective. In the context of cloud-based solutions these facets are typically more complicated and the impact analysis of such large IT architectures cannot be completed with much accuracy at a high level. Therefore, each major single component of such an architecture has to be evaluated with respect to relevant factors, which appropriately denote the success or failure of the newly adopted solution. This paper develops and evaluates in this context a new impact analysis methodology, termed Impact Analysis Methodology for Cloud-based Services (IAMClS), which estimates the impact for cloud-based solutions in quantifiable terms. IAMCIS is illustrated in conjunction with a representative use case obtained from a survey conducted with 10 organizations, who plan to adopt or have adopted cloud-based solutions for fulfilling their IT requirements.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133515136","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 : 2014-11-21DOI: 10.1109/CNSM.2014.7014194
L. H. Nakamura, J. C. Estrella, R. Santana, M. J. Santana, S. Reiff-Marganiec
This paper presents a semantic approach to custom management of IaaS (Infrastructure as a Service) resources in a cloud computing environment requiring minimal human intervention from both the cloud provider and the user. The proposal differs from other approaches by using autonomic computing and semantic web techniques together to provide a self-configuring and self-optimizing environment that aims to satisfy SLAs (Service Level Agreements). The approach monitors the virtualized resources to guarantee a customized and optimized use based on financial criteria and energy consumption policies.
{"title":"A semantic approach for efficient and customized management of IaaS resources","authors":"L. H. Nakamura, J. C. Estrella, R. Santana, M. J. Santana, S. Reiff-Marganiec","doi":"10.1109/CNSM.2014.7014194","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014194","url":null,"abstract":"This paper presents a semantic approach to custom management of IaaS (Infrastructure as a Service) resources in a cloud computing environment requiring minimal human intervention from both the cloud provider and the user. The proposal differs from other approaches by using autonomic computing and semantic web techniques together to provide a self-configuring and self-optimizing environment that aims to satisfy SLAs (Service Level Agreements). The approach monitors the virtualized resources to guarantee a customized and optimized use based on financial criteria and energy consumption policies.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115015610","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 : 2014-11-21DOI: 10.1109/CNSM.2014.7014139
E. M. Oliveira, J. C. Estrella, B. Kuehne, Dionisio Machado Leite Filho, L. Adami, L. H. Nunes, L. H. Nakamura, R. M. D. O. Libardi, P. L. D. Souza, S. Reiff-Marganiec
Fault tolerance techniques can improve the trust of users in service oriented architectures as they can ensure data availability. This paper presents an implementation of a novel fault tolerance mechanism in a SOA architecture which simultaneously provides increased availability and better quality of service. In addition to this mechanism, a service selector using reputation ratings of the architecture components is discussed. The selection is based on information from past transactions of the components of the architecture, which allows to identify the best web services able to meet the requests of customers. The mechanisms are tested and a performance evaluation is presented to validate the results.
{"title":"Design and implementation of fault tolerance techniques to improve QoS in SOA","authors":"E. M. Oliveira, J. C. Estrella, B. Kuehne, Dionisio Machado Leite Filho, L. Adami, L. H. Nunes, L. H. Nakamura, R. M. D. O. Libardi, P. L. D. Souza, S. Reiff-Marganiec","doi":"10.1109/CNSM.2014.7014139","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014139","url":null,"abstract":"Fault tolerance techniques can improve the trust of users in service oriented architectures as they can ensure data availability. This paper presents an implementation of a novel fault tolerance mechanism in a SOA architecture which simultaneously provides increased availability and better quality of service. In addition to this mechanism, a service selector using reputation ratings of the architecture components is discussed. The selection is based on information from past transactions of the components of the architecture, which allows to identify the best web services able to meet the requests of customers. The mechanisms are tested and a performance evaluation is presented to validate the results.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133990730","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014137
Chunqiu Zeng, L. Tang, Tao Li, L. Shwartz, G. Grabarnik
The importance of mining time lags of hidden temporal dependencies from sequential data is highlighted in many domains including system management, stock market analysis, climate monitoring, and more. Mining time lags of temporal dependencies provides useful insights into understanding the sequential data and predicting its evolving trend. Traditional methods mainly utilize the predefined time window to analyze the sequential items or employ statistic techniques to identify the temporal dependencies from the sequential data. However, it is a challenging task for existing methods to find time lag of temporal dependencies in the real world, where time lags are fluctuating, noisy, and tend to be interleaved with each other. This paper introduces a parametric model to describe noisy time lags. Then an efficient expectation maximization approach is proposed to find the time lag with maximum likelihood. This paper also contributes an approximation method for learning time lag to improve the scalability without incurring significant loss of accuracy. Extensive experiments on both synthetic and real data sets are conducted to demonstrate the effectiveness and efficiency of proposed methods.
{"title":"Mining temporal lag from fluctuating events for correlation and root cause analysis","authors":"Chunqiu Zeng, L. Tang, Tao Li, L. Shwartz, G. Grabarnik","doi":"10.1109/CNSM.2014.7014137","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014137","url":null,"abstract":"The importance of mining time lags of hidden temporal dependencies from sequential data is highlighted in many domains including system management, stock market analysis, climate monitoring, and more. Mining time lags of temporal dependencies provides useful insights into understanding the sequential data and predicting its evolving trend. Traditional methods mainly utilize the predefined time window to analyze the sequential items or employ statistic techniques to identify the temporal dependencies from the sequential data. However, it is a challenging task for existing methods to find time lag of temporal dependencies in the real world, where time lags are fluctuating, noisy, and tend to be interleaved with each other. This paper introduces a parametric model to describe noisy time lags. Then an efficient expectation maximization approach is proposed to find the time lag with maximum likelihood. This paper also contributes an approximation method for learning time lag to improve the scalability without incurring significant loss of accuracy. Extensive experiments on both synthetic and real data sets are conducted to demonstrate the effectiveness and efficiency of proposed methods.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102527","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014164
Huijun Wu, Dijiang Huang
Offloading decisions for computation-intensive applications in mobile cloud computing may involve many decision factors. Important decision factors such as offloading node reliability and privacy protection have not been well studied. Moreover, existing offloading models mainly focus on the one-to-one offloading relation. To address the multi-factor and multi-site offloading mobile cloud application scenarios, we present a multifactor multi-site risk-based offloading model that abstracts the offloading impact factors as for offloading benefit and offloading risk. The offloading decision is made based on a comprehensive offloading risk evaluation. This presented model is generic and extendible. Four offloading impact factors are presented to show the construction and operation of the presented offloading model, which can be easily extended to incorporate more factors to make offloading decision more comprehensive. The overall offloading benefits and risks are aggregated based on the mobile cloud users' preference. The performance evaluation presents the practicality of the presented solution.
{"title":"Modeling multi-factor multi-site risk-based offloading for mobile cloud computing","authors":"Huijun Wu, Dijiang Huang","doi":"10.1109/CNSM.2014.7014164","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014164","url":null,"abstract":"Offloading decisions for computation-intensive applications in mobile cloud computing may involve many decision factors. Important decision factors such as offloading node reliability and privacy protection have not been well studied. Moreover, existing offloading models mainly focus on the one-to-one offloading relation. To address the multi-factor and multi-site offloading mobile cloud application scenarios, we present a multifactor multi-site risk-based offloading model that abstracts the offloading impact factors as for offloading benefit and offloading risk. The offloading decision is made based on a comprehensive offloading risk evaluation. This presented model is generic and extendible. Four offloading impact factors are presented to show the construction and operation of the presented offloading model, which can be easily extended to incorporate more factors to make offloading decision more comprehensive. The overall offloading benefits and risks are aggregated based on the mobile cloud users' preference. The performance evaluation presents the practicality of the presented solution.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496514","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014184
Merve Unuvar, Y. Doganata, A. Tantawi, M. Steinder
Cloud providers apply overbooking to increase utilization of data center resources, which is associated with the risk of overloading cloud resources. In this paper, we study an admission control technique that permits cloud overbooking with bounded probability of resource over-utilization. The objective is to achieve a specified quality-of-service related to the probability of resource over-utilization in an uncertain loading condition, while maintaining high resource utilizations. Our method relies on estimating the probability of over-utilization based on approximating the probability distribution of the total resource demand on hosts as Beta. We perform a qualitative study to investigate the efficiency of using our method on Google Compute Cluster where we disclose some empirical observations on how well the resource utilization can be estimated as Beta Distribution. We also report results on the performance of the stochastic admission controller by estimating the mean and the standard deviation of the usage data.
{"title":"Cloud overbooking through stochastic admission controller","authors":"Merve Unuvar, Y. Doganata, A. Tantawi, M. Steinder","doi":"10.1109/CNSM.2014.7014184","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014184","url":null,"abstract":"Cloud providers apply overbooking to increase utilization of data center resources, which is associated with the risk of overloading cloud resources. In this paper, we study an admission control technique that permits cloud overbooking with bounded probability of resource over-utilization. The objective is to achieve a specified quality-of-service related to the probability of resource over-utilization in an uncertain loading condition, while maintaining high resource utilizations. Our method relies on estimating the probability of over-utilization based on approximating the probability distribution of the total resource demand on hosts as Beta. We perform a qualitative study to investigate the efficiency of using our method on Google Compute Cluster where we disclose some empirical observations on how well the resource utilization can be estimated as Beta Distribution. We also report results on the performance of the stochastic admission controller by estimating the mean and the standard deviation of the usage data.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122492348","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014173
Rashid Mijumbi, J. Gorricho, J. Serrat, J. Rubio-Loyola, Ramón Agüero
As network virtualisation continues to receive attention, recent proposals have advocated for survivability in network virtualisation environments (NVEs). However, research work within the same area has mainly focused on the single provider environment, leaving network survivability in multi-domain environments largely unexplored. In particular, survivability in heterogeneous physical networks raises questions with regard to the negotiation between competing parties so as to form coalitions for resource provisioning. In this paper, we propose a distributed negotiation algorithm which uses a system of entities to support survivability in a multi-domain NVE. The objective is to make each of the virtual network providers adaptive and dynamic by modelling them with capacity to perform QoS aware resource back-ups and/or restorations for physical link failures.
{"title":"Survivability-oriented negotiation algorithms for multi-domain virtual networks","authors":"Rashid Mijumbi, J. Gorricho, J. Serrat, J. Rubio-Loyola, Ramón Agüero","doi":"10.1109/CNSM.2014.7014173","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014173","url":null,"abstract":"As network virtualisation continues to receive attention, recent proposals have advocated for survivability in network virtualisation environments (NVEs). However, research work within the same area has mainly focused on the single provider environment, leaving network survivability in multi-domain environments largely unexplored. In particular, survivability in heterogeneous physical networks raises questions with regard to the negotiation between competing parties so as to form coalitions for resource provisioning. In this paper, we propose a distributed negotiation algorithm which uses a system of entities to support survivability in a multi-domain NVE. The objective is to make each of the virtual network providers adaptive and dynamic by modelling them with capacity to perform QoS aware resource back-ups and/or restorations for physical link failures.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117301105","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014138
Xuan Liu, D. Medhi
Network virtualization allows flexibility to configure virtual networks in a dynamic manner. In such a setting, to provide resilient services to virtual networks, we consider the situation where the substrate network provider wants to have standby virtual routers ready to serve the virtual networks in the event of a failure. Such a failure can affect one or more virtual routers in multiple virtual networks. The goal of our work is to make the optimal selection of standby virtual routers so that virtual networks can be dynamically reconfigured back to their original topologies after a failure. We present an optimization formulation and a heuristic for this problem. By considering a number of factors, we present numerical studies to show how the optimal selection is affected. The results show that the proposed heuristic's performance was close to the optimization model when there were sufficient standby virtual routers for each virtual network and the substrate nodes have the capability to support multiple standby virtual routers to be in service, concurrently.
{"title":"Optimal standby virtual routers selection for node failures in a virtual network environment","authors":"Xuan Liu, D. Medhi","doi":"10.1109/CNSM.2014.7014138","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014138","url":null,"abstract":"Network virtualization allows flexibility to configure virtual networks in a dynamic manner. In such a setting, to provide resilient services to virtual networks, we consider the situation where the substrate network provider wants to have standby virtual routers ready to serve the virtual networks in the event of a failure. Such a failure can affect one or more virtual routers in multiple virtual networks. The goal of our work is to make the optimal selection of standby virtual routers so that virtual networks can be dynamically reconfigured back to their original topologies after a failure. We present an optimization formulation and a heuristic for this problem. By considering a number of factors, we present numerical studies to show how the optimal selection is affected. The results show that the proposed heuristic's performance was close to the optimization model when there were sufficient standby virtual routers for each virtual network and the substrate nodes have the capability to support multiple standby virtual routers to be in service, concurrently.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121703901","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014149
Olivier Tilmans, Stefano Vissicchio
One of the main concerns on SDN is relative to its ability to quickly react to network failures, while limiting both the control-plane overhead and the additional forwarding state kept by data-plane devices. Despite its practical importance, this concern is often overlooked in OpenFlow-based proposals. In this paper, we propose a new architecture, called IBSDN, in which a distributed routing protocol flanks OpenFlow to improve network robustness, reaction to failures, and controller scalability. In deeply exploring this idea, we complement our architecture with data-plane triggered mechanisms that improve its efficiency. We prove that the resulting solution ensures robustness for any combination of topological failures, and quickly reduces the path stretch. Finally, experimenting with a prototype implementation, we show that our approach is practical and overcomes the main limitations of previous work.
{"title":"IGP-as-a-backup for robust SDN networks","authors":"Olivier Tilmans, Stefano Vissicchio","doi":"10.1109/CNSM.2014.7014149","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014149","url":null,"abstract":"One of the main concerns on SDN is relative to its ability to quickly react to network failures, while limiting both the control-plane overhead and the additional forwarding state kept by data-plane devices. Despite its practical importance, this concern is often overlooked in OpenFlow-based proposals. In this paper, we propose a new architecture, called IBSDN, in which a distributed routing protocol flanks OpenFlow to improve network robustness, reaction to failures, and controller scalability. In deeply exploring this idea, we complement our architecture with data-plane triggered mechanisms that improve its efficiency. We prove that the resulting solution ensures robustness for any combination of topological failures, and quickly reduces the path stretch. Finally, experimenting with a prototype implementation, we show that our approach is practical and overcomes the main limitations of previous work.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128030367","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 : 2014-11-01DOI: 10.1109/CNSM.2014.7014159
K. Ravindran, Arun Adiththan, S. Mukhopadhyay
The paper considers the stability of AIMD-based rate adaptation algorithm for video transmission over a bandwidth-limited network path. We examine the stability aspects from two angles: first, a quick relief from congestion by a faster reduction of send rate, and second, a larger limit-cycle time with a slow rate reduction in the steady-state (and hence lower rate jitter). The stability assessment also considers the loss of feedback signals from the video receiver that indicate the packet loss on data channels. We provide a management-oriented assessment of the convergence properties of video rate control system. This in turn allows an autonomic adjustment of the AIMD parameters and the system controller models for optimal performance.
{"title":"Stability of video rate control algorithms over bandwidth-limited network paths","authors":"K. Ravindran, Arun Adiththan, S. Mukhopadhyay","doi":"10.1109/CNSM.2014.7014159","DOIUrl":"https://doi.org/10.1109/CNSM.2014.7014159","url":null,"abstract":"The paper considers the stability of AIMD-based rate adaptation algorithm for video transmission over a bandwidth-limited network path. We examine the stability aspects from two angles: first, a quick relief from congestion by a faster reduction of send rate, and second, a larger limit-cycle time with a slow rate reduction in the steady-state (and hence lower rate jitter). The stability assessment also considers the loss of feedback signals from the video receiver that indicate the packet loss on data channels. We provide a management-oriented assessment of the convergence properties of video rate control system. This in turn allows an autonomic adjustment of the AIMD parameters and the system controller models for optimal performance.","PeriodicalId":268334,"journal":{"name":"10th International Conference on Network and Service Management (CNSM) and Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121963337","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
扫码关注我们
求助内容：
应助结果提醒方式：