Laura Victoria Morales Medina, Andrés Felipe Murillo-Piedrahita, S. Rueda
{"title":"Extending the Floodlight Controller","authors":"Laura Victoria Morales Medina, Andrés Felipe Murillo-Piedrahita, S. Rueda","doi":"10.1109/NCA.2015.11","DOIUrl":"https://doi.org/10.1109/NCA.2015.11","url":null,"abstract":"Software Defined Networking (SDN) emerges as an option to implement security features difficult to develop and deploy in traditional network infrastructures. SDN has a programmable component that can build a global view of the actual state of a network and change network configuration to react to actual events: a controller. Additionally, a controller's functionality may be extended to meet specific requirements. This work studies the features that Floodlight, a Java based SDN controller, offers to extend its behavior. Previous works have studied Floodlight architecture and performance, but not these features. To meet the goal, we selected a known security context for traditional networks: DDoS detection and mitigation. This paper presents design and implementation of the CDM(Collection, Detection, and Mitigation) module, a statistical-based DDoS detection module that extends Floodlight. Statistical algorithms are a good fit for SDN, they have low memory and CPU demands, and can react to changes in network configuration. The module also uses Java features to establish an interface for statistical-based detection algorithms, enabling administrators to use libraries of algorithms and select some of them according to their systems. The results show that Floodlight is easy to extend and flexible. It is also efficient regarding CPU, but requires more memory than other controllers. The collection, detection, and mitigation algorithms run fast, although the time window required to detect statistical change bounds reaction times.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133437998","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":"On-Line Flows Classification of Video Streaming Applications","authors":"Ronit Nossenson, Shuval Polacheck","doi":"10.1109/NCA.2015.51","DOIUrl":"https://doi.org/10.1109/NCA.2015.51","url":null,"abstract":"Delivering video streaming services over a best-effort packet network, such as the Internet, is complicated by a number of factors including time-varying bandwidth, delay, and losses. Different solutions have been proposed to optimize Live video streaming (e.g., Multicast) and to optimize VOD streaming (e.g., Cache). Implementation of these solutions at an Internet service provider (ISP) network or at Content Data Network (CDN) can use on-line classification capability of video streaming flows (or sources) into Live streaming type and VOD streaming type to allow proper optimization. Since all streaming applications use the same streaming protocols, Deep Packet Inspection (DPI) technologies are practically useless in classifying such applications. In this paper we formulate the problem of on-line video-streaming flow classification. Then, we propose and evaluate two statistical on-line streaming flow classifiers. These classifiers are based on the statistical characterization of the flow packets length. Afterward, we study a slightly different video streaming classification problem, in which we can assume that there are at least X concurrent flows from the same video source, X>1. We propose and evaluate an on-line classifier that decides whether these X flows are Live or VOD. This classifier is based on a simple observation that live streaming flows from the same source transfer the same information almost at the same time, while VOD flows from the same source have larger information offset. The classifiers performance evaluation is based on real traffic dataset. Our single flow best classifier tags 96% of the streams correctly, while our multi-flow classifier successfully tags 96.53% of streams for X=2. We also demonstrate a more complex multi-streaming comparing function that improves the success rate of our algorithm to 97.53% for X>2, but it clearly decreases the algorithm scalability. Finally, additional contribution of this paper includes statistical characterization of live video streaming traffic vs. VOD streaming traffic.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115467134","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":"Optimizing Negative Caching for DNSSEC-Oblivious Resolvers","authors":"Zheng Wang","doi":"10.1109/NCA.2015.14","DOIUrl":"https://doi.org/10.1109/NCA.2015.14","url":null,"abstract":"A large amount of DNS queries ask for error names or error records, and therefore they are negatively answered. Those negative responses, however, are sub optimally cached by today's DNS and DNSSEC. This weakness of negative caching may exhibit low negative cache hit rate so as to be vulnerable to DoS/DDoS attacks utilizing name error queries. This paper proposes a high efficient Negative Caching for DNSSEC-Oblivious resolvers (NCDO). NCDO utilizes the concept of name space span featured by NSEC/NSEC3 record to indicate the coverage of domain name's nonexistence. Under NCDO, the NSEC/NSEC3 records received to prove the non-existence of a name could be reused to prove the non-existence of any name in the name range it spans. So negative cache hit rate and thereby response time can be significantly improved in most cases. Compared with DNSSEC, it is light-weighted due to a stripping away of any crypto graphical operations such as key management, zone signing, and record authentication. The by products of NCDO include the enhanced cache consistency through cache consistency checking and proactive updating. Trace-driven simulations show the effectiveness of NCDO in promoting negative cache hit rate.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"28 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941516","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":"Automated and Optimized FDD-Based Method to Fix Firewall Misconfigurations","authors":"Amina Saâdaoui, Nihel Ben Youssef, A. Bouhoula","doi":"10.1109/NCA.2015.31","DOIUrl":"https://doi.org/10.1109/NCA.2015.31","url":null,"abstract":"The firewall is a critical component of network security and is one of the most commonly used techniques to protect a network. Being based on a set of filtering rules, the accuracy and reliability of firewall protection heavily depend on the quality of the employed rule set. In this context, any mis configurations that arise between rules create ambiguity in classification of new traffic, not only affecting the performance of the firewall, but also putting the system in a vulnerable position. Manual management of this problem can be overwhelming and potentially inaccurate. Therefore, there is a need of automated methods to analyze, detect and fix mis configurations. Given these issues, algorithms and techniques have been proposed. Though these methods are useful for discovering and classifying anomalies, they still have limitations in term of the absence of the distinction between real mis configurations and intentional anomalies and in term of automatic correction of discovered mis configurations. In this paper, we present (1) a new classification of anomalies bringing out real mis configurations using a data structure (FDD) which facilitates mis configurations identification and resolution, (2) Optimal and totally automatic method to fix discovered mis configurations and (3) formal specification of proposed techniques using inference systems. The first results we obtained are very promising.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122434918","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}
G. P. R. Filho, J. Ueyama, Bruno S. Faiçal, G. Pessin, C. Farias, R. Pazzi, D. Guidoni, L. Villas
{"title":"An Energy-Aware System for Decision-Making in a Residential Infrastructure Using Wireless Sensors and Actuators","authors":"G. P. R. Filho, J. Ueyama, Bruno S. Faiçal, G. Pessin, C. Farias, R. Pazzi, D. Guidoni, L. Villas","doi":"10.1109/NCA.2015.30","DOIUrl":"https://doi.org/10.1109/NCA.2015.30","url":null,"abstract":"This work proposes an intelligent decision system for a residential infrastructure based on wireless sensors and actuator networks, called ResiDI. ResiDI is equipped with battery-powered nodes to ensure that they are deployable anywhere in the house without the need for wiring, drilling or any pre-existing infrastructure. The key intelligence of ResiDI is distributed in the decider nodes, which are able to make decisions locally without the need to send traffic from the sensor nodes to the sink. The network intelligence core is based on a neural network that seeks to improve the accuracy of the decision-making, together with a temporal correlation mechanism that is targeted at reducing the energy consumption. When compared with an approach adopted in the literature, the results show that ResiDI is efficient in different scenarios in all evaluations performed.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128645867","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}
Véronique Simon, Sébastien Monnet, Mathieu Feuillet, P. Robert, Pierre Sens
{"title":"Scattering and Placing Data Replicas to Enhance Long-Term Durability","authors":"Véronique Simon, Sébastien Monnet, Mathieu Feuillet, P. Robert, Pierre Sens","doi":"10.1109/NCA.2015.15","DOIUrl":"https://doi.org/10.1109/NCA.2015.15","url":null,"abstract":"Distributed storage systems have to ensure data availability and durability despite the occurrence of failures. To do so, many of them rely on replication mechanisms. We show that the layout of the data block copies on the nodes, chiefly the way the copies are scattered, has a major impact on the reparation speed and thus on the data loss ratio. In this paper, we propose an approach that provides the ability: (i) to finely tune the proportion of common content stored by the nodes, and (ii) to control the storage load distribution while creating new data block copies. We propose a simulation model that allows us to present a long-term study of the impact of the data block copies layout and the system's storage load on the data loss ratio.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122016425","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}
Amine Abidi, S. Gammar, F. Kamoun, W. Dabbous, T. Turletti
{"title":"Memory Management Optimization for Content Routers in DONA","authors":"Amine Abidi, S. Gammar, F. Kamoun, W. Dabbous, T. Turletti","doi":"10.1109/NCA.2015.48","DOIUrl":"https://doi.org/10.1109/NCA.2015.48","url":null,"abstract":"Nowadays, content retrieval is marking the Internet usage. User communications are no longer tied up to host interconnection. Information Centric Networking (ICN) models are proposed to cope with these changes. The new paradigm redesigns the Internet architecture to bring out content to the first level. Over the last decade, many key projects have proposed a large solution spectrum to rebuilt networking primitives focused on the content. One important and direct challenge of this shift is the large amount of routing states due to identifying contents rather than hosts. In this paper, we focus especially on DONA, one of the first ICN architecture, and analyse the required memory space to store routing states. Our study shows that today's technologies are not able to satisfy the content routing needs. Thus, we propose an enhancement of DONA called BADONA to deal with this problem. It uses the Bloom filter to drastically reduce the usage of the memory space. Finally, we evaluate our proposal performances to underscore its contribution.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137958","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}
Renan Pereira Araujo, F. S. Souza, J. Ueyama, L. Villas, D. Guidoni
{"title":"On the Analysis of Newman & Watts and Kleinberg Small World Models in Wireless Sensor Networks","authors":"Renan Pereira Araujo, F. S. Souza, J. Ueyama, L. Villas, D. Guidoni","doi":"10.1109/NCA.2015.39","DOIUrl":"https://doi.org/10.1109/NCA.2015.39","url":null,"abstract":"In this work, we study the design of a Wireless Sensor Network based on the Small world models. By modeling a sensor network with small world features, it is possible to decrease the average path length to interconnect the sink and sensor nodes. The goal of this work is to analysis the Newman & Watts and Kleinberg small world models in wireless sensor networks. The simulation results showed that both models are able to create a sensor network with small world features, however, the Newman & Watts model has better results regarding the path length, clustering coefficient and data communication latency. On the other hand, the Kleinberg model reduces more the energy consumption during data communication.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130610543","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 Metaheuristic Approach for the Virtual Network Embedding Problem_","authors":"S. Araújo, D. Guidoni, F. S. Souza","doi":"10.1109/NCA.2015.40","DOIUrl":"https://doi.org/10.1109/NCA.2015.40","url":null,"abstract":"Network virtualization is considered a key technique for the future internet, working as an alternative for the \"internet ossification\" problem. Virtualization technology is considered a new paradigm of networks, allowing multiple virtual networks to co-exist in a common physical substrate independently. In this context, the Virtual Network Embedding problem arises, consisting of mapping virtual nodes and links in the physical network components while respecting their capabilities. The problem belongs to the NP-hard class, and aiming to provide good solutions in feasible time, a metaheuristic approach is developed. When fault tolerance is taken into account, an extension of the problem leads to the resilient network embedding problem. Experimental results demonstrate the efficiency of the proposed method in comparison to literature methods and the trade off to provide resilience.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130061583","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}
S. Delaët, S. Dolev, D. Khankin, S. Tzur-David, Tomer Godinger
{"title":"Seamless SDN Route Updates","authors":"S. Delaët, S. Dolev, D. Khankin, S. Tzur-David, Tomer Godinger","doi":"10.1109/NCA.2015.24","DOIUrl":"https://doi.org/10.1109/NCA.2015.24","url":null,"abstract":"Software-Defined Networking (SDN) decouples the control and data planes, enabling limitless possibilities for implementing services and applications on top of the network abstraction layer. The centralized controller provides a real-time view of the entire underlying network infrastructure and therefore, management of the agile network becomes more simplified. This flexibility requires online routing updates, but during these updates, consistency has to be preserved, i.e., No packet losses or unrecognized duplications should occur. Moreover, routing updates should be done on the fly in an application-seamless fashion. Where no significant irregular delays or \"communication hiccups\" in packet arrivals are introduced due to the (frequent) updates. In this paper we present the first seamless consistency during on-the-fly routing updates, allowing the sender to send packets in an unchanged rate during the entire process, rate that is identical to the rate prior and after the update. The main idea is to use multicast on portions of the route, i.e., To send a packet both in the old and the new routes and only when the controller verifies the establishment and operation of the specific portion of the new route, it can remove the corresponding portion from the old route.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130060769","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}