{"title":"Reliability-aware service provisioning in NFV-enabled enterprise datacenter networks","authors":"Long Qu, C. Assi, K. Shaban, Maurice J. Khabbaz","doi":"10.1109/CNSM.2016.7818411","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818411","url":null,"abstract":"Network Function Visualization (NFV) enables the complete decoupling of Network Functions (NFs) (e.g., firewall, intrusion detection, routing, etc.) from physical middleboxes used to implement service-specific and strictly ordered chains of these NFs. Precisely, NFV allows for dispatching NFs as plain software instances called Virtual Network Functions (VNFs) running on virtual machines hosted by one or more industry standard physical machines. This, however, introduces vulnerabilities (e.g., hard-/soft-ware failures, etc) causing the break down of the entire VNF chain. The functionality of NFV-enabled networks impose higher reliability requirements than traditional networks. This paper encloses an in-depth investigation of a reliability-aware joint VNF placement and flow routing optimization problem. This problem is formulated as a complex Integer Linear Program (ILP). A heuristic is proposed in order to overcome this ILP's complexity. Thorough numerical analysis are conducted to verify and assert the correctness and effectiveness of the proposed heuristic.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132112917","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}
Thomas Dandres, R. Samson, R. F. Moghaddam, K. Nguyen, M. Cheriet, Y. Lemieux
{"title":"The green sustainable telco cloud: Minimizing greenhouse gas emissions of server load migrations between distributed data centres","authors":"Thomas Dandres, R. Samson, R. F. Moghaddam, K. Nguyen, M. Cheriet, Y. Lemieux","doi":"10.1109/CNSM.2016.7818452","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818452","url":null,"abstract":"Among the innovative approaches to reduce the greenhouse gas (GHG) emissions of data centres during their use phase, electrical power from renewable sources appears promising. However, renewable electricity is often intermittent due to meteorological conditions. Consequently, the regional availability of renewable power varies constantly over time. This created the opportunity to deploy cloud computing systems relying on data centres located in different regions. Cloud computing technology enables real-time load migration to a data centre in the region where the GHG emissions per kWh are the lowest. While this approach is becoming popular to manage distributed data centres, there is still room for improvement in its implementation. Indeed, the consequences of data centre power demand migrations across electric networks and the resulting GHG emissions are usually neglected. In this project, we developed a novel GHG emission factor based on the sources of electricity affected by the server load migrations. Then, we used this emission factor in a simulation of distributed data centres to minimize their GHG emissions. Results show, the use of the novel emission factor enables an extra reduction of 23% of GHG emissions as compared to the usual approach.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131285532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CoFence: A collaborative DDoS defence using network function virtualization","authors":"Bahman Rashidi, Carol J. Fung","doi":"10.1109/CNSM.2016.7818412","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818412","url":null,"abstract":"With the exponential growth of the Internet use, the impact of cyber attacks are growing rapidly. Distributed Denial of Service (DDoS) attacks are the most common but damaging type of cyber attacks. Among them SYN Flood attack is the most common type. Existing DDoS defense strategies are encountering obstacles due to their high cost and low flexibility. The emerging of Network Function Virtualization (NFV) technology introduces new opportunities for low-cost and flexible DDoS defense solutions. In this work, we propose CoFence — a DDoS defense mechanism which facilitates a collaboration framework among NFV-based peer domain networks. CoFence allows domain networks help each others handle large volumes of DDoS attacks through resource sharing. Specifically, we focus on the resource allocation problem in the collaboration framework. Through CoFence a domain network decides the amount of resource to share with other peers based on a reciprocal-based utility function. Our simulation results demonstrate the designed resource allocation system is effective, incentive compatible, fair, and reciprocal.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128841532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Virtual machine priority adaption to enforce fairness among cloud users","authors":"P. Poullie, Stephan Mannhart, B. Stiller","doi":"10.1109/CNSM.2016.7818404","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818404","url":null,"abstract":"In recent years fairness problems in data centers have been pointed out and job/Virtual Machine (VM) scheduling has been chosen as a solution approach. Clouds are a special case of data centers, where resources are deployed by VMs in a highly dynamic manner during VM runtime. However, scheduling only allows influencing resource allocations, when VMs are instantiated, i.e., before runtime. Thus, runtime prioritization bears a great potential to manage cloud resources and promote fairness in clouds, especially, when VMs run over long periods. Nevertheless, runtime prioritization is not leveraged accordingly. This paper defines fairness as handicapping VMs of heavy users during runtime to allocate more resources to VMs of light users. Thereby, the need to make assumptions on user's utility functions is avoided, while different fairness notions can be captured by adapting the definition of heaviness. Guidelines for this definition are provided to ensure incentives to configure and utilize VMs adequately. Finally, OpenStack is extended in its implementation by a decentralized fairness service to enforce fairness according to this definition. The fairness service's functionality is certified by experiments in terms of overhead and fairness promotion.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133885128","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}
N. Bouten, Maxim Claeys, Bert Van Poecke, Steven Latré, F. Turck
{"title":"Dynamic server selection strategy for multi-server HTTP adaptive streaming services","authors":"N. Bouten, Maxim Claeys, Bert Van Poecke, Steven Latré, F. Turck","doi":"10.1109/CNSM.2016.7818403","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818403","url":null,"abstract":"HTTP Adaptive Streaming (HAS) has become the de facto standard technology for the delivery of video streaming services. Current adaptation heuristics for HAS focus on the selection of the optimal quality representation to be delivered from a single server. However, many content providers use multiple content servers storing replicas of the segmented video or are deployed over Content Delivery Networks (CDNs). Hence, the problem is not limited to selecting the optimal quality but also consists in requesting the segments from the best performing video server. In this paper a dynamic server selection strategy is proposed that enables the streaming client to select the optimal video delivery server. The proposed mechanism allows any quality adaptation algorithm to be plugged into it. The selection algorithm uses probability-based search strategies to explore the search space of available servers and to gain insights in their characteristics. This prevents the selection strategy to end up in a local optimum. To avoid buffer starvations, the exploration behavior is dependent on the current buffer filling. The proposed approach allows to achieve a Quality of Experience (QoE) that is within 25% of the optimum for which the client has a priori knowledge of the server characteristics.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132400034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. D. Corin, Pedro A. Aranda-Gutiérrez, Elisa Rojas, H. Karl, E. Salvadori
{"title":"Reusability of software-defined networking applications: A runtime, multi-controller approach","authors":"R. D. Corin, Pedro A. Aranda-Gutiérrez, Elisa Rojas, H. Karl, E. Salvadori","doi":"10.1109/CNSM.2016.7818419","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818419","url":null,"abstract":"The Software-Defined Networking (SDN) ecosystem is still characterized by a multitude of different controller platforms, each with its own programming model, execution model, and capabilities. This creates a danger of a controller lock-in for both developers of SDN control applications and operators of SDN networks. Since no single controller platform appears to dominate the ecosystem for the foreseeable future, there is a need for portability of control applications between different platforms. We propose an architecture based on executing multiple instances of different controller platforms concurrently in a network to provide the SDN code the environment it was written for. It is built around a controller-independent network event routing element called Network Engine that provides composition and conflict resolution. Results obtained in realistic scenarios demonstrate the feasibility of the proposed approach, which increases both developer productivity and operational flexibility. A preliminary prototype of the architecture is available for testing as an open source project.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125589075","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}
Arnamoy Bhattacharyya, Harsh V. P. Singh, Seyed Ali Jokar Jandaghi, C. Amza
{"title":"Online characterization of buggy applications running on the cloud","authors":"Arnamoy Bhattacharyya, Harsh V. P. Singh, Seyed Ali Jokar Jandaghi, C. Amza","doi":"10.1109/CNSM.2016.7818433","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818433","url":null,"abstract":"As Cloud platforms are becoming more popular, efficient resource management in these Cloud platforms helps the Cloud provider to deliver better quality of service to its customers. In this paper, we present an online characterization method that can identify potentially failing jobs in a Cloud platform by analyzing the jobs' resource usage profile as the job runs. We show that, by tracking the online resource consumption, we can develop a model through which we can predict whether or not a job will have an abnormal termination. We further show, using both real world and synthetic data, that our online tool can raise alarms as early as within the first 1/8th of the potentially failing job's lifetime, with a false negative rate as low as 4%. These alarms can become useful in implementing either one of the following resource-conserving Cloud management techniques: alerting clients early, de-prioritizing jobs that are likely to fail or assigning them less performant resources, deploying or up-regulating diagnostic tools for potentially faulty jobs.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123920460","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}
Arup Raton Roy, S. R. Chowdhury, Md. Faizul Bari, Reaz Ahmed, R. Boutaba
{"title":"Emulating an infrastructure with EASE","authors":"Arup Raton Roy, S. R. Chowdhury, Md. Faizul Bari, Reaz Ahmed, R. Boutaba","doi":"10.1109/CNSM.2016.7818413","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818413","url":null,"abstract":"In the last decade we have observed a tremendous adoption of distributed applications and a trend to host services in private or public clouds. However, service providers still need to own an infrastructure to test their applications or services. A similar problem is faced by network operators when they want to introduce a new service in their production network. It is very difficult to determine the behavior of a new application or service without deploying it in the production environment. Bugs or misconfiguration can cause service outage and trigger customer churn along with loss of reputation. There are several publicly available testbeds such as Emulab, GENI or OFELIA that allow users to lease physical and virtual resources for emulation. However, these testbeds do not provide performance guarantee. Acquisition of physical instances provides performance guarantee and isolation, but compromises overall system utilization. On the other hand, acquisition of virtualized instances lack guarantee and isolation resulting in an unrealistic emulation outcome. To address these limitations, we propose EASE, a next generation multi-tenant infrastructure emulator with an aim to maximize hardware utilization while providing performance guarantee, isolation and full-fledged support for SDN and NFV.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124153723","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}
Huu-Nghi Nguyen, Thomas Begin, A. Busson, I. G. Lassous
{"title":"Evaluation of an end-to-end delay estimation in the case of multiple flows in SDN networks","authors":"Huu-Nghi Nguyen, Thomas Begin, A. Busson, I. G. Lassous","doi":"10.1109/CNSM.2016.7818443","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818443","url":null,"abstract":"Though SDN (Software Defined Network) provides the executive building blocks for programming data-plane appliances, controller decisions must be grounded in an accurate outlook on the network topology and performance. In this context, we focus on the possibility of providing accurate measurements for the end-to-end (E2E) delay in SDN networks. In practice, like many variable quantities, a good description of the E2E delay requires characterizing its first two moments, i.e., expectation and variance. We propose to estimate the E2E delay by making use only of measurements collected locally on each node of the network. We extend a procedure that has been proposed to estimate the E2E delay in the case of one flow to handle the case of multiple competing flows. We compare its accuracy using several scenarios, with different types of traffic following real traces, different topologies and bandwidth. Also, an analysis of the computational and networking costs of our solution is proposed.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133858309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Predicting Web service response time percentiles","authors":"Yasaman Amannejad, Diwakar Krishnamurthy, B. Far","doi":"10.1109/CNSM.2016.7818402","DOIUrl":"https://doi.org/10.1109/CNSM.2016.7818402","url":null,"abstract":"Predicting Web service response time percentiles is often an important aspect of service level management exercises. Existing techniques can be very time consuming since they involve the manual construction of complex analytic or simulation models. To address this problem, we propose Prospective, a fully automated and data-driven approach for predicting Web service response time percentiles. Prospective relies on historical response time data collected from a Web service. Given a specification for workload expected at the Web service over a planning horizon, Prospective uses this historical data to offer predictions for response time percentiles of interest. At the core of Prospective is a lightweight simulator that uses collaborative filtering to estimate response time behaviour of the service based on behaviour observed historically. Results show that Prospective is able to predict various response time percentiles of interest with high accuracy for a wide variety of workloads.","PeriodicalId":334604,"journal":{"name":"2016 12th International Conference on Network and Service Management (CNSM)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133876731","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}