Posts with Tag ‘Network’

Service Availability and Discovery Responsiveness – A User-Perceived View on Service Dependability

Friday, March 20, 2015, 13:00
Service Availability and Discovery Responsiveness – A User-Perceived View on Service Dependability Author:
Andreas Dittrich

Ph.D. Thesis, submitted to the Faculty of Mathematics and Natural Sciences, Humboldt University of Berlin, December 9, 2014. Oral defense March 20, 2015.
Grade: magna cum laudae.

Reviewers:
Prof. Dr. Miroslaw Malek, Lugano, Switzerland
Prof. Dr. Alexander Reinefeld, Berlin, Germany
Prof. Dr. Jörg Kaiser, Magdeburg, Germany

Download: published version, meta information

Dependability of service provision is one of the primary goals in modern networks. Since providers and clients are part of a connecting Information and Communications Technology (ICT) infrastructure, service dependability varies with the position of actors as the ICT devices needed for service provision change. We present two approaches to quantify user-perceived service dependability. The first is a model-driven approach to calculate instantaneous service availability. Using input models of the service, the infrastructure and a mapping between the two to describe actors of service communication, availability models are automatically created by a series of model to model transformations. The feasibility of the approach is demonstrated using exemplary services in the network of University of Lugano, Switzerland. The second approach aims at the responsiveness of the service discovery layer, the probability to find service instances within a deadline even in the presence of faults, and is the main part of this thesis. We present a hierarchy of stochastic models to calculate user-perceived responsiveness based on monitoring data from the routing layer. Extensive series of experiments have been run on the Distributed Embedded Systems (DES) wireless testbed at Freie Universit├Ąt Berlin. They serve both to demonstrate the shortcomings of current discovery protocols in modern dynamic networks and to validate the presented stochastic models. Both approaches demonstrate that the dependability of service provision indeed differs considerably depending on the position of service clients and providers, even in highly reliable wired networks. The two approaches enable optimization of service networks with respect to known or predicted usage patterns. Furthermore, they anticipate novel service dependability models which combine service discovery, timeliness, placement and usage, areas that until now have been treated to a large extent separately.

Categories: Publication, Research and Education
Tags: , , , , , , , , , , , , , , , , , , , , ,

Responsiveness of Service Discovery in Wireless Mesh Networks

Monday, June 30, 2014, 08:28
Responsiveness of Service Discovery in Wireless Mesh Networks Authors:
Andreas Dittrich
Daniel Solis Herrera
Pablo Coto
Miroslaw Malek

20th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2014, Singapore, November 18-21, 2014

Download: accepted version, final published version

Service Discovery (SD) is an integral part of service networks. Before a service can be used, it needs to be discovered successfully. Thus, a comprehensive service dependability analysis needs to consider the dependability of the SD process. As a time-critical operation, an important property of SD is responsiveness: the probability of successful discovery within a deadline, even in the presence of faults. This is especially true for dynamic networks with complex fault behavior such as wireless networks. We present results of a comprehensive responsiveness evaluation of decentralized SD, specifically active SD using the Zeroconf protocol. The ExCovery experiment framework has been employed in the Distributed Embedded System (DES) wireless testbed at Freie Universit├Ąt Berlin. We present and discuss the experiment results and show how SD responsiveness is affected by the position and number of requesters and providers as well as the load in the network. Results clearly demonstrate that in all but the most favorable conditions, the configurations of current SD protocols struggle to achieve a high responsiveness. We further discuss results reflecting the long-term behavior of the testbed and how its varying reliability impacts SD responsiveness.

Categories: Publication, Research and Education
Tags: , , , , , , , , , , , , , , , , ,

A Resource-Optimized Approach to Efficient Early Detection of Mobile Malware

Friday, May 23, 2014, 14:36
A Resource-Optimized Approach to Efficient Early Detection of Mobile Malware Authors:
Jelena Milosevic
Andreas Dittrich
Miroslaw Malek
Alberto Ferrante

3rd International Workshop on Security of Mobile Applications, IWSMA 2014, Fribourg, Switzerland, September 8-12, 2014

Download: accepted version, final published version

With explosive growth in the number of mobile devices, the mobile malware is rapidly spreading. Existing solutions, which are mainly based on binary signatures, are no longer effective, making security one of the key issues. The main contribution of this paper is a novel methodology to design and implement secure mobile devices by offering a resource-optimized method that combines efficient, light-weight malware detection on the device with high precision detection methods on cloud servers. We focus on early detection of behavioral patterns of malware families rather than the detection of malware binary signatures. Together with the alarm about the device being attacked, damage that detected type of malware can cause is estimated. Furthermore, the database with behavioral patterns is continuously updated, thus keeping a device resistant to new malware families.

Categories: Publication, Research and Education, Security
Tags: , , , , , ,

ExCovery – A Framework for Distributed System Experiments and a Case Study of Service Discovery

Saturday, March 15, 2014, 00:00
ExCovery – A Framework for Distributed System Experiments and a Case Study of Service Discovery Authors:
Andreas Dittrich
Stefan Wanja
Miroslaw Malek

28th IEEE International Symposium on Parallel Distributed Processing, Workshops and PhD Forum, IPDPSW 2014, Phoenix, AZ, USA, May 19-23, 2014

Download: accepted version, final published version

GitHub Project Page and Source Repository

Experiments are a fundamental part of science. They are needed when the system under evaluation is too complex to be analytically described and they serve to empirically validate hypotheses. This work presents the experimentation framework ExCovery for dependability analysis of distributed processes. It provides concepts that cover the description, execution, measurement and storage of experiments. These concepts foster transparency and repeatability of experiments for further sharing and comparison. ExCovery has been tried and refined in a manifold of dependability related experiments during the last two years. A case study is provided to describe service discovery as experiment process. A working prototype for IP networks runs on the Distributed Embedded System (DES) wireless testbed at the Freie Universität Berlin.

Categories: Publication, Research and Education
Tags: , , , , , , , , ,

Probabilistic Breadth-First Search – A Method for Evaluation of Network-Wide Broadcast Protocols

Tuesday, January 21, 2014, 10:46
Probabilistic Breadth-First Search – A Method for Evaluation of Network-Wide Broadcast Protocols Authors:
Björn Lichtblau
Andreas Dittrich

6th IEEE/ACM/IFIP International Conference on New Technologies, Mobility and Security, NTMS 2014, Dubai, UAE, March 30 – April 2, 2014

Download: accepted version, final published version

In wireless mesh networks (WMNs), network-wide broadcasts (NWBs) are a fundamental operation, required by routing and other mechanisms that distribute information to all nodes in the network. However, due to the characteristics of wireless communication, NWBs are generally problematic. Optimizing them is thus a prime target when improving the overall performance and dependability of WMNs. Most of the existing optimizations neglect the real nature of WMNs and are based on simple graph models, which provide optimistic assumptions of NWB dissemination. On the other hand, models that fully consider the complex propagation characteristics of NWBs quickly become unsolvable due to their complexity. In this paper, we present the Monte Carlo method probabilistic breadth-first search (PBFS) to approximate the reachability of NWB protocols. PBFS simulates individual NWBs on graphs with probabilistic edge weights, which reflect link qualities of individual wireless links in the WMN, and estimates reachability over a configurable number of simulated runs. This approach is not only more efficient than existing ones, but further provides additional information such as the distribution of path lengths. Furthermore, it is easily extensible to NWB schemes other than flooding. The applicability of PBFS is validated both theoretically and empirically, in the latter by comparing reachability as calculated by PBFS and measured in a real-world WMN. Validation shows that PBFS quickly converges to the theoretically correct value and approximates the behaviour of real-life testbeds very well. The feasibility of PBFS to support research on NWB optimizations or higher level protocols that employ NWBs is demonstrated in two use cases.

Categories: Publication, Research and Education
Tags: , , , , ,