Carlos Hernan Tobar Arteaga, Fulvio Risso, O. Rendón
{"title":"An adaptive scaling mechanism for managing performance variations in network functions virtualization: A case study in an NFV-based EPC","authors":"Carlos Hernan Tobar Arteaga, Fulvio Risso, O. Rendón","doi":"10.23919/CNSM.2017.8255982","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255982","url":null,"abstract":"The scaling is a fundamental task that allows addressing performance variations in Network Functions Virtualization (NFV). In the literature, several approaches propose scaling mechanisms that differ in the utilized technique (e.g., reactive, predictive and machine learning-based). The scaling in NFV must be accurate both at the time and the number of instances to be scaled, aiming at avoiding unnecessary procedures of provisioning and releasing of resources; however, achieving a high accuracy is a non-trivial task. In this paper, we propose for NFV an adaptive scaling mechanism based on Q-Learning and Gaussian Processes that are utilized by an agent to carry out an improvement strategy of a scaling policy, and therefore, to make better decisions for managing performance variations. We evaluate our mechanism by simulations, in a case study in a virtualized Evolved Packet Core, corroborating that it is more accurate than approaches based on static threshold rules and Q-Learning without a policy improvement strategy.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127575681","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}
Ensar Zeljković, Tom De Schepper, Patrick Bosch, Ian Vermeulen, J. Haxhibeqiri, J. Hoebeke, J. Famaey, Steven Latré
{"title":"ORCHESTRA: Virtualized and programmable orchestration of heterogeneous WLANs","authors":"Ensar Zeljković, Tom De Schepper, Patrick Bosch, Ian Vermeulen, J. Haxhibeqiri, J. Hoebeke, J. Famaey, Steven Latré","doi":"10.23919/CNSM.2017.8255999","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255999","url":null,"abstract":"Local area networks (LANs) are employed by a plethora of heterogeneous consumer devices, equipped with the ability to connect to the Internet using a variety of different wireless network technologies. Existing solutions and the lower layers of the OSI stack are unfit to cope with this heterogeneity. For instance, dynamical inter-technology switching is user-of application-based. We propose the ORCHESTRA framework to manage the different devices in heterogeneous wireless local area networks (WLANs) and introduce capabilities such as packet-level dynamic and intelligent handovers (both inter- and intratechnology), load balancing, replication, and scheduling. The framework consists of a controller that is capable of communicating with both existing Software-Defined Networking (SDN) and Network Function Virtualization (NFV) controllers and with devices containing a newly introduced virtual Medium Access Control (MAC) layer. We show that the virtual MAC enables transparent and real-time inter-technology handovers and that our solution scales up to two thousands of clients.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128384102","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}
Abdelhamid Alleg, T. Ahmed, M. Mosbah, R. Riggio, R. Boutaba
{"title":"Delay-aware VNF placement and chaining based on a flexible resource allocation approach","authors":"Abdelhamid Alleg, T. Ahmed, M. Mosbah, R. Riggio, R. Boutaba","doi":"10.23919/CNSM.2017.8255993","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255993","url":null,"abstract":"Network Function Virtualization (NFV) is a promising technology that is receiving significant attention in both academia and the industry. NFV paradigm proposes to decouple Network Functions (NFs) from dedicated hardware equipment, offering a better sharing of physical resources and providing more flexibility to network operators. However, in such environment, efficient management mechanisms are crucial to address the problem of Placement and Chaining of Virtual Network Functions (PC-VNF). In this paper, we introduce a PC-VNF model based on a flexible resource allocation approach that takes into account service requirements in terms of latency, in addition to traditional connectivity and resource utilization. This is particularly important for emerging 5G services such as ultrareliable, low latency and massive machine type communications. The end-to-end performance needs to meet the user expectations as well as service requirements to provide the desired QoS/QoE. Our main goal is to determine the optimal VNF placement minimizing resource consumption while providing specific latency (i.e., end-to-end delay) and avoiding violation of Service Level Agreements (SLA) by constraining allocated resources to a given VNF to reach its required performance. Results show that our approach achieves the required latency with better resources utilization compared to the classical approaches, with a reduction of up to 40% of resource consumption and a higher rate of accepted requests by recovering 15 to 60 % of the rejected requests.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130255994","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}
Radu Carpa, M. Assunção, Olivier Glück, L. Lefèvre, J. Mignot
{"title":"Evaluating the impact of SDN-induced frequent route changes on TCP flows","authors":"Radu Carpa, M. Assunção, Olivier Glück, L. Lefèvre, J. Mignot","doi":"10.23919/CNSM.2017.8256021","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256021","url":null,"abstract":"Traffic engineering technologies such as MPLS have been proposed to adjust the paths of data flows according to network availability. Although the time interval between traffic optimisations is often on the scale of hours or minutes, modern SDN techniques enable reconfiguring the network more frequently. It is argued, however, that changing the paths of TCP flows too often could severely impact their performance by incurring packet loss and reordering. This work analyses and evaluates the impact of frequent route changes on the performance of TCP flows. Experiments carried out on a network testbed show that rerouting a flow can affect its throughput when reassigning it a path either longer or shorter than the original path. Packet reordering has a negligible impact when compared to the increase of RTT. Moreover, constant rerouting influences the performance of the congestion control algorithm. Designed to assess the limits on SDN-induced reconfiguration, a scenario where the traffic is rerouted every 0.1s demonstrates that the throughput can be as low as 35% of that achieved without rerouting.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117212617","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}
Chun-Ming Lai, Xiaoyun Wang, Yunfeng Hong, Yu-Cheng Lin, S. F. Wu, P. Mcdaniel, H. Çam
{"title":"Attacking strategies and temporal analysis involving Facebook discussion groups","authors":"Chun-Ming Lai, Xiaoyun Wang, Yunfeng Hong, Yu-Cheng Lin, S. F. Wu, P. Mcdaniel, H. Çam","doi":"10.23919/CNSM.2017.8256040","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256040","url":null,"abstract":"Online social network (OSN) discussion groups are exerting significant effects on political dialogue. In the absence of access control mechanisms, any user can contribute to any OSN thread. Individuals can exploit this characteristic to execute targeted attacks, which increases the potential for subsequent malicious behaviors such as phishing and malware distribution. These kinds of actions will also disrupt bridges among the media, politicians, and their constituencies. For the concern of Security Management, blending malicious cyberattacks with online social interactions has introduced a brand new challenge. In this paper we describe our proposal for a novel approach to studying and understanding the strategies that attackers use to spread malicious URLs across Facebook discussion groups. We define and analyze problems tied to predicting the potential for attacks focused on threads created by news media organizations. We use a mix of macro static features and the micro dynamic evolution of posts and threads to identify likely targets with greater than 90% accuracy. One of our secondary goals is to make such predictions within a short (10 minute) time frame. It is our hope that the data and analyses presented in this paper will support a better understanding of attacker strategies and footprints, thereby developing new system management methodologies in handing cyber attacks on social networks.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126115228","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}
Ehsan Poormohammady, J. Reelfs, Mirko Stoffers, Klaus Wehrle, Apostolos Papageorgiou
{"title":"Dynamic algorithm selection for the logic of tasks in IoT stream processing systems","authors":"Ehsan Poormohammady, J. Reelfs, Mirko Stoffers, Klaus Wehrle, Apostolos Papageorgiou","doi":"10.23919/CNSM.2017.8256009","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256009","url":null,"abstract":"Various Internet of Things (IoT) and Industry 4.0 use cases, such as city-wide monitoring or machine control, require low-latency distributed processing of continuous data streams. This fact has boosted research on making Stream Processing Frameworks (SPFs) IoT-ready, meaning that their cloud and IoT service management mechanisms (e.g., task placement, load balancing, algorithm selection) need to consider new requirements, e.g., ultra low latency due to physical interactions. The algorithm selection problem refers to selecting dynamically which internal logic a deployed streaming task should use in case of various alternatives, but it is not sufficiently supported in current SPFs. To the best of our knowledge, this work is the first to add this capability to SPFs. Our solution is based on i) architectural extensions of typical SPF middleware, ii) a new schema for characterizing algorithmic performance in the targeted context, and iii) a streaming-specific optimization problem formulation. We implemented our solution as an extension to Apache Storm and demonstrate how it can reduce stream processing latency by up to a factor of 2.9 in the tested scenarios.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125132543","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}
Saeed Arezoumand, Kristina Dzeparoska, H. Bannazadeh, A. Leon-Garcia
{"title":"MD-IDN: Multi-domain intent-driven networking in software-defined infrastructures","authors":"Saeed Arezoumand, Kristina Dzeparoska, H. Bannazadeh, A. Leon-Garcia","doi":"10.23919/CNSM.2017.8256016","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256016","url":null,"abstract":"Intent-Driven Networking is recently gaining interest, with all major SDN control platforms now providing an intent Northbound Interface (NBI) as a high-level abstraction for network management. With these frameworks network operators can conveniently define “what needs to be done”, rather than “how it should be done”. Current IDN frameworks pose two main limitations that affect deployment in production grade and multi-domain networks. They are mainly concerned with a single network domain, and thus enabling end-to-end network intents over a multi-domain and large-scale setup is still a challenge. Furthermore, these frameworks do not consider any differentiation between user intents and provider intents, and a limited set of intent classes are available for both. In this paper we present MD-IDN, which provides an intent framework for the users of multi-domain cloud infrastructures. We first propose a graph-based abstraction model for user-defined intents and a generic intent compilation process. Then, we propose compilation algorithms to achieve scalability in multi-domain networks: First, user-defined intents get processed over an abstracted multi-graph of network domains and their interconnections, and a set of local intents will be generated for each of the involved domains. Afterwards, the local intents will be compiled and installed in local regions in parallel. MD-IDN is deployed as a public service in the SAVI Testbed over more than ten data centers spanning across Canada. In multi-domain environments, our experiments show that MD-IDN outperforms current practices that compile intents over a flat network topology.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133751204","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}
Martín Barrère, Rodrigo Vieira Steiner, Rabih Mohsen, Emil C. Lupu
{"title":"Tracking the bad guys: An efficient forensic methodology to trace multi-step attacks using core attack graphs","authors":"Martín Barrère, Rodrigo Vieira Steiner, Rabih Mohsen, Emil C. Lupu","doi":"10.23919/CNSM.2017.8256038","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256038","url":null,"abstract":"In this paper, we describe an efficient methodology to guide investigators during network forensic analysis. To this end, we introduce the concept of core attack graph, a compact representation of the main routes an attacker can take towards specific network targets. Such compactness allows forensic investigators to focus their efforts on critical nodes that are more likely to be part of attack paths, thus reducing the overall number of nodes (devices, network privileges) that need to be examined. Nevertheless, core graphs also allow investigators to hierarchically explore the graph in order to retrieve different levels of summarised information. We have evaluated our approach over different network topologies varying parameters such as network size, density, and forensic evaluation threshold. Our results demonstrate that we can achieve the same level of accuracy provided by standard logical attack graphs while significantly reducing the exploration rate of the network.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"3 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113967717","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":"A path planning method of wireless sensor networks based on service priority","authors":"Peng Li, Siya Xu, Kang Sun, Xue-song Qiu, F. Qi","doi":"10.23919/CNSM.2017.8255984","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8255984","url":null,"abstract":"Life-time represents the effective survival time of network, which is significant when measuring the performance of wireless sensor networks (WSNs). Therefore, it is so important to extend network life-time by planning appropriate path based on energy consumption and remaining energy of wireless sensors. In this paper, a path planning method of WSNs based on service priority is proposed, and a customized Dijkstra algorithm is used to solve this problem. This method minimizes the total energy consumption of network while balancing remaining energy of all nodes in network, and through the sacrifice of network delay in exchange for extension of life-time. The simulation results show that our method not only prolongs network life-time compared to shortest-path algorithm but also improves network reliability.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116347509","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":"Network-integrated edge computing orchestrator for application placement","authors":"Vasileios Karagiannis, Apostolos Papageorgiou","doi":"10.23919/CNSM.2017.8256008","DOIUrl":"https://doi.org/10.23919/CNSM.2017.8256008","url":null,"abstract":"In an effort to detach applications from centralized clouds with high latency responses, service providers turn their attention to edge computing solutions that offer low latency and improved user experience. Existing edge deployment strategies use network-related information as decision basis, but their design and their placement logic are biased by the assumption that the network cannot be controlled. In this paper, we design an orchestrator that operates within the telecom infrastructure and assumes cooperation with access and core network controllers. As a result, network adjustments can be requested, which leads to an orchestrator that participates in the provisioning of resources and solves an optimization problem that — contrary to the state of the art-performs sequential component placement and does not assume a known or fixed replication degree of the applications. Its function relies on heuristics, including one based on pre-computed shortest paths, which runs in polynomial time (i.e., much faster than an exhaustive search) and finds the optimal solution in approximately 99% of the tested scenarios.","PeriodicalId":211611,"journal":{"name":"2017 13th International Conference on Network and Service Management (CNSM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302328","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}