{"title":"The actual cost of software switching for NFV chaining","authors":"M. C. Luizelli, D. Raz, Yaniv Sa'ar, Jose Yallouz","doi":"10.23919/INM.2017.7987296","DOIUrl":"https://doi.org/10.23919/INM.2017.7987296","url":null,"abstract":"Network Function Virtualization (NFV) is a novel paradigm that enables flexible and scalable implementation of network services on cloud infrastructure. An important enabler for the NFV paradigm is software switching, which should satisfy rigid network requirements such as high throughput and low latency. Despite recent research activities in the field of NFV, not much attention was given to understand the costs of software switching in NFV deployments. Existing approaches for traffic steering and orchestration of virtual network functions either neglect the cost of software switching or assume that it can be provided as an input, and therefore real NFV deployments of network services are often suboptimal. In this work, we conduct an extensive and in-depth evaluation that examines the impact of service chaining deployments on Open vSwitch - the de facto standard software switch for cloud environments. We provide insights on network performance metrics such as throughput, CPU utilization and packet processing, while considering different placement strategies of a service chain. We then use these insights to provide an abstract generalized cost function that accurately captures the CPU switching cost of deployed service chains. This cost is an essential building block for any practical optimized placement management and orchestration strategy for NFV service chaining.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114945640","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}
Manoel C. Silva Filho, Raysa L. Oliveira, C. C. Monteiro, Pedro R. M. Inácio, M. Freire
{"title":"CloudSim Plus: A cloud computing simulation framework pursuing software engineering principles for improved modularity, extensibility and correctness","authors":"Manoel C. Silva Filho, Raysa L. Oliveira, C. C. Monteiro, Pedro R. M. Inácio, M. Freire","doi":"10.23919/INM.2017.7987304","DOIUrl":"https://doi.org/10.23919/INM.2017.7987304","url":null,"abstract":"Cloud computing is an established technology to provide computing resources on demand that currently faces several challenges. Main challenges include management of shared resources, energy consumption, load balancing, resource provisioning and allocation, and fulfilment of service level agreements (SLAs). Due to its inherent complexity, cloud simulation is largely used to experiment new models and algorithms. This work presents CloudSim Plus, an open source simulation framework that pursues conformance to software engineering principles and object-oriented design in order to provide an extensible, modular and accurate tool. Based on the CloudSim framework, it aims to improve several engineering aspects, such as maintainability, reusability and extensibility. This work shows the benefits of CloudSim Plus, its particular features, how it ensures more accuracy, extension facility and usage simplicity.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123538012","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}
Tan N. Nguyen, Xavier Marchal, G. Doyen, Thibault Cholez, R. Cogranne
{"title":"Content Poisoning in Named Data Networking: Comprehensive characterization of real deployment","authors":"Tan N. Nguyen, Xavier Marchal, G. Doyen, Thibault Cholez, R. Cogranne","doi":"10.23919/INM.2017.7987266","DOIUrl":"https://doi.org/10.23919/INM.2017.7987266","url":null,"abstract":"Information Centric Networking (ICN) is seen as a promising solution to re-conciliate the Internet usage with its core architecture. However, to be considered as a realistic alternative to IP, ICN must evolve from a pure academic proposition deployed in test environments to an operational solution in which security is assessed from the protocol design to its running implementation. Among ICN solutions, Named Data Networking (NDN), together with its reference implementation NDN Forwarding Daemon (NFD), acts as the most mature proposal but its vulnerability against the Content Poisoning Attack (CPA) is considered as a critical threat that can jeopardize this architecture. So far, existing works in that area have fallen into the pit of coupling a biased and partial phenomenon analysis with a proposed solution, hence lacking a comprehensive understanding of the attack's feasibility and impact in a real network. In this paper, we demonstrate through an experimental measurement campaign that CPA can easily and widely affect NDN. Our contribution is threefold: (1) we propose three realistic attack scenarios relying on both protocol design and implementation weaknesses; (2) we present their implementation and evaluation in a testbed based on the latest NFD version; and (3) we analyze their impact on the different ICN nodes (clients, access and core routers, content provider) composing a realistic topology.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124190478","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":"Neev: A cognitive support agent for content improvement in hardware tickets","authors":"Nishtha Madaan, Gautam Singh, Arun Kumar, Gargi Dasgupta","doi":"10.23919/INM.2017.7987285","DOIUrl":"https://doi.org/10.23919/INM.2017.7987285","url":null,"abstract":"IT service providers differentiate themselves through offering after-sales support for hardware and software products. Thus, businesses, including large corporations, have intricate work-flows for servicing such support requests while reducing man-hours needed. These work-flows generally operate through a ticketing system for resolving customer issues. A lot of man-hours are spent in searching old tickets for correct problem and resolution for such issues. Support requests pertaining to enterprise hardware are more challenging than desktop support for end-user products. Enterprise hardware requires deeper diagnosis involving several systems and expertise of multiple agents. In this work we propose a cognitive agent, Neev, which helps in mitigating the problem in a three-fold fashion (1) retrieving a summary of relevant ticket text (2) Tagging the relevant parts as a part-of-the-problem or a part-of-the-solution (3) Focusing on the precise problem and solution. We evaluate the performance of our system using a rank-based metric where a ticket extraction is successful if the problem or solution occur in the top-n suggestions. We report the results for varying top-n values for both problem and solution on varying severity of the tickets. We find that the accuracy for problem extraction in top-1 is 62% and it reaches 86% and 94% for top-3 and top-5 cases, respectively. Furthermore, the accuracy for solution extraction reaches 62% and 88% for top-3 and top-8 cases, respectively.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132793742","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":"Hybrid Radio Frequency and Free Space Optical communication for 5G backhaul","authors":"Da Feng, Weiqiang Sun, Weisheng Hu","doi":"10.23919/INM.2017.7987343","DOIUrl":"https://doi.org/10.23919/INM.2017.7987343","url":null,"abstract":"5G backhaul requires high bandwidth and hybrid Radio Frequency/ Free Space Optical (RF/FSO) Communication offers Gbps links. The weather affects availability of both mmW RF and FSO links. Below cloud ceiling, the availability of hybrid RF/FSO link is above 85.7% and it can only be used for deadline-constrained large data transfers. At 17–22km above ground, the bit error rate of FSO links reaches below 10−3 and it can be used for delay-sensitive packet transfers. In this work, first, we propose a method to determine the required number of wavelengths and storage size for large data transfers and second, we propose a distributed implementation of automatic repeat request protocol to support 10Gbps bandwidth and millisecond delay for delay-sensitive packet transfers. The simulation results show the following: With link availability of 0.85, blocking rate of 0.05 can be achieved for large data transfers, which indicates 0.05 of the cost of transferring data over 5G dmW spectrum is necessary to guarantee deadline. The distributed implementation of automatic repeat request has similar performance with selective repeat. Both theoretical and simulation results show if load exceeds 0.9 of maximum load allowed by packet error probability, delay increases about 20% drastically.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131867425","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":"Efficient probing of heterogeneous IoT networks","authors":"Lionel Metongnon, E. C. Ezin, R. Sadre","doi":"10.23919/INM.2017.7987437","DOIUrl":"https://doi.org/10.23919/INM.2017.7987437","url":null,"abstract":"The Internet of Things leads to the inter-connectivity of a wide range of devices. This heterogeneity of hardware and software poses significant challenges to security. Constrained IoT devices often do not have enough resources to carry the overhead of an intrusion protection system or complex security protocols. A typical initial step in network security is a network scan in order to find vulnerable nodes. In the context of IoT, the initiator of the scan can be particularly interested in finding constrained devices, assuming that they are easier targets. In IoT networks hosting devices of various types, performing a scan with a high discovery rate can be a challenging task, since low-power networks such as IEEE 802.15.4 are easily overloaded. In this paper, we propose an approach to increase the efficiency of network scans by combining them with active network measurements. The measurements allow the scanner to differentiate IoT nodes by the used network technology. We show that the knowledge gained from this differentiation can be used to control the scan strategy in order to reduce probe losses.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114401114","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":"SDN policy-driven service chain placement in OpenStack","authors":"M. Stein, M. Scharf, V. Hilt","doi":"10.23919/INM.2017.7987374","DOIUrl":"https://doi.org/10.23919/INM.2017.7987374","url":null,"abstract":"Network functions virtualization requires automatic deployment and scaling of components. This raises the question of where to place instances of a function, for instance in the OpenStack cloud system. Data plane functions can forward large amounts of traffic. In this case, network-aware placement can avoid an inefficient use of host bandwidth, and a chain of functions can benefit from co-locating instances on a host. However, a practical challenge is that the bandwidth utilization or traffic demand matrix is not always known before the deployment of an instance. A promising remedy is to leverage existing Software Defined Networking (SDN) policies to derive connectivity weights between components. In this paper, we present this novel solution to the online instance placement problem. We have developed an extension of the OpenStack scheduler that uses SDN forwarding policies to rank potential hosts. For a given type of virtual machine, the corresponding forwarding policies can be retrieved from an SDN controller prior to the placement decision. Our prototype identifies potential communication peers and weighs the forwarding rules to prefer hosts that already run communication peers. We present heuristics for such weighing, and we also discuss limitations of the approach. A testbed implementation proofs that even in a simple example our solution can double the service chain throughput.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131067525","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":"Receive Buffer based Path Management for MPTCP in heterogeneous networks","authors":"Jinhwan Kim, Bong-Hwan Oh, Jaiyong Lee","doi":"10.23919/INM.2017.7987351","DOIUrl":"https://doi.org/10.23919/INM.2017.7987351","url":null,"abstract":"Multipath Transport Control Protocol (MPTCP) is a promising solution to support simultaneous transmission of packets through multiple paths. With bounded receive buffer and heterogeneous networks, MPTCP could suffer from degradation of its performances, undermining the advantage from multiple path transmission. In this paper, we propose a simple and effective method to manage the multiple paths of MPTCP, called Receive Buffer based Path Management (RBPM), which operates based on the available receive buffer size and dissimilar characteristics of multiple paths. The RBPM scheme estimates out-of-ordered packets, predicts the buffer blocking problem in advance and stops transferring over bad performance paths. We implement RBPM in the Linux kernel and evaluate its performances over a virtual network environment using NS-3 Direct Code Execution. The results show that the proposed scheme significantly improves the throughput and network utilization with bounded receive buffer in heterogeneous networks.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116738499","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":"Learning in SDN-based multi-tenant cellular networks: A game-theoretic perspective","authors":"Omer Narmanlioglu, E. Zeydan","doi":"10.23919/INM.2017.7987414","DOIUrl":"https://doi.org/10.23919/INM.2017.7987414","url":null,"abstract":"In order to cope with the challenges of increasing user bandwidth demands as well as create new revenues by offering innovative services and applications, Mobile Network Operators (MNOs) are willing to increase their networks' capabilities by making it more flexible, programmable and agile. MNOs are also seeking new technologies to benefit from recent advances in cloud for rapid deployments and elastically scaling services that cloud providers are mostly benefiting today. On one hand, Software-Defined Networking (SDN) concept can be helpful for enabling network infrastructure sharing/slicing and elasticity for “softwarization” of network elements. On the other hand, machine learning and game-theoretical concepts can also be utilized to address network management and orchestration needs of services and applications and improve network infrastructure's operational needs. In that regard, joint utilization of machine learning, game theoretical approaches and SDN concepts for network slicing can be beneficial to MNOs as well as infrastructure providers. In this paper, we utilize regret-matching based learning approach for efficient Radio Remote Head (RRH) assignments among MNOs in software-defined based cloud radio access network (C-RAN). Using game-theoretical approach, we demonstrate convergence of RRH allocations to mixed strategy Nash equilibrium and present significant performance improvements compared to traditional assignment approach.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122136201","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 distributed NFV orchestrator based on BDI reasoning","authors":"Frederico Schardong, Ingrid Nunes, A. E. S. Filho","doi":"10.23919/INM.2017.7987270","DOIUrl":"https://doi.org/10.23919/INM.2017.7987270","url":null,"abstract":"Network function virtualisation (NFV) decouples network functions from physical devices, simplifying the deployment of new services. As opposed to traditional middleboxes, VNFs can be dynamically deployed and reconfigured on demand, posing strict management challenges to networked systems. Selecting VNFs from a repository, defining where they will be placed in the virtualised network as well as chaining them to achieve the desired behaviour are problems that have to be tackled by an orchestrator. In this paper, we propose a distributed approach to NFV orchestration using belief-desire-intention (BDI) reasoning, addressing the selection, placement and chaining problems through the interaction among autonomous software agents, which collectively work in a distributed and decentralised manner. Agents are capable of bidding on the allocation of resources for new VNFs, as well as managing the chaining of VNFs. Further, we validate our theoretical model through a DDoS attack case study, in which we analyse the emergent behaviour of the autonomous agents.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125790152","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}