DCNET 2016 Abstracts


Full Papers
Paper Nr: 8
Title:

Analyzing Gateways’ Impact on Caching for Micro CDNs based on CCN

Authors:

César Bernardini and Bruno Crispo

Abstract: Content Centric Networking (CCN) is a new architecture for a future Internet. CCN is a clean-state architecture that targets the distribution of content. As such, content is located at the heart of the architecture and CCN includes two main features: communication led by names and caches everywhere. Nevertheless, CCN has been criticized due to the economical cost of replacing every IP router with a CCN router. As such, we assume that CCN will be used for small content delivery networks –Micro CDNs– located in the ISP facilities: it has already been shown that with only 100MB of caches in the ISP facilities, the ISP traffic to the Internet can be reduced by 25%. As a matter of fact, if CCN is deployed as a Micro CDN, gateways must exist to interconnect the CDN network with the Internet. In this paper, we study the advantages of using multiple gateways against a single gateway and its impact on the caching features. Our results show that multiple gateways are beneficial not only because they improve the performance of caches but also because the load of the network get distributed across several nodes.

Paper Nr: 13
Title:

Do-it-yourself LocalWireless Networks: A Multidimensional Network Analysis of Mobile Node Social Aspects

Authors:

Annalisa Socievole and Salvatore Marano

Abstract: The emerging paradigm of Do-it-yourself (DIY) networking is increasingly taking the attention of research community on DTNs, opportunistic networks and social networks since it allows the creation of local humandriven wireless networks outside the public Internet. Even when Internet is available, DIY networks may form an interesting alternative option for communication encouraging face-to-face interactions and more ambitious objectives such as e-participation and e-democracy. The aim of this paper is to analyze a set of mobility traces describing both local wireless interactions and online friendships in different networking environments in order to explore a fundamental aspect of these social-driven networks: node centrality. Since node centrality plays an important role in message forwarding, we propose a multi-layer network approach to the analysis of online and offline node centrality in DIY networks. Analyzing egocentric and sociocentric node centrality on the social network detected through wireless encounters and on the corresponding Facebook social network for 6 different real-world traces, we show that online and offline degree centralities are significantly correlated on most datasets. On the contrary, betweenness, closeness and eigenvector centralities show medium-low correlation values.

Paper Nr: 14
Title:

Parallel Multi-path Forwarding Strategy for Named Data Networking

Authors:

Bouacherine Abdelkader, Mustapha Reda Senouci and Billal Merabti

Abstract: Named Data Networking (NDN) is one of the most promising instantiations of the Information Centric Networking (ICN) philosophy. This new design needs a new thinking due to the fact that the definitions of some concepts used in TCP/IP paradigm are no longer appropriate. In this context, flow and fairness concepts are examined and new perspectives are proposed. An important literature exists about forwarding strategies and congestion control in NDN context. Unfortunately, the lack of definitions pushed many researchers to use the TCP/IP heritage. As a consequence, they neither fully benefit from the native multi-path support nor address the fairness problem. In order to overcome such a drawback and to meet end-users fairness while optimizing network throughput, a new Parallel Multi-Path Forwarding Strategy (PMP-FS) is proposed in this paper. The PMP-FS proactively splits traffic by determining how the multiple routes will be used. It takes into consideration NDN in-network caching and NDN Interest aggregation features to achieve weighted alpha fairness among different flows. Obtained preliminary results show that PMP-FS looks promising.

Paper Nr: 20
Title:

A Comparative Study of Android Malware Behavior in Different Contexts

Authors:

Catherine Boileau, Francois Gagnon, Jérémie Poisson, Simon Frenette and Mohamed Mejri

Abstract: One of the numerous ways of addressing the Android malware threat is to run malicious applications in a sandbox environment while monitoring metrics. However, dynamic malware analysis is usually concerned with a one-time execution of an application, and information about behaviour in different environments is lacking in the literature. We fill this gap with a fuzzy-like approach to the problem: by running the same malware multiple times in different environments, we gain insight on the malware behaviour and his peculiarities. To implement this approach, we leverage a client-server sandbox to run experiments, based on a common suit of actions. Scenarios are executed multiple times on a malware sample, each time with a different parameter, and results are compared to determine variation in observed behaviour. In our current experiment, variation was introduced by different levels of simulation, allowing us to compare metrics such as failure rate, data leakages, sending of SMS, and the number of HTTP and DNS requests. We find the behaviour is different for data leakages, which require no simulation to leak information, while all results for other metrics were higher when simulation was used in experiments. We expect that a fuzzing approach with others parameters will further our understanding of malware behaviour, particularly for malware bound to such parameters.

Short Papers
Paper Nr: 11
Title:

A WSN-based, RSS-driven, Real-time Location Tracking System for Independent Living Facilities

Authors:

Pawel Gburzynski, Wlodek Olesinski and Jasmien Van Vooren

Abstract: We present an indoor location tracking system (RTLS) based on a wireless sensor network (WSN) where the received signal strength (RSS) readings collected by immobile nodes (Pegs) from mobile (tracked) nodes (Tags) are translated into location estimates for the Tags. The process employs a database of samples previously collected from known locations; thus, the scheme falls into the category of profile-based solutions, with RSS readings being the only kind of input to the estimator. Compared to other schemes hinged on the same general idea, the novelty of our approach consists in systematically taking advantage of multiple transmit power levels at the Tags. This allows us to effectively emulate RFID-type of operation, when a nearby Peg can authoritatively identify the location by perceiving a weak signal from the Tag (indicative of the Tag’s immediate proximity), while otherwise falling back to elaborate fitting of multiple readings (collected by several Pegs) to produce a (possibly approximate) location estimate. The location service of our network is an add on to its other duties which consist in providing connectivity within an independent living (IL) facility for the purpose of inconspicuously monitoring the patients, detecting anomalies, signaling alarms, and so on.

Paper Nr: 15
Title:

TCP Wave Resilience to Link Changes - A New Transport Layer Approach Towards Dynamic Communication Environments

Authors:

A. Abdelsalam, M. Luglio, C. Roseti and F. Zampognaro

Abstract: In case of hybrid access networks, the selected link can suddenly change leading to a vertical handover. A running TCP connection can experience a combination of three potential effects: a bandwidth change, a latency change and an outage interval due to handover operations. In this context, we address a detailed performance analysis of standard TCP, in comparison with a new TCP-based protocol, namely TCP Wave, which mainly replaces traditional window-based transmission paradigm with a proactive burst transmission. Previous studies demonstrate TCP Wave capability to quickly adapt its rate to dynamic link variations, so that its application in the target scenario is considered worth. Performance assessment is carried out using the Network Simulator (Ns-3) over a different set of possible configurations in terms of handover direction, outage duration and selected transport protocol. The achieved results confirm the TCP Wave efficiency in dealing with link changes and provide a high number of interesting hints for drawing requirements of the TCP-based transport protocols operating on future dynamic networks.

Paper Nr: 16
Title:

Host Discovery Solution: An Enhancement of Topology Discovery in OpenFlow based SDN Networks

Authors:

Pilar Manzanares-Lopez, Juan Pedro Muñoz-Gea, Francisco Manuel Delicado-Martinez, Josemaría Malgosa-Sanahuja and Adrian Flores de la Cruz

Abstract: Software Defined Networking (SDN) is an emerging paradigm based on the separation between the control plane and the data plane. The knowledge of the network topology by the controller is essential to allow the implementation of efficient solutions of network management and network resource utilization. Most of the OpenFlow SDN controllers include a mechanism to discover the network nodes (router and switches) and the links between them. However, they do not consider other important elements of the networks: the hosts. In this paper we propose a host discovery mechanism to improve the topology discovery solutions in SDN networks. The proposed mechanism, that has been coded as a software module in Ryu SDN controller, allows the detection and tracking of hosts even when they don’t generate traffic. The implemented software module has been tested in emulated SDN networks and in real scenarios using ONetSwitch, a real programmable SDN platform.

Paper Nr: 22
Title:

Virtualizing Service Infrastructure with Hardware Gateway in Data Center

Authors:

Junji Kinoshita and Norihisa Komoda

Abstract: Service providers have been struggling with service infrastructure management in their data centers like taking care of excess or shortage of physical resources. To solve the issue, we propose virtualization of service infrastructure by connecting physical resources with hardware gateway and virtualize network traffic among physical resources. With this approach, service providers can make their service infrastructure more flexible and dynamically change service infrastructure configuration like adding or removing physical resources on demand.

Posters
Paper Nr: 5
Title:

Improving IP Prefix Hijacking Detection by Tracing Hijack Fingerprints and Verifying Them through RIR Databases

Authors:

Hussain Alshamrani and Bogdan Ghita

Abstract: In spite of significant on-going research, the Border Gateway Protocol (BGP) still encompasses conceptual vulnerability issues regarding impersonating the ownership of IP prefixes for ASes (Autonomous Systems). In this context, a number of research studies focused on securing BGP through historical-based and statistical-based behavioural models. This paper improves the earlier IP prefix hijack detection method presented in (Alshamrani et al. 2015) by identifying false positives showing up due to the organisations that may use multiple ASNs (Autonomous System Numbers) to advertise their routes. To solve this issue, we link a Verification Database to the previously proposed detection method to improve the accuracy. The method extracts the organisation names (unique code) and associated ASNs from different ASN delegators and RIRs (Regional Internet Registries), more specifically the RIPE (Reseaux IP Europeans) dump database (John Stamatakis 2014) in order to evaluate the method. Since the organisation name is not available in the BGP updates, the data are extracted and processed to produce a structured database (Verification DB). The algorithm excludes false positive IP prefix hijack detection events in the SFL (Suspicious Findings List) introduced in (Alshamrani et al. 2015). Finally, the algorithm is validated using the 2008 YouTube Pakistan hijack event and the Con-Edison hijack (2006); the analysis demonstrates that the improved algorithm qualitatively increases the accuracy of detecting the IP prefix hijacks, specifically reducing the false positives.

Paper Nr: 21
Title:

Secrecy Computation without Changing Polynomial Degree in Shamir’s (K, N) Secret Sharing Scheme

Authors:

Takeshi Shingu, Keiichi Iwaumura and Kitahiro Kaneda

Abstract: In This Paper, We Propose a New Secrecy Multiplication Scheme without Changing the Degree in Shamir’s (K, N) Secret Sharing Scheme. This Scheme Generates a Scalar Value Called Concealed Secret, Which Multiplies a Secret by a Random Number, and Distributes the Concealed Secret by using a Secret Sharing Scheme. When Secrecy Multiplying, We Temporarily Reconstruct the Concealed Secret, and Multiply It with a Share. Therefore, We Can Perform Secrecy Multiplication without Changing the Degree of Polynomials by Multiplying a Polynomial and Scalar Value. Our Scheme Can Extend to Secrecy Division by Dividing a Share with the Concealed Secret. in Addition, We Propose Secrecy Addition and Subtraction Schemes. We Evaluate the Security of Our Schemes, and Show a Possible Application That Cannot Realized using the Conventional Scheme.