{"title":"Network-based mimicry anomaly detection using divergence measures","authors":"S. Pukkawanna, Y. Kadobayashi, S. Yamaguchi","doi":"10.1109/ISNCC.2015.7238570","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238570","url":null,"abstract":"To evade detection by network-based anomaly detectors, sophisticated attackers are trying to make their malicious traffic resemble legitimate traffic by running attacks through ports used on a daily basis (e.g., port 80 for HTTP). This mimicry traffic is potentially neglected by detectors. In this paper, we propose a Kullback-Leibler (KL) divergence-based method for detecting anomalous traffic mimicking legitimate traffic. Our method firstly observes the port pair distribution of traffic flows, which is a novel statistical traffic feature proposed in this work. Secondly, our method computes the KL divergence between the port pair distributions of the current and previous time intervals. Our method starts to find anomalous flows when the KL divergence deviates from a specified threshold. We tested the performance of our method with traffic which was mixed by four synthetic mimicry anomalies and real-world backbone traffic. The results indicated that our method could precisely detect all synthetic anomalies. Furthermore, our method additionally revealed six real-world anomalies that were hidden in the testing backbone traffic.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121205897","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}
B. Amel, R. Bouhouch, J. Houda, S. Hasnaoui, K. Jelassi
{"title":"Data distribution service on top of Ethernet networks","authors":"B. Amel, R. Bouhouch, J. Houda, S. Hasnaoui, K. Jelassi","doi":"10.1109/ISNCC.2015.7238583","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238583","url":null,"abstract":"Data Distribution Service (DDS) middleware has become one of the best solutions for real-time distributed industrial systems. An interesting innovation would be the use of the DDS middleware on top of Ethernet networks to enhance the performances of automobile applications. In this paper, we will introduce the use of DDS on top of Ethernet networks and propose as a testing application an extended SAE (Society of Automotive Engineers) benchmark. The main aim is to be able to calculate the worst case response time (WCRT) based on a scheduling model, and using it as a metric to evaluate the respected of DDS real-time QoS (Quality of Service).","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131505689","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}
Hatem Ibn-Khedher, Emad Abd-Elrahman, H. Afifi, Jacky Forestier
{"title":"Network issues in virtual machine migration","authors":"Hatem Ibn-Khedher, Emad Abd-Elrahman, H. Afifi, Jacky Forestier","doi":"10.1109/ISNCC.2015.7238579","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238579","url":null,"abstract":"Software Defined Networking (SDN) is based basically on three features: centralization of the control plane, programmability of network functions and traffic engineering. The network function migration poses interesting problems that we try to expose and solve in this paper. Content Distribution Network virtualization is presented as use case.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114471350","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 Skyline computation for optimal service composition with fuzzy preference relationships","authors":"Fatma Rhimi, S. B. Yahia, S. Ahmed","doi":"10.1109/ISNCC.2015.7238580","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238580","url":null,"abstract":"Service composition is arising as an effective process to ensure the integration of multiple atomic web services in order to create customized composite web services. However, the exploding number of the deployed service candidates that is constantly increasing makes the process of choosing the best service candidates an important challenge. When there are multiple web services that offer the same functionalities, we need to select the best one according to its non-functional criteria (e.g. response time, price, reliability). Skyline is a technique that helps reducing the size of our search space and comes as a complementary approach to the optimization methods. In fact, Skyline consists in preselecting the best candidates in the search space according to their non-functional criteria. Most of the current Skyline computation relies on a strict dominance relationship called Pareto-dominance. In this paper, we propose a new method to compute the Skyline points with a fuzzy approach which allows taking into consideration the users preferences. We will through this paper show how we could construct a consistent fuzzy model to overcome the limitations of web service composition computation. Experimental evaluation demonstrates the effectiveness of the proposed concept and the efficiency of our implementation.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127023767","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":"Collaborative distributed editing (Real number based indexation)","authors":"Mumtaz Ahmad","doi":"10.1109/ISNCC.2015.7238587","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238587","url":null,"abstract":"With the rapid advancement of mobile technology, decentralized collaborative editing is becoming more complex and care taking. For such system, concurrent replicated data structure requires assurance of some important properties like out-of-order execution of concurrent operations and data convergence. In this paper, we introduce a novel linear data structure based on unique identifier scheme for indexed communication. These identifiers are real numbers with a specific controlled pattern of precision. Our data structure preserves easily data convergence, gives good performance and avoids overheads as compared to existing approaches. We implement our idea successfully.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207345","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}
Chourouk Hammami, A. Gazdar, I. Jemili, A. Belghith
{"title":"Study of VOD streaming on BitTorrent","authors":"Chourouk Hammami, A. Gazdar, I. Jemili, A. Belghith","doi":"10.1109/ISNCC.2015.7238581","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238581","url":null,"abstract":"Nowadays, the Peer-to-Peer (P2P) Video-on-Demand (VOD) systems knows a huge success for several reasons: a) each peer is both server and client leading to scalable system, b) it is not necessary to build and maintain infrastructures. BitTorrent is the most popular P2P file sharing protocols due to its effectiveness in the delivery of content. Thus, many VoD protocols have been proposed based on it. They investigate new ways for pieces and neighbor peers selections to assure the tight displaying time deadlines of video frames. In this paper, we present an up-to-date literature review of the main P2P VoD works based on the BitTorrent protocol. Furthermore, we propose a taxonomy of these works considering the pieces and the peers selection algorithms criterions.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133764489","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":"Adaptive web service composition insuring global QoS optimization","authors":"Olfa Hammas, S. B. Yahia, S. Ahmed","doi":"10.1109/ISNCC.2015.7238593","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238593","url":null,"abstract":"Web services composition consists of combining web services features in order to respond to complex requests. Giving the large and exponentially growing number of web services offering similar features, services selection should be QoS-driven. Besides, the composition should also support and adapt to dynamic changes occurring during the composite service execution. In this context, this paper proposes an architecture supporting dynamic composition and global QoS Optimization. It also proposes an Ant Colony Optimization based algorithm for the QoS aware service selection.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987768","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":"CDS based reliable topology control in WSNs","authors":"Enan A. Khalil, S. Özdemir","doi":"10.1109/ISNCC.2015.7238569","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238569","url":null,"abstract":"Wireless Sensor Networks (WSNs) have become increasingly popular in recent years for controlling systems where human intervention is undesirable or impossible. There is no fixed or planned infrastructure for WSNs. Therefore, Virtual Backbone (VB) is currently used to support topology control, efficient routing and broadcast communication in WSNs. A Connected Dominating Set (CDS) is a promising candidate solution for constructing a VB stimulated by different characteristics of WSNs. To the best of our knowledge; all related work employ heuristic and/or meta-heuristic optimizations for formulating CDSs in WSNs by considering contradictory design features. However; no work reported that tackles with the data reliability of WSN while formulating the CDS. The main contribution of this paper is to address the reliability problem of WSN where the topology is controlled by CDS using a probabilistic network model (PNM). The existing work on CDS considers only reliability among dominators regardless of dominatees reliability. We considered both dominators and dominatees reliability to improve overall reliability of the network. The network model used in this paper is more realistic compared to previous work by employing uncertainty measure, probabilistic parameters and Euclidean distance between the source and destination. We first aim to study how to formulate and maintain an Evolutionary based - CDS considering the main design features of WSNs, i.e. reliability and energy efficiency. The performance of the protocol is evaluated by extensive simulation and compared with RMCDS-GA and Greedy area - mCDS. We found that our protocol yields better trade-off between network reliability and the size of CDS.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134495937","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":"Energy aware routing protocol for inter WBANs cooperative Communication","authors":"A. Manirabona, S. Boudjit, L. Chaari","doi":"10.1109/ISNCC.2015.7238582","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238582","url":null,"abstract":"Monitoring systems using Wireless Body Area Networks (WBANs) are becoming more and more popular and widely used to respond to the increasing demand in real time healthcare applications. When operating in group, the WBANed people could form an ad-hoc network remotely monitored via Internet, help each other to relay their data and thus prolong their lifetime. In fact, if a BAN coordinator reaches critical energy level or gets battery depletion or else connection loss, the all WBAN will cope with the data transmission interruption. Fortunately, WBANs cooperation is a promising solution to overcome this issue. In this paper we propose a routing protocol intending to help a group of WBANs to cooperate for relaying packets according to energy and connection issues. The main goal is to provide to WBANs sensors a technique to deliver their data even when the coordinator's battery is very low or depleted or else the connection to the access point is lost or weak while balancing energy consumption between cooperating coordinators. Therefore, the energy threshold technique is used. Simulation results show interesting performances in terms of lifetime about 30% and data delivery about 20% in average.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"388 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123526863","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}
Ibrahim Yonis Omar, R. Laborde, A. Wazan, F. Barrère, A. Benzekri
{"title":"G-Cloud on Openstack: Adressing access control and regulation requirements","authors":"Ibrahim Yonis Omar, R. Laborde, A. Wazan, F. Barrère, A. Benzekri","doi":"10.1109/ISNCC.2015.7238578","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238578","url":null,"abstract":"It is well known that e-Government applications bring several benefits to citizens in terms of efficiency, accessibility and transparency. Today, most of governments tend to propose cloud computing based e-services to their citizens. A key component in these services is the access control management issue. In this paper, we present our research works for building an access control system for the Djiboutian e-Government project that is built using Openstack framework. Specifically, we demonstrate the limitation of the integrated access control system in Openstack for the Djiboutian e-Government access control requirements and for the compliance to the related regulation. Thus, we propose to extend the existing access control system of Openstack by integrating the features of the XACML V3 to the Openstack framework.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124055280","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}